The complexity of predicate default logic over a countable domain

DOI10.1016/S0168-0072(02)00064-7MaRDI QIDQ1861328zbMATH OpenFDO

Authors Robert Saxon Milnikel

Publication date 16 March 2003

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

circumscriptiondefault logiccomputability theoretic complexity

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 1123617
• scientific article; zbMATH DE number 1876863
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• scientific article; zbMATH DE number 52991
• Extensions for open default theories via the domain closure assumption

Cites work

• scientific article; zbMATH DE number 4158607 (Why is no real title available?)
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 4185010 (Why is no real title available?)
• A comparative study of open default theories
• A logic for default reasoning
• A logic of knowledge and justified assumption
• A theory of nonmonotonic rule systems I
• A theory of nonmonotonic rule systems. II
• Circumscription - a form of non-monotonic reasoning
• Closed-world databases and circumscription
• Decidability and definability with circumscription
• Extensions for open default theories via the domain closure assumption
• Non-monotonic logic. I

Cited in

(3)

• scientific article; zbMATH DE number 1123617 (Why is no real title available?)
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi

This page was built for publication: The complexity of predicate default logic over a countable domain

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