scientific article; zbMATH DE number 1123617

MaRDI QIDQ4379673zbMATH OpenFDO

Authors Wiktor Marek, Jeffrey Remmel, Anil Nerode

Publication date 14 March 2000

zbMATH Keywords

complexityextensions of normal default theoriesnonmonotonic reasoning

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Recursively (computably) enumerable sets and degrees (03D25) Logic in artificial intelligence (68T27)

Recommendations

• Proof complexity of propositional default logic
• Proof complexity of propositional default logic
• scientific article; zbMATH DE number 1249652
• scientific article; zbMATH DE number 4199606
• scientific article; zbMATH DE number 1876863
• On the complexity of extension checking in default logic
• The complexity of reasoning for fragments of default logic
• The Complexity of Reasoning for Fragments of Default Logic
• scientific article; zbMATH DE number 994428
• The complexity of predicate default logic over a countable domain

Cited in

(5)

• My work with Victor Marek: a mathematician looks at answer set programming
• Consistency properties and set based logic programming
• Yet some more complexity results for default logic
• The complexity of predicate default logic over a countable domain
• scientific article; zbMATH DE number 408811 (Why is no real title available?)

This page was built for publication:

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