Circumscription has been perceived as an elegant mathematical technique for modeling nonmonotonic and commonsense reasoning, but difficult to apply in practice due to the use of second-order formulas. One proposal for dealing with the computational problems is to identify classes of first-order formulas whose circumscription can be shown to be equivalent to a first-order formula. In previous work, we presented an algorithm which reduces certain classes of second-order circumscription axioms to logically equivalent first-order formulas. The basis for the algorithm is an elimination lemma due to Ackermann. In this paper, we capitalize on the use of a generalization of Ackermann's Lemma in order to deal with a subclass of universal formulas called semi-Horn formulas. Our results subsume previous results by Kolaitis and Papadimitriou regarding a characterization of circumscribed definite logic programs which are first-order expressible. The method for distinguishing which formulas are reducible is based on a boundedness criterion. The approach we use is to first reduce a circumscribed semi-Horn formula to a fixpoint formula which is reducible if the formula is bounded, otherwise not. In addition to a number of other extensions, we also present a fixpoint calculus which is shown to be sound and complete for bounded fixpoint formulas.
[1]
Andrzej Szalas.
On the Correspondence between Modal and Classical Logic: An Automated Approach
,
1993,
J. Log. Comput..
[2]
H PapadimitriouChristos,et al.
Some computational aspects of circumscription
,
1990
.
[3]
Christos H. Papadimitriou,et al.
Some computational aspects of circumscription
,
1988,
JACM.
[4]
Dexter Kozen,et al.
RESULTS ON THE PROPOSITIONAL’p-CALCULUS
,
2001
.
[5]
Teodor C. Przymusinski.
An Algorithm to Compute Circumscription
,
1989,
Artif. Intell..
[6]
Andrzej Szalas.
On Natural Deduction in First-Ortder Fixpoint Logics
,
1996,
Fundam. Informaticae.
[7]
Andrzej Sza Las.
On Correspondence Between Modal and Classical Logic: Automated Approach
,
1992
.
[8]
Michael Gelfond,et al.
Compiling Circumscriptive Theories into Logic Programs
,
1989,
NMR.
[9]
Vladimir Lifschitz,et al.
Computing Circumscription
,
1985,
IJCAI.
[10]
Dexter Kozen,et al.
Results on the Propositional µ-Calculus
,
1982,
ICALP.
[11]
W. Ackermann.
Untersuchungen über das Eliminationsproblem der mathematischen Logik
,
1935
.
[12]
Matthew L. Ginsberg.
A Circumscriptive Theorem Prover
,
1989,
Artif. Intell..
[13]
Andrzej Szalas,et al.
Axiomatizing Fixpoint Logics
,
1992,
Inf. Process. Lett..