Name
Abstract | ||
|---|---|---|
In this paper we generalize Lifschitz's pointwise circumscription under the first-order framework. The generalized version has the ability for simultaneously minimizing several predicates at finitely many pinpoints in a pointwise manner. We show that if an underlying first-order theory is almost existential, then the extended pointwise circumscription is complete with respect to minimal model semantics. Almost existential formulas are in the dual form of almost universal formulas, which was proposed by Lifschitz to investigate the satisfiability of circumscription. This completeness result is a generalization of the result by Kolaitis and Papadimitriou, who regarded the case of existential formulas, We also give a partial answer to the question for exponential growth of the size of first-order formulas equivalent to circumscription. Moreover we clarify that Lifschitz's pointwise circumscription is complete in a slightly wider class of positive formulas. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/S0004-3702(96)00028-8 | Artif. Intell. |
Keywords | Field | DocType |
pointwise circumscription,computation,satisfiability,first order,approximation,circumscription,exponential growth | Equivalent transformation,Discrete mathematics,Satisfiability,Minimal model,Circumscription,Predicate (grammar),Completeness (statistics),Mathematics,Pointwise,Computation | Journal |
Volume | Issue | ISSN |
86 | 2 | 0004-3702 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Koji Iwanuma | 1 | 138 | 17.65 |
| Kazuhiko Oota | 2 | 1 | 0.36 |