On the satisfiability of circumscription

摘要

Etherington, Mercer and Reiter showed, on the basis of ideas of Bossu and Siegel, that circumscription cannot lead to inconsistency for universal formulas. We extend this result in three directions: to formulas of a more general syntactic form, to circumscription with some predicate symbols allowed to vary, and to prioritized circumscription.