Completeness results for circumscription

DOI10.1016/0004-3702(86)90029-9zbMath0589.03021OpenAlexW2005984922MaRDI QIDQ1073787

Jack Minker, Donald Perlis

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0004-3702(86)90029-9

zbMATH Keywords

minimal models

Mathematics Subject Classification ID

Artificial intelligence (68T99) Second- and higher-order model theory (03C85) Categoricity and completeness of theories (03C35)

Related Items

Autocircumscription, Nonmonotonic logic and temporal projection, The importance of open and recursive circumscription, Results on translating defaults to circumscription, An extension of pointwise circumscription, Dynamic reasoning with qualified syllogisms, Circumscription within monotonic inferences, Circumscription: Completeness reviewed, A theorem on the consistency of circumscription, Decidability and definability with circumscription, Note about cardinality-based circumscription

Cites Work

• Unnamed Item
• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning
• Circumscription and implicit definability
• Computing protected circumscription
• Equality and Domain Closure in First-Order Databases
• Logic and structure.