Completeness Results for Circumscription

We inv estigate the model theory of the notion of circumscription, and find completeness theorems that provide a partial converse to a result of McCarthy. We show that the circumscriptive theorems are precisely the truths of the minimal models, in the case of various classes of theories, and for various versions of circumscription. We also present an example of commonsense reasoning in which firstorder circumscription does not achieve the intuitive and desired minimization.

[1]  Raymond Reiter,et al.  Circumscription Implies Predicate Completion (Sometimes) , 1982, AAAI.

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

[3]  Martin D. Davis,et al.  The Mathematics of Non-Monotonic Reasoning , 1980, Artif. Intell..

[4]  Jon Doyle,et al.  Circumscription and implicit definability , 1985, Journal of Automated Reasoning.

[5]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.