Abstract
In this paper, an algorithm is presented for answering recursive queries under the Generalized Closed World Assumption (GCWA) in a database with positive non-Horn ground clauses. It is proved that the algorithm generates all the answers under the GCWA. We consider only the transitive closure recursions in which only one base relation is involved. The set of ground clauses is stored as one relation so that a modified join operator can be applied to the clauses. The relation can be visualized as a directed graph with each tuple representing an edge. A query (only closed queries are considered in this paper) is answered by extracting the paths from the relation, forming the negative clauses from these paths, and sending the negative clauses together with the non-Horn clauses to a theorem prover. We proved that if the empty clause is derived then the answer to the query is true. This algorithm is efficient for two reasons: 1) facts (positive unit ground clauses) are processed by the modified join operator, and 2) the theorem prover handles only the non-Horn ground clauses and some negative ground clauses.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bancilhon, F. and Ramakrishnan, R., “An amateure's introduction to recursive query processing strategies,” ACM SIGMOD Conference on Management of Data, (1986).
Bossu, G. and Siegel, P., “Saturation, nonmonotonic reasoning and the closed-world assumption,” Artificial Intelligence 25, (1985), pp. 13–63.
Chang, C.L., “On evaluation of queries containing derived relations,” Advances in Data Base Theory 1, H. Gallaire and J. Minker, and J.M. Nicolas, Eds., Plenum Press, New York, (1981), pp. 235–260.
Codd, E.F., “Extending the database relational model to capture more meaning,” ACM Transactions on Database Systems 4, 4, (December 1979), pp. 339–434.
Grant, J. and Minker, J., “Answering queries in indefinite databases and the null value problems,” University of Maryland, College Park, Maryland, (July 1981).
Han, J.,Pattern-Based and Knowledge-Directed Query Compilation for Recursive Databases, Ph.D. thesis, University of Wisconsin-Madison, (1985).
Henschen, L.J. and Naqvi, S., “On compiling queries in recursive first-order databases,” JACM 31,1, (January 1984), pp. 47–85.
Henschen, L.J. and Park, H., “Indefinite and GCWA inference in indefinite deductive databases,” Proc. AAAI-86.
Minker, J., “On indefinite database and the closed world assumption,” Lecture Notes in Computer Science 138, Springer-Verlag, (1982), pp. 292–308.
Minker, J., and Nicolas J., “On Recursive Axioms in Relational Databases,” Tech. Rep. No. 1119, University of Maryland, College Park, Maryland, (1981).
Reiter, R., “Deductive question answering on relational data bases,” Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum Press, New York, (1978), pp. 149–177.
Reiter, R., “Question answering on relational databases,” Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum Press, New York, (1978), pp. 55–76.
Wos, L., Overbeek, R., Lusk, E. and Boyle, J.: Automated Reasoning, Introduction and Applications, Prentice-Hall, (1984).
Yahya, A. and Henschen, L.J., “Deduction in non-Horn databases,” Journal of Automated Reasoning 1, No.2, (1985), pp., 141–160.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chi, S., Henschen, L.J. (1988). Recursive query answering with non-horn clauses. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012838
Download citation
DOI: https://doi.org/10.1007/BFb0012838
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive