What's in a Model? Epistemological Analysis of Logic Programming

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 106-113

  Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL METHODS; KNOWLEDGE REPRESENTATION; SEMANTICS;

DECLARATIVE KNOWLEDGE; DECLARATIVE READING; FORMAL SEMANTICS; FORMAL SYNTAXES; KNOWLEDGE REPRESENTATION LANGUAGE; LOGIC-PROGRAMMING;

LOGIC PROGRAMMING;

EID: 33845186058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Apt, K., and Bezem, M. 1990. Acyclic programs. In Proc. of the International Conference on Logic Programming, 579-597. MIT Press.
2. Apt, K.; Blair, H.; and Walker, A. 1988. Towards a theory of Declarative Knowledge. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann. 89-148.
3. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
4. Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Databases. Plenum Press. 293-322.
5. Denecker, M., and Ternovska, E. 2004a. Inductive Situation Calculus. In Proceedings of Ninth International Conference on Principles of Knowledge Representation and Reasoning, Delta Whistler Resort, Canada. URL = http://www.cs.kuleuven.ac.be/cgi-bindtai/publ_info.pl?id=41085.
6. Denecker, M., and Ternovska, E. 2004b. A logic of nonmonotone inductive definitions and its modularity properties. In Lifschitz, V., and Niemelä, I., eds., 7th International Conference on Logic Programming and Nonmonotonic Reasoning.
7. Denecker, M.; Bruynooghe, M.; and Marek, V. 2001. Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic 2(4):623-654.
8. Denecker, M.; Marek, V.; and aw Truszczyński, M. 2003. Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence 143(1):79-122.
9. Denecker, M. 1998. The well-founded semantics is the principle of inductive definition. In Dix, J.; Fariñas del Cerro, L.; and Furbach, U., eds., Logics in Artificial Intelligence, volume 1489 of Lecture Notes in Artificial Intelligence, 1-16. Schloss Daghstull: Springer-Verlag.
10. Gelfond, M., and Leone, N. 2002. Logic programming and knowledge representation - a-prolog perspective. Artificial Intelligence 138(1-2):3-38.
11. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the International Joint Conference and Symposium on Logic Programming, 1070-1080. MIT Press.
12. Gelfond, M., and Lifschitz, V. 1990. Logic Programs with Classical Negation. In Warren, D., and Szeredi, P., eds., Proc. of the 7th International Conference on Logic Programming 90, 579. MIT Press.
13. Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 365-387.
14. Gelfond, M. 1987. On Stratified Autoepistemic Theories. In Proc. of AAAI87, 207-211. Morgan Kaufman.
15. Gelfond, M. 2002. Representing knowledge in a-prolog. In Kakas, A., and Sadri, F., eds., Computational Logic: Logic Programming and Beyond; Essays in honour of Robert A. Kowalski, Part II, number 2407 in Lecture Notes in Computer Science. Springer Verlag. 413-451.
16. Hayes, P. 1977. In defense of logic. In Proc. of the 5th IJCAI77.
17. Kakas, A. C.; Kowalski, R.; and Toni, F. 1992. Abductive Logic Programming. Journal of Logic and Computation 2(6):719-770.
18. Lifschitz, V. 1999. Answer set planning. In De Schreye, D., ed., Logic Programming, Proc. 1999 Int. Conf. on Logic Programming (ICLP'99), 23-37. MIT Press.
19. Lifschitz, V. 2002. Answer Set programming and plan generation. Artificial Intelligence 138(1-2):39-54.
20. Marek, V., and Truszczyński, M. 1989. Stable semantics for logic programs and default reasoning. In E.Lust, and Overbeek, R., eds., Proc. of the North American Conference on Logic Programming and Non-monotonic Reasoning, 243-257.
21. Marek, V., and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In Apt, K.; Marek, V.; Truszczynski, M.; and Warren, D., eds., The Logic Programming Paradigm: a 25 Years Perspective. Springer-Verlag. pp. 375-398.
22. Moore, R. 1983. Semantical Considerations on non-monotonic logic. In Proc. of IJCAI-83, 272-279.
23. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4):241-273.
24. Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence 13:81-132.
25. van Emden, M., and Kowalski, R. 1976. The semantics of Predicate Logic as a Programming Language. Journal of the ACM 23(4):733-742.
26. Van Gelder, A.; Ross, K. A.; and Schlipf, J. 1991. The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3):620-650.
27. Woods, W. 1975. What's in a Link: Foundations for Semantic Networks. In Bobrow, D., and Collins, A., eds., Representation and understanding: Studies in cognitive science. Academic Press, New York. Also in Brachman and Levesque, Readings in Knowledge Representation, Morgan Kaufman, 1985.