Compiling Prioritized Circumscription into Extended Logic Programs

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 of II, which can be computed by running II under the existing logic programming interpreter.

[1]  Matthew L. Ginsberg.  A Circumscriptive Theorem Prover , 1989, Artif. Intell..

[2]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[3]  Michael Gelfond,et al.  Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.

[4]  Chiaki Sakama,et al.  Embedding Circumscriptive Theories in General Disjunctive Programs , 1995, LPNMR.

[5]  Ken Satoh,et al.  A Query Evaluation Method for Abductive Logic Programming , 1992, Joint International Conference and Symposium on Logic Programming.

[6]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[7]  Kurt Konolige,et al.  Eliminating the Fixed Predicates from a Circumscription , 1989, Artif. Intell..

[8]  Chiaki Sakama,et al.  On Positive Occurrences of Negation as Failure , 1994, KR.

[9]  Chiaki Sakama,et al.  Representing Priorities in Logic Programs , 1996, JICSLP.

[10]  Katsumi Inoue,et al.  Linear Resolution for Consequence Finding , 1992, Artif. Intell..

[11]  David W. Etherington.  Relating Default Logic and Circumscription , 1987, IJCAI.

[12]  Toshiko Wakaki,et al.  Computing Prioritized Circumscription by Logic Programming , 1995, ICLP.

[13]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[14]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.