Proceedings

Compiling Prioritized Circumscription into Extended Logic Programs

Download BibTeX Cite

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 182-188.

© 1997 International Joint Conferences on Artificial Intelligence

Abstract

We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated by deciding whether the literal is true in all answer sets ofii, which can be computed by running II under the existing logic programming interpreter.

  1. [de Kleer and Konolige, 1989] de Kleer, J. and Kono- lige, K. Eliminating the Fixed Predicates from a Cir- cumscription. Artificial Intelligence 39, pages 391- 398, 1989.
  2. [Etherington, 1987] David W. Etherington. Relating Default Logic and Circumscription. Proc. IJCAI-87, pages 489-494, 1987. IJCAI
  3. [Gelfond and Lifschitz, 1988a] Gelfond, M. and Lifs- chitz, V. Compiling Circumscriptive Theories into Logic Programs. Proc . AAAJ-88, pages 455-459. Ex- tended version in: Proc. 2nd Int. Worksh op on Non- monotonic Reasoning, LNAI 346, pages 74-99, 1988.
  4. [Gelfond and Lifschitz, 1988b] Gelfond, M. and Lifs- chitz, V. The Stable Model Semantics for Logic Pro- gramming. Proc . LP '88, pages 1070-1080, 1988.
  5. [Gelfond and Lifschitz, 1991] Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Dis- junctive Databases. N ew Generation Computing 9, pages 365-385, 1991.
  6. [Ginsberg, 1989] Matthew L. Ginsb erg, A Circumscrip- tive Theorem Prover, Artificial Int elligence 39, pages 209-230, 1989. .
  7. [Inoue, 1992] Inoue, K. Linear Resolution for Conse- quence Finding, Artificial Intellig en ce 56, pages 301- 353, 1992.
  8. [Inoue and Sakama, 1994] Inoue, K. and Sakama, C. On Positive Occurrences of Negation as Failure. Proc. KR '94, pages 293-304, 1994.
  9. [Lifschitz, 1985] Lifschitz, V. Computing Circumscrip- tion. Proc. IJCAI-85, pages 121-127, 1985.
  10. [McCarthy, 1980] McCarthy, J. Circumscription -a Form of Non-monotonic Reasoning. Artificial Intelli- gence 13, pages 27-39, 1980.
  11. [Przymusinski, 1987] Przymusinski, T. On the Declar- ative Semantics of Deductive Databases and Logic Programs. in Foundations of Deductive Databases and Logic Programming ( J. Minker, Ed.) , Morgan Kaufmann, pages 193-216, 1987.
  12. [Reiter, 1980] Reiter, R. A Logic for default reasoning. Artificial Intellig ence 13, pages 81-132, 1980.
  13. [Sakama and Inoue, 1995] Sakama, C. and Inoue, K. Embedding Circumscriptive Theories in General Dis- junctive Programs. Proc. 3rd International Confer- ence on Logic Programming and Nonmonotonic R ea- soning, 1995, LNAI 928, pages 344-357, Springer.
  14. [Sakama and Inoue, 1996] Sakama, C. and Inoue, K. Representing Priorities in Logic Programs. Proc. Joint International Conference and Symposium on Logic Programming, pages 82-96, 1996.
  15. [Satoh and lwayama, 1992] Satoh, K. and lwayama, N. A Query Evaluation Method for Abductive Logic Programming. Proc. Joint Int ernational Conference and Symposium on Logic Programming, pages 671- 685, 1992.
  16. [Wakaki and Satoh, 1995] Wakaki, T and Satoh, K. Computing Prioritized Circumscription by Logic Programming. Proc. 12th International Conference on Logic Programming, pages 283-297, 1995.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards