Circumscription: Completeness reviewed
From MaRDI portal
The author gives a counterexample to the minimality result of \textit{D. Perlis} and \textit{J. Minker} [Completeness results for circumscription, Artif. Intell. 28, 29-42 (1986; Zbl 0589.03021)] but shows that the result still holds if it is restricted to well-founded theories in the sense that every nonminimal model contains a minimal model and if the notion of circumscription is strengthened. He also investigates the relationship between minimality and reducibility of model theories in circumscription.
Recommendations
Cites work
- A generalization of collapsible cases of circumscription
- Circumscription - a form of non-monotonic reasoning
- Completeness results for circumscription
- scientific article; zbMATH DE number 194964 (Why is no real title available?)
- On the satisfiability of circumscription
- The mathematics of non-monotonic reasoning
Cited in
(11)- On the computability of circumscription
- The importance of open and recursive circumscription
- Abstract minimality and circumscription
- Value minimization in circumscription
- An extension of pointwise circumscription
- A note on the least informative model of a theory
- scientific article; zbMATH DE number 67498 (Why is no real title available?)
- scientific article; zbMATH DE number 1023024 (Why is no real title available?)
- scientific article; zbMATH DE number 2084387 (Why is no real title available?)
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- A theorem on the consistency of circumscription
This page was built for publication: Circumscription: Completeness reviewed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685339)