A uniform approach to logic programming semantics

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 93-121

  Hitzler, Pascal ^a   Wendt, Matthias ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Fitting semantics; Least model seman tics; Level mapping; Stable semantics; Weak stratification; Well founded semantics

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; MAPPING; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS;

FITTING SEMANTICS; LEAST MODEL SEMANTICS; LEVEL MAPPING; STABLE SEMANTICS; WEAK STRATIFICATION; WELL-FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 14544275899     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002212     Document Type: Article

References (54)

1. ABRAMSKY, S. AND JUNG, A. 1994. Domain theory. In Handbook of Logic in Computer Science, S. Abramsky, D. Gabbay, and T. S. Maibaum, Eds. Vol. 3. Clarendon, Oxford, 1-168.
2. APT, K. R., BLAIR, H. A. AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, Los Altos, CA, 89-148.
3. APT, K. R. AND PEDRESCHI, D. 1993. Reasoning about termination of pure Prolog programs. Information and Computation 106, 109-157.
4. ARIELI, O. 2002. Paraconsistent declarative semantics for extended logic programs. Annals of Mathematics and Artificial Intelligence 36(4), 381-417.
5. ARIELI, O. AND AVRON, A. 1994. Logical bilattices and inconsistent data. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science. IEEE Press, 468-476.
6. ARIELI, O. AND AVRON, A. 1998. The value of the four values. Artificial Intelligence 102, 1, 97-141.
7. BELNAP, N. D. 1977. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, J. M. Dunn and G. Epstein, Eds. Reidel, Dordrecht, 5-37.
8. BEZEM, M. 1989. Characterizing termination of logic programs with level mappings. In Proceedings of the North American Conference on Logic Programming, E. L. Lusk and R. A. Overbeek, Eds. MIT Press, Cambridge, MA, 69-80.
9. BONNIER, S., NILSSON, U. AND NÄSLUND, T. 1991. A simple fixed point characterization of three-valued stable model semantics. Information Processing Letters 40, 2, 73-78.
10. CAVEDON, L. 1991. Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science 86, 81-92.
11. DENECKER, M., MAREK, V. W. AND TRUSZCZYNSKI, M. 2000. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In Logic-based Artificial Intelligence, J. Minker, Ed. Kluwer Academic Publishers, Boston, Chapter 6, 127-144.
12. DIX, J. 1995a. A classification theory of semantics of normal logic programs: I. Strong properties. Fundamenta Informaticae 22, 3, 227-255.
13. DIX, J. 1995b. A classification theory of semantics of normal logic programs: II. Weak properties. Fundamenta Informaticae 22, 3, 257-288.
14. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G. AND SCARCELLO, F. 1997. A deductive system for nonmonotonic reasoning. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97), J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Artificial Intelligence, vol. 1265. Springer, Berlin, 364-375.
15. FAGES, F. 1994. Consistency of dark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
16. FITTING, M. 1985. A Kripke-Kleene semantics for general logic programs. The Journal of Logic Programming 2, 295-312.
17. FITTING, M. 1991a. Bilattices and the semantics of logic programming. The Journal of Logic Programming 11, 91-116.
18. FITTING, M. 1991b. Well-founded semantics, generalized. In Logic Programming, Proceedings of the 1991 International Symposium. MIT Press, Cambridge, MA, 71-84.
19. FITTING, M. 1993. The family of stable models. Journal of Logic Programming 17, 197-225.
20. FITTING, M. 1994. Metric methods: Three examples and a theorem. The Journal of Logic Programming 21, 3, 113-127.
21. FITTING, M. 2002. Fixpoint semantics for logic programming - A survey. Theoretical Computer Science 278, 1-2, 25-51.
22. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070-1080.
23. GINSBERG, M. L. 1986. Bilattices. Tech. Rep. 86-72, Stanford University, KSL.
24. GINSBERG, M. L. 1992. Multivalued logics: A uniform approach to inference in artificial intelligence. Computational Intelligence 4, 3, 256-316.
25. HITZLER, P. 2001. Generalized metrics and topology in logic programming semantics. Ph.D. thesis, Department of Mathematics, National University of Ireland, University College Cork.
26. HITZLER, P. 2003. Towards a systematic account of different logic programming semantics, In Proceedings of the 26th German Conference on Artificial Intelligence, KI2003, Hamburg, September 2003, A. Günter, R. Krause, and B. Neumann, Eds. Lecture Notes in Artificial Intelligence, vol. 2821. Springer, Berlin, 355-369.
27. HITZLER, P. AND SEDA, A. K. 1999. Characterizations of classes of programs by three-valued operators. In Logic Programming and Nonmonotonic Reasoning, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, El Paso, Texas, USA, M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in Artificial Intelligence, vol. 1730. Springer, Berlin, 357-371.
28. HITZLER, P. AND SEDA, A. K. 2000. A note on relationships between logic programs and neural networks. In Proceedings of the Fourth Irish Workshop on Formal Methods, IWFM'00, P. Gibson and D. Sinclair, Eds. Electronic Workshops in Comupting (eWiC). British Computer Society.
29. HITZLER, P. AND SEDA, A. K. 2001. Unique supported-model classes of logic programs. Information 4, 3, 295-302.
30. HITZLER, P. AND SEDA, A. K. 2003a. Continuity of semantic operators in logic programming and their approximation by artificial neural networks. In Proceedings of the 26th German Conference on Artificial Intelligence, KI2003, A. Günter, R. Krause, and B. Neumann, Eds. Lecture Notes in Artificial Intelligence, vol. 2821. Springer, 105-119.
31. HITZLER, P. AND SEDA, A. K. 2003b. Generalized metrics and uniquely determined logic programs. Theoretical Computer Science 305, 1-3, 187-219.
32. HITZLER, P. AND WENDT, M. 2002. The well-founded semantics is a stratified Fitting semantics. In Proceedings of the 25th Annual German Conference on Artificial Intelligence, KI2002, Aachen, Germany, September 2002, M. Jarke, J. Koehler, and G. Lakemeyer, Eds. Lecture Notes in Artificial Intelligence, vol. 2479. Springer, Berlin, 205-221.
33. HÖLLDOBLER, S., KALINKE, Y. AND STÖRR, H.-P. 1999. Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11, 45-58.
34. KRAUS, S., LEHMANN, D. AND MAOIDOR, M. 1990. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 1, 167-207.
35. KUNEN, K. 1987. Negation in logic programming. The Journal of Logic Programming 4, 289-308.
36. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 39-54.
37. LIFSCHITZ, V., MCCAIN, N., PRZYMUSINSKI, T. C. AND STÄRK, R. F. 1995. Loop checking and the well-founded semantics. In Logic Programming and Non-monotonic Reasoning, Proceedings of the 3rd International Conference, LPNMR'95, Lexington, KY, USA, June 1995, V. W. Marek and A. Nerode, Eds. Lecture Notes in Computer Science, vol. 928. Springer, 127-142.
38. LLOYD, J. W. 1988. Foundations of Logic Programming. Springer, Berlin.
39. MAKINSON, D. 1994. General patterns of nonmonotonic reasoning. In Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic and Uncertain Reasoning, D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds. Oxford University Press.
40. MARCHIORI, E. 1996. On termination of general logic programs with respect to constructive negation. The Journal of Logic Programming 26, 1, 69-89.
41. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Persepective, K. R. Apt, V. W. Marek, M. Truszczynski, and D. S. Warren, Eds. Springer, Berlin, 375-398.
42. PEARCE, D. 1997. A new logical characterisation of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming, NMELP '96, J. Dix, L. M. Pereira, and T. C. Przymusinski, Eds. Lecture Notes in Computer Science, vol. 1216. Springer, 57-70.
43. PEDRESCHI, D., RUGGIERI, S. AND SMAUS, J.-G. 2002. Classes of terminating logic programs. Theory and Practice of Logic Programs 2, 3, 369-418.
44. PRZYMUSINSKA, H. AND PRZYMUSINSKI, T. C. 1990. Weakly stratified logic programs. Fundamenta Informaticae 13, 51-65.
45. PRZYMUSINSKI, T. C. 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, Los Altos, CA, 193-216.
46. PRZYMUSINSKI, T. C. 1989. Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae 13, 4, 445-464.
47. SEDA, A. K. 1995. Topology and the semantics of logic programs. Fundamenta Informaticae 24, 4, 359-386.
48. SEDA, A. K. 1997. Quasi-metrics and the semantics of logic programs. Fundamenta Informaticae 29, 1, 97-117.
49. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 200x. Extending and implementing the stable model semantics. Artificial Intelligence. 138, 1-2, 181-234.
50. STOLTENBERO-HANSEN, V., LINDSTRÖM, I. AND GRIFFOR, E. R. 1994. Mathematical Theory of Domains. Cambridge University Press.
51. TURNER, H. 2001. Order-consistent programs are cautiously monotonie. Journal of Theory and Practice of Logic Programming 1, 4, 487-495.
52. VAN GELDER, A. 1988. Negation as failure using tight derivations for general logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, Los Altos, CA, 149-176.
53. VAN GELDER, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania. ACM Press, 1-10.
54. VAN GELDER, A., ROSS, K. A. AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620-650.