Abstract
A top-down query-processing method for first-order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based on a characterization of the DWFS in terms of the Gelfond–Lifschitz transformation and employs a hyperresolution-like operator and quasi-cyclic trees to handle minimal model processing. The method is correct and complete and can be guaranteed to terminate given certain mild constraints on the format of database rules. The efficiency of the method is enhanced by the fact that large parts of the search tree are naturally grounded, even for first-order queries and databases. In the case of a grounded yes/no answer, the search tree becomes nongrounded only if processing enters the definite part of the database. For finite propositional databases the method runs in polynomial space. Efficiency may be enhanced by the application of partial compilation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aravindan, C., Dix, J. and Niemelä, I.: DISLOP: A research project on disjunctive logic programming, AI Comm. 10 (1997), 151-165.
Brass, S., Dix, J., Niemelä, I. and Przymusinski, T. C.: A comparison of the static and disjunctive well-founded semantics, in A. G. Cohn, L. K. Schubert and S. C. Shapiro (eds.), Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1998.
Brass, S. and Dix, J.: Characterisations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA, J. Automated Reasoning 20 (1998), 143-165.
Brass, S. and Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation, J Logic Programming 40 (1999), 1-46.
Dix, J.: Semantics of logic programs: Their intuitions and formal properties, in A. Fuhrman and H. Rott (eds.), Logic, Action and Information, Essays on Logic in Philosophy and Artificial Intelligence, De Gruyter, 1995, pp. 241-327.
Johnson, C. A.: On computing minimal and perfect model membership, Data and Knowledge Engineering 18 (1996), 225-276.
Johnson, C. A.: Extended deduction trees and query processing, Computer Science technical report TR98-07, Keele University, 1998. Available May 2003: www.tech.plym.ac.uk/soc/staff/chrisjohnson/tr95.html.
Johnson, C. A.: Top-down query processing in indefinite stratified databases, Data and Knowledge Engineering 26 (1998), 1-36 (extracted from [7]).
Johnson, C. A.: On cyclic covers and perfect models, Data and Knowledge Engineering 31 (1999), 25-65.
Johnson, C. A.: On the computation of the disjunctive well-founded semantics, J. Automated Reasoning 26 (2001), 333-356.
Johnson, C. A.: Processing deductive databases under the disjunctive stable model semantics, Fund. Inform. 40 (1999), 31-51.
Niemelä, I.: A tableau calculus for minimal model reasoning, in Proceedings of the 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Italy, Springer, 1996, pp. 278-294.
Rajasekar, A.: Semantics for disjunctive logic programs, Ph.D. thesis, University of Maryland, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johnson, C.A. Top-Down Query Processing in First-Order Deductive Databases under the DWFS. Journal of Automated Reasoning 32, 167–184 (2004). https://doi.org/10.1023/B:JARS.0000030010.90643.41
Issue Date:
DOI: https://doi.org/10.1023/B:JARS.0000030010.90643.41