A theorem on the consistency of circumscription

DOI10.1016/0004-3702(87)90082-8zbMath0624.68082OpenAlexW2075247344MaRDI QIDQ578934

Peter L. Mott

Publication date: 1987

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(87)90082-8

zbMATH Keywords

nonmonotonic logiccircumscriptioncommonsense reasoning in predicate logicsemantic model of minimization

Mathematics Subject Classification ID

Artificial intelligence (68T99) Classical first-order logic (03B10)

Related Items (3)

Autocircumscription ⋮ The importance of open and recursive circumscription ⋮ Abstract minimality and circumscription

Cites Work

• Saturation, nonmonotonic reasoning and the closed-world assumption
• On the satisfiability of circumscription
• Completeness results for circumscription
• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning
• Unnamed Item

This page was built for publication: A theorem on the consistency of circumscription