On the computability of circumscription

DOI10.1016/0020-0190(88)90085-3zbMath0637.68105OpenAlexW1510401151MaRDI QIDQ1098651

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

undecidabilityfirst-order logicminimal modelsTuring machinesecond-order logicnonmonotonic reasoningcomputabilitycircumscription

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Related Items

On compact representations of propositional circumscription

Cites Work

• Circumscription - a form of non-monotonic reasoning
• The mathematics of non-monotonic reasoning
• Unnamed Item
• Unnamed Item