The Well-Founded Semantics Is a Stratified Fitting Semantics
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.
Unable to display preview. Download preview PDF.
- 4.Fitting, M.: Fixpoint semantics for logic programming — A survey. Theoretical Computer Science (200x) To appear.Google Scholar
- 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.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.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.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
- 12.Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science (200x) To appear.Google Scholar
- 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.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
- 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.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