Compiling circumscriptive theories into logic programs: preliminary report

We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions.

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

[2]  Pierre Siegel,et al.  Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..

[3]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[4]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

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

[6]  Teodor C. Przymusinski.  Query Answering in Circumscriptive and Closed-World Theories , 1986, AAAI.

[7]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[8]  Bernard Meltzer.  Theorem-Proving for Computers: Some Results on Resolution and Renaming , 1966, Comput. J..

[9]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[10]  Matthew L. Ginsberg,et al.  A circumscriptive theorem prover: preliminary report , 1988, AAAI 1988.

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

[12]  Michael Gelfond,et al.  Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

[13]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[14]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.