Abstract
We define the range form of deductive databases and queries. We prove that transformation into range form preserves logical equivalence. On the basis of the range form, we define the class of range restricted deductive databases and queries. SLDNF-resolution is used for query evaluation. We show that query evaluation of range restricted deductive databases and queries never flounders, and that range restricted is broader than comparable properties found in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clark, K., Negation as Failure, in H. Gallaire, J. Minker (eds), Logic and Data Bases, 293–322, Plenum, New York, 1978.
Decker, H., Integrity Enforcement on Deductive Databases, in Proc. 1st Intl. Conf. on Expert Database Systems, 271–285, Charleston, South Carolina, April 1986.
Decker, H., Domain-independent and Range-restricted Formulas and Deductive Databases, in Proc. Seminaire sur la Programmation en Logique, CNET, 25- 27 May 1988, Tregastel, France.
Decker, H., The Range Form of Databases and Queries, or: How to Avoid Floundering (long version), IR-KB-26, ECRC, 1986, revised 1988.
Dincbas, M. and Simonis, H. and Vanhentenryck, P., Extending Equation Solving and Constraint Handling in Logic Programming, in Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, Austin, Texas, May 1987.
Gallaire, H. et al, Logic and Databases — A Deductive Approach, Computing Surveys 16 /2: 153–185 (1984).
Kobayashi, I., Schema Equivalence and Consistency in Database Systems, PhD Thesis, Faculty of Engineering, University of Tokyo, 1988
Lloyd, J.W., Foundations of Logic Programming, second, extended edition, Symbolic C Series, Springer, 1987 (first edition appeared 1984 ).
Lloyd, J.W. and Topor, R.W., Making Prolog More Expressive, J. Logic Programming 1: 225–240 (1984).
Lloyd, J.W. and Topor, R.W., A Basis for Deductive Database Systems II, J. Logic Programming 3: 55–67 (1986).
Manna, Z., Mathematical Theory of Computation, Computer Science Series, McGraw-Hill, New York, 1974.
Nicolas, J.M., et al., Some steps towards a DBMS based KBMS, in Proc. IFIP 10th World Comp. Congress, 1061–1067, Dublin, Ireland, September 1986.
Reiter, R., On the Integrity of Typed First Order Databases, in Gallaire et al (eds), Advances in Database Theory I, pp 137–157, Plenum, New York, 1981.
Reiter, R., Towards a Logical Reconstruction of Relational Database Theory, in M. Brodie et al (eds), On Conceptual Modeling, Springer, 1984.
Shepherdson, J.C., Negation as Failure: A Comparison of Clark’s Completed Data Base and Reiter’s Closed World Assumption, in J. Logic Programming, 1: 51–79, 1984.
Topor, R.W., Domain Independent Formulas and Databases, in Theoretical Computer Science, 52/3:281–307, 1987.
Van Gelder, A., Topor, R.W., Safety and Correct Translation of Relational Calculus Formulas, in Proc. PODS, 1987.
Wallace, M.G., Negation by Constraints — a Sound and Efficient Implementation of Negation in Deductive Databases, in Proc. 1987 Symposium on Logic Programming, San Francisco, August 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Decker, H. (1989). The Range Form of Databases and Queries or: How to Avoid Floundering. In: Retti, J., Leidlmair, K. (eds) 5. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74688-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-74688-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51039-0
Online ISBN: 978-3-642-74688-8
eBook Packages: Springer Book Archive