Circumscription: Completeness reviewed

DOI10.1016/0004-3702(93)90005-VzbMATH Open0781.68100OpenAlexW1586773105MaRDI QIDQ685339FDOQ685339

Authors: Manfred Jaeger 

Publication date: 17 October 1993

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

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90005-v

Recommendations

• Decidability and definability with circumscription
• Abstract minimality and circumscription
• scientific article; zbMATH DE number 67498
• A theorem on the consistency of circumscription
• On the computability of circumscription

zbMATH Keywords

reducibilityminimalitycircumscription

Mathematics Subject Classification ID

Nonclassical models (Boolean-valued, sheaf, etc.) (03C90)

Cites Work

• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning
• On the satisfiability of circumscription
• Completeness results for circumscription
• Title not available (Why is that?)
• A generalization of collapsible cases of circumscription

Cited In (9)

• Model enumeration in propositional circumscription via unsatisfiable core analysis
• A note on the least informative model of a theory
• The importance of open and recursive circumscription
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computability of circumscription
• An extension of pointwise circumscription
• Abstract minimality and circumscription
• 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)