Abstract
A top-down query processing method for first order deduc- tive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation 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 may be enhanced by the application of partial compilation, subgoal re-ordering, and further constraints on the format of database rules. For finite propositional databases the method runs in polynomial space.
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
C. Aravindan, J. Dix and I. Niemelä, DISLOP: A research project on disjunctive logic programming, AI communications, vol. 10 (1997), 151–165.
S. Brass, J. Dix, I. Niemelä and T. C. Przymusinski, 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).
S. Brass and J. Dix, Characterisations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automated Reasoning, vol. 20 (1998), 143–165.
S. Brass and J. Dix, Semantics of (disjunctive) logic programs based upon partial evaluation, J. Logic Programming, vol. 40 (1999), 1–46.
J. Dix, Semantics of logic programs: Their intuitions and formal properties, in A. Puhrman and H. Rott (eds.), Logic, Action and Information, Essays on Logic in Philosophy and Artificial Intelligence (DeGruyter, 1995), 241–327.
C. A. Johnson, On computing minimal and perfect model membership, Data and Knowledge Engineering, vol. 18 (1996), 225–276.
C. A. Johnson, Extended deduction trees and query processing, Computer Science technical report TR98-07, Keele University (1997).
C. A. Johnson, Top-down query processing in indefinite stratified databases, Data and Knowledge Engineering, vol. 26 (1998), 1–36. (Extracted from [7].)
C. A. Johnson, On cyclic covers and perfect models, Data and Knowledge Engineering, vol. 31 (1999), 25–65.
C. A. Johnson, On the computation of the disjunctive well-founded semantics, submitted, J. Automated Reasoning.
C. A. Johnson, Processing deductive databases under the disjunctive stable model semantics, Fundamenta Informaticae, vol. 41 (1999), 31–51.
I. Niemelä, 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), 278–294.
A. Rajasekar, Semantics for Disjunctive Logic Programs, PhD thesis, University of Maryland (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnson, C.A. (2000). Top-Down Query Processing in First Order Deductive Databases under the DWFS. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_40
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)