Skip to main content
SpringerLink
Log in

On the Computation of the Disjunctive Well-Founded Semantics

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

A characterization of the disjunctive well-founded semantics (DWFS) is given in terms of the Gelfond–Lifschitz transformation. This characterization is used to develop a top-down method of testing DWFS membership, employing a hyperresolution-like operator and quasi-cyclic trees to handle minimal model processing. A flexible bottom-up method of computing the DWFS is also given that admits the use of a powerful reduction operator. For finite propositional databases, all of our methods run in polynomial space.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aravindan, C., Dix, J. and Niemelä, I.: DISLOP: A research project on disjunctive logic programming, AI Communications 10 (1997), 151–165.

    Google Scholar 

  2. Baral, C., Lobo, J. and Minker, J.: WF3: A semantics for negation in normal disjunctive logic programs, in Z. Ras and M. Zemankova (eds.), Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Comput. Sci. 542, Springer, pp. 459–468.

  3. Baral, C., Lobo, J. and Minker, J.: Generalised disjunctive well-founded semantics for logic programs, Ann. of Math. and Artif. Intell. 5 (1992), 89–132.

    Google Scholar 

  4. Bibel, W.: Automated Theorem Proving, Vieweg, Wiesbaden, 1987.

  5. Brass, S. and Dix, J.: A disjunctive semantics based upon unfolding and bottom-up evaluation, in B. Wolfinger (ed.), Innovationen bei Rechen-und Kommunikationssystemen, IFIP-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases, Springer, 1994, pp. 83–91.

  6. Brass, S. and Dix, J.: Disjunctive semantics based upon partial and bottom-up evaluation, in L. Sterling (ed.), Proceedings of the 12th International Conference on Logic Programming, Tokyo, MIT Press.

  7. 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.

  8. Brass, S. and Dix, J.: Characterisations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automated Reasoning 20 (1998), 143–165.

    Google Scholar 

  9. Brass, S. and Dix, J.: Semantics of disjunctive logic programs based upon partial evaluation, J. Logic Programming 40 (1999), 1–46.

    Google Scholar 

  10. 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, DeGruyter, 1995, pp. 241–327.

  11. Dix, J. and Stolzenburg, F.: A framework to incorporate non-monotonic reasoning into constraint logic programming, J. Logic Programming 37 (1997), 47–76.

    Google Scholar 

  12. Gelfond, M. and Lifschitz, V.: The stable model semantics for logic programming, in R. Kowalski and K. Bowen (eds.), Proceedings of the 5th International Conference on Logic Programming, Seattle, 1988, pp. 1070–1080.

  13. Grant, J. and Minker, J.: Answering queries in indefinite databases and the null value problem, Adv. in Comput. Res. 3 (1986), 247–267.

    Google Scholar 

  14. Johnson, C. A.: Top-down deduction in indefinite deductive databases, in F. Bry (ed.), Proceedings of the 1993 Journées Bases de Données Avancées, Toulouse, NRIA, France, pp. 119–138.

  15. Johnson, C. A.: On computing minimal and perfect model membership, Data and Knowledge Engineering 18 (1996), 225–276.

    Google Scholar 

  16. Johnson, C. A.: Extended deduction trees and query processing, Computer Science Technical Report TR98–07, Keele University, 1997.

  17. Johnson, C. A.: Top-down query processing in indefinite stratified databases, Data and Knowledge Engineering 26 (1998), 1–36. (Extracted from [Jo98].)

    Google Scholar 

  18. Johnson, C. A.: On cyclic covers and perfect models, Data and Knowledge Engineering 31 (1999), 25–65.

    Google Scholar 

  19. Johnson, C. A.: Top-down query processing in first order deductive databases under the DWFS, 12th International Symposium on Methodologies for Intelligent Systems (Charlotte, NC, October 2000), accepted.

  20. Lobo, J., Minker, J. and Rajasekar, A.: Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  21. 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.

    Google Scholar 

  22. Przymusinski, T.: On the declarative semantics of deductive databases and logic programs, in J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Washington, 1998, pp. 193–216.

    Google Scholar 

  23. Przymusinski, T.: Stable semantics for disjunctive programs, New Generation Computing 9 (1991), 401–424.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Keele, Staffordshire, ST5 5BG, England

    C. A. Johnson

Authors
  1. C. A. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Johnson, C.A. On the Computation of the Disjunctive Well-Founded Semantics. Journal of Automated Reasoning 26, 333–356 (2001). https://doi.org/10.1023/A:1010744127526

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010744127526

Search

Navigation