On the computability of circumscription

DOI10.1016/0020-0190(88)90085-3MaRDI QIDQ1098651zbMATH OpenOpenAlexFDO

Authors T. Krishnaprasad

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90085-3

zbMATH Keywords

nonmonotonic reasoningfirst-order logicTuring machineundecidabilitycomputabilitycircumscriptionsecond-order logicminimal models

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Some computational aspects of circumscription
• Decidability and definability with circumscription
• scientific article; zbMATH DE number 640290
• scientific article; zbMATH DE number 1189101
• Circumscription: Completeness reviewed

Cites work

• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3568660 (Why is no real title available?)
• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning

Cited in

(7)

• Decidability and definability with circumscription
• On compact representations of propositional circumscription
• Circumscription: Completeness reviewed
• On the satisfiability of circumscription
• Some computational aspects of circumscription
• Computing circumscription revisited: A reduction algorithm
• COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION

This page was built for publication: On the computability of circumscription

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