A note on the stable model semantics for logic programs

Artificial Intelligence

Volumn 96, Issue 2, 1997, Pages 467-479

  Kaminski, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Herbrand interpretations; Logic programs; Open default theories; Stable model semantics

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; TRANSLATION (LANGUAGES);

HERBRAND INTERPRETATIONS;

COMPUTATIONAL LINGUISTICS;

EID: 0031274919     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00058-1     Document Type: Article

References (24)

1. K.R. Apt and R.N. Bol, Logic programming and negation: a survey, J. Logic Programming 19-20 (1994) 9-71.
2. N. Bidoit and C. Froidevaux, General logical databases and programs: default logic semantics and stratification, Inform. and Comput. 91 (1991) 15-54.
3. C.C. Chang and H.J. Keisler, Model Theory (North-Holland, Amsterdam, 1990).
4. K.L. Clark, Negation as failure, in: H. Gallaire and J. Minker, eds., Logic and Databases (Plenum Press, New York, 1978) 293-322.
5. M. Gelfond, On stratified autoepstemic theories, in: Proceedings AAAI-87, Seattle, WA (American Association for Artificial Intelligence, 1987) 207-211.
6. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: R. Kowalski and K. Bowen, eds., Logic Programming: Proceedings 5th International Conference (1988) 1070-1080.
7. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Comput. 9 (1991) 365-385.
8. M. Gelfond and H. Przymusinska, Reasoning in open domains, in: L.M. Pereira and A. Nerode, eds., Proceedings 2nd Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1993) 397-413.
9. R. Guerreiro and M. Casanova, An alternative semantics for default logic, Preprint, in: Proceedings 3rd International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, CA (1990).
10. M. Kaminski, A comparative study of open default theories, Artificial Intelligence 77 (1995) 285-319.
11. M. Kaminski, J.A. Makowsky and M. Tiomkin, Extensions for open default theories via the domain closure assumption, J. Logic and Comput. 8 (1998).
12. K. Kunen, Negation in logic programming, J. Logic Programming 4 (1987) 289-308.
13. K. Kunen, Signed data dependencies in logic programs, J. Logic Programming 7 (1989) 231-245.
14. V. Lifschitz, On open defaults, in: J.W. Lloyd, ed., Computational Logic: Symposium Proceedings (Springer, Berlin, 1990) 80-95.
15. V. Lifschitz, Nonmonotonic databases and epistemic queries, in: Proceedings IJCAI-91, Sydney, Australia (Morgan Kaufmann, San Mateo, CA, 1991) 381-386.
16. J.W. Lloyd, Foundations of Logic Programming (Springer, Berlin, 2nd ext. ed., 1993).
17. W. Marek and M. Truszczyński, Stable semantics for logic programs and default theories, in: E. Lusk and R. Overbeek, eds., Proceedings North American Conference on Logic Programming (MIT Press, Cambridge, MA, 1989) 243-256.
18. J. McCarthy, Circumscription - a form of non-monotonic reasoning Artificial Intelligence 13 (1980) 27-39.
19. D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988) 27-47.
20. T. Przymusinski, On the declarative and procedural semantics of logic programs, J. Automated Reasoning 5 (1989) 167-205.
21. R. Reiter, On closed world databases, in: H. Gallaire and J. Minker, eds., Logic and Databases (Plenum Press, New York, 1978) 55-76.
22. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.
23. K.A. Ross, A procedural semantics for well founded negation in logic programs, in: Proceedings 8th Ann. ACM Symposium on Principles of Database Systems (ACM, New York, 1989) 22-34.
24. A. van Gelder, K.A. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proceedings 7th Ann. ACM Symposium on Principles of Database Systems (ACM, New York, 1988) 221-230.