A theorem on the consistency of circumscription

DOI10.1016/0004-3702(87)90082-8zbMATH Open0624.68082OpenAlexW2075247344MaRDI QIDQ578934FDOQ578934

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4106292
• scientific article; zbMATH DE number 640290
• scientific article; zbMATH DE number 4026858
• Circumscription: Completeness reviewed
• Some computational aspects of circumscription

zbMATH Keywords

circumscriptionnonmonotonic logiccommonsense reasoning in predicate logicsemantic model of minimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning
• On the satisfiability of circumscription
• Completeness results for circumscription

Cited In (15)

• FDE circumscription
• Circumscription: Completeness reviewed
• Title not available (Why is that?)
• Title not available (Why is that?)
• A generalization of collapsible cases of circumscription
• The importance of open and recursive circumscription
• Autocircumscription
• An institution-independent proof of the Robinson consistency theorem
• On the satisfiability of circumscription
• An extension of pointwise circumscription
• Circumscription and implicit definability
• Title not available (Why is that?)
• Abstract minimality and circumscription
• A consistency proof for some restrictions of Tait's reflection principles
• On the consistency of consistent conjectures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578934)