Compiling prioritized circumscription into extended logic programs

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 182-187

  Wakaki, Toshiko ^a   Satoh, Ken ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; EXTENDED LOGIC; PARALLEL CIRCUMSCRIPTION; PRIORITIZED CIRCUMSCRIPTION;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

PROGRAM INTERPRETERS;

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

References (17)

1. de Kleer, J. and Kono-. lige, K. Eliminating the Fixed Predicates from a Circumscription. Artificial Intelligence 39, pages 391-398, 1989.
2. David W. Etherington. Relating Default Logic and Circumscription. Proc. IJCAI-87, pages 489-494, 1987.
3. Gelfond, M. and Lifschitz, V. Compiling Circumscriptive Theories into Logic Programs. Proc. AAA1-88, pages 455-459.
4. Extended version in: Proc. 2nd Int. Workshop on Non-monotonic Reasoning, LNAI 346, pages 74-99, 1988.
5. Gelfond, M. and Lifschitz, V. The Stable Model Semantics for Logic Programming. Proc. LP'88, pages 1070-1080, 1988.
6. Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, pages 365-385, 1991.
7. Matthew L. Ginsberg, A Circumscriptive Theorem Prover, Artificial Intelligence 39, pages 209-230, 1989.
8. Inoue, K. Linear Resolution for Consequence Finding, Artificial Intelligence 56, pages 301-353, 1992.
9. Inoue, K. and Sakama, C. On Positive Occurrences of Negation as Failure. Proc. KR'94, pages 293-304, 1994.
10. Lifschitz, V. Computing Circumscription. Proc. IJCAI-85, pages 121-127, 1985.
11. McCarthy, J. Circumscription - a Form of Non-monotonic Reasoning. Artificial Intelligence 13, pages 27-39, 1980.
12. Przymusinski, T. On the Declarative Semantics of Deductive Databases and Logic Programs, in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann, pages 193-216, 1987.
13. Reiter, R. A Logic for default reasoning. Artificial Intelligence 13, pages 81-132, 1980.
14. Sakama, C. and Inoue, K. Embedding Circumscriptive Theories in General Disjunctive Programs. Proc. 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, 1995, LNAI 928, pages 344-357, Springer.
15. Sakama, C. and Inoue, K. Representing Priorities in Logic Programs. Proc. Joint International Conference and Symposium on Logic Programming, pages 82-96, 1996.
16. Satoh, K. and Iwayama, N. A Query Evaluation Method for Abductive Logic Programming. Proc. Joint International Conference and Symposium on Logic Programming, pages 671-685, 1992.
17. Wakaki, T and Satoh, K. Computing Prioritized Circumscription by Logic Programming. Proc. 12th International Conference on Logic Programming, pages 283-297, 1995.