论文信息 - Computing Circumscription Revisited: Preliminary Report

Computing Circumscription Revisited: Preliminary Report

We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st order formulas The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st order formula, or terminates with failure In addition to demonstrating the algorithm by applying it to various circumscriptive theories, we analyze its strength and provide formal subsumption results based on compan son with existing approaches.

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

[2] Christos H. Papadimitriou,et al. Some computational aspects of circumscription , 1988, JACM.

[3] Andrzej Szalas. On the Correspondence between Modal and Classical Logic: An Automated Approach , 1993, J. Log. Comput..

[4] J.F.A.K. van Benthem,et al. Modal logic and classical logic , 1983 .

[5] W. Ackermann. Untersuchungen über das Eliminationsproblem der mathematischen Logik , 1935 .

[6] Arkady Rabinov. A Generalization of Collapsible Cases of Circumscription , 1989, Artif. Intell..

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

[8] Teodor C. Przymusinski. An Algorithm to Compute Circumscription , 1989, Artif. Intell..

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

[10] R. Labrecque. The Correspondence Theory , 1978 .

[11] Vladimir Lifschitz,et al. Pointwise circumscription , 1987 .