Advertisement

The Well-Founded Semantics Is a Stratified Fitting Semantics

  • Pascal Hitzler
  • Matthias Wendt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2479)

Abstract

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. While several different semantics have been proposed, and some have been more successful than others, the exact relationships between the approaches have not yet been fully understood. In this paper, we give new characterizations, using level mappings, of the Fitting semantics, the well-founded semantics, and the weakly perfect model semantics. The results will unmask the well-founded semantics as a stratified version of the Fitting semantics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Subrahmanian, V.S.: Nonmonotonic logic programming. IEEE Transactions on Knowledge and Data Engineering 11 (1999) 143–152CrossRefGoogle Scholar
  2. 2.
    Fitting, M.: A Kripke-Kleene-semantics for general logic programs. Journal of Logic Programming 2 (1985) 295–312CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38 (1991) 620–650zbMATHCrossRefGoogle Scholar
  4. 4.
    Fitting, M.: Fixpoint semantics for logic programming — A survey. Theoretical Computer Science (200x) To appear.Google Scholar
  5. 5.
    Denecker, M., Marek, V.W., Truszynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In Minker, J., ed.: Logic-based Artificial Intelligence. Kluwer Academic Publishers, Boston (2000) 127–144Google Scholar
  6. 6.
    Przymusinska, H., Przymusinski, T.C.: Weakly stratified logic programs. Fundamenta Informaticae 13 (1990) 51–65 Krzysztof R. Apt, editor, special issue of Fundamenta Informaticae on Logical Foundations of Artificial Intelligence.Google Scholar
  7. 7.
    Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, CA (1988) 89–148Google Scholar
  8. 8.
    Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, CA (1988) 193–216Google Scholar
  9. 9.
    Apt, K.R., Pedreschi, D.: Reasoning about termination of pure prolog programs. Information and Computation 106 (1993) 109–157zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Fitting, M.: Metric methods: Three examples and a theorem. Journal of Logic Programming 21 (1994) 113–127zbMATHMathSciNetGoogle Scholar
  11. 11.
    Seda, A.K.: Topology and the semantics of logic programs. Fundamenta Informaticae 24 (1995) 359–386zbMATHMathSciNetGoogle Scholar
  12. 12.
    Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science (200x) To appear.Google Scholar
  13. 13.
    Hölldobler, S., Kalinke, Y., Störr, H.P.: Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11 (1999) 45–58CrossRefGoogle Scholar
  14. 14.
    Wendt, M.: Towards a unified view of the hierarchy of logic program classes. Project Thesis, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology (2002)Google Scholar
  15. 15.
    Lifschitz, V., McCain, N., Przymusinski, T.C., Staerk, R.F.: Loop checking and the well-founded semantics. In Marek, V.W., Nerode, A., eds.: Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’95). Volume 928 of Lecture Notes in Artificial Intelligence., Springer, Berlin (1995) 127–142Google Scholar
  16. 16.
    Leone, N., Rullo, P., Scarello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135 (1997) 69–112zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Rounds, W.C., Zhang, G.Q.: Clausal logic and logic programming in algebraic domains. Information and Computation 171 (2001) 156–182CrossRefMathSciNetGoogle Scholar
  18. 18.
    Hitzler, P.: Resolution and logic programming in algebraic domains: Negation and defaults. Technical Report WV-02-05, Knowledge Representation and Reasoning Group, Department of Computer Science, Dresden University of Technology, Dresden, Germany (2002)Google Scholar
  19. 19.
    Marek, V.W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In Apt, K.R., Marek, V.W., Truszczyński, M., Warren, D.S., eds.: The Logic Programming Paradigm: A 25 Year Persepective. Springer, Berlin (1999) 375–398Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Pascal Hitzler
    • 1
  • Matthias Wendt
    • 1
  1. 1.Artificial Intelligence Institute, Department of Computer ScienceDresden University of TechnologyDresdenGermany

Personalised recommendations