Abstract
Our goal is to generalize the well known bottom-up, set-oriented query evaluation for deductive databases in two aspects:
First, we consider arbitrary clauses as rules in the database, not only Horn clauses or clauses with stratified negation. This allows to represent disjunctive information, in the database as well as in answers to queries. We utilize NF2 relations for modelling sets of disjunctive facts and operations of the corresponding relational algebra for computing consequences and answers. Thus our algorithm should be of practical importance for applying database techniques in generalized deductions.
Second, we parameterize the implicit database completion which underlies query evaluation. The classical rule for Horn clause databases, which only assumes the negation of facts not implied by the database, is not applicable to disjunctive databases. Moreover, the choice of completion often depends on the intended application. Therefore we allow the specification of arbitrary clauses as defaults, and we extend our algorithm to consider such general defaults.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Bidoit, R. Hull: Positivism vs. minimalism in deductive databases. In Proc. of the 5th ACM Symp. on Principles of Database Systems (PODS'86), 123–132, 1986.
S. Brass, U. W. Lipeck: Specifying closed world assumptions for logic databases. In J. Demetrovics, B. Thalheim (eds.), 2nd Symposium on Mathematical Fundamentals of Database Systems (MFDBS'89), 68–84, LNCS 364, Springer-Verlag, Berlin, 1989.
S. Brass, U. W. Lipeck: Semantics of inheritance in logical object specifications. To appear in: Proc. of the 2nd International Conference on Deductive and Object-Oriented Databases (DOOD'91), LNCS, Springer-Verlag, 1991.
F. Bancilhon, R. Ramakrishnan: An amateur's introduction to recursive query processing. In C. Zaniolo (ed.), Proc. of SIGMOD'86, 16–52, 1986.
S. Brass: Beginnings of a theory of general database completions. In S. Abiteboul, P. C. Kanellakis (eds.), Third International Conference on Database Theory (ICDT'90), 349–363, LNCS 470, Springer-Verlag, Berlin, 1990.
F. Bry: Query evaluation in recursive databases: bottom-up and top-down reconciled. Data & Knowledge Engineering 5 (1990), 289–312.
G. Bossu, P. Siegel: Saturation, non-monotonic reasoning and the closed-world assumption. Artificial Intelligence 25 (1985), 13–63.
C.-L. Chang, R. C.-T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
M. L. Ginsberg: A circumscriptive theorem prover. Artificial Intelligence 39 (1989), 209–230.
M. Gelfond, H. Przymusinska: Negation as failure: Careful closure procedure. Artificial Intelligence 30 (1986), 273–287.
G. Hulin, A. Pirotte, D. Roelants, M. Vauclair: Logic and databases. In A. Thayse (ed.), From Modal Logic to Deductive Databases — Introducing a Logic Based Approach to Artificial Intelligence, volume 2, 279–350. Wiley, 1989.
J. W. Lloyd: Foundations of Logic Programming, 2nd edition. Springer-Verlag, Berlin, 1987.
J. McCarthy: Circumscription — a form of non-monotonic reasoning. Artificial Intelligence 13 (1980), 27–39.
J. McCarthy: Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence 28 (1986), 86–116.
J. Minker: On indefinite databases and the closed world assumption. In D. W. Loveland (ed.), 6th Conference on Automated Deduction, 292–308, LNCS 138, Springer-Verlag, Berlin, 1982.
J. Minker, D. Perlis: Computing protected circumscription. The Journal of Logic Programming 2 (1985), 235–249.
T. C. Przymusinski: On the declarative semantics of deductive databases and logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 193–216, Morgan Kaufmann Publishers, Los-Altos (Calif.), 1988.
T. C. Przymusinski: An algorithm to compute circumscription. Artificial Intelligence 38 (1989), 49–73.
R. Reiter: On closed world data bases. In H. Gallaire, J. Minker (eds.), Logic and Data Bases, 55–76, Plenum, New York, 1978.
A. Rajasekar, J. Lobo, J. Minker: Weak generalized closed world assumption. Journal of Automated Reasoning 5 (1989), 293–307.
K. A. Ross, R. W. Topor: Inferring negative information from disjunctive databases. Journal of Automated Reasoning 4 (1988), 397–424.
M. Ryan: Defaults and revision in structured theories. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'91), 362–373, 1991.
H.-J. Schek, M. H. Scholl: The relational model with relation-valued attributes. Information Systems 11 (1986), 137–148.
J. D. Ullman: Principles of Database and Knowledge-Base Systems, Vol. 2. Computer Science Press, Rockville, 1989.
A. Yahya, L. J. Henschen: Deduction in non-horn databases. Journal of Automated Reasoning 1 (1985), 141–160.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brass, S., Lipeck, U.W. (1992). Generalized bottom-up query evaluation. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032425
Download citation
DOI: https://doi.org/10.1007/BFb0032425
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive