scientific article; zbMATH DE number 6131588

MaRDI QIDQ4904137zbMATH OpenFDO

Authors

Publication date 28 January 2013

Full work available at URL https://arxiv.org/abs/1009.1990

zbMATH Keywords

abductionautoepistemic logiccircumscriptiondefault logicPost latticesatisfiability

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• Complexity Results for Nonmonotonic Logics
• On the parameterized complexity of non-monotonic logics
• A survey of complexity results for non-monotonic logics
• scientific article; zbMATH DE number 517061
• Proof Complexity of Non-classical Logics
• Proof complexity of non-classical logics
• Publication:5749280
• Proof-complexity results for nonmonotonic reasoning
• Nonmonotonic reasoning: From complexity to algorithms

Cited in

(8)

• A logic of non-monotonic interactions
• A recipe for the complexity analysis of non-classical logics
• scientific article; zbMATH DE number 3903964 (Why is no real title available?)
• Complexity Results for Nonmonotonic Logics
• A survey of complexity results for non-monotonic logics
• On the parameterized complexity of non-monotonic logics
• Default logic and bounded treewidth
• Trichotomies in the complexity of minimal inference

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 Q4904137)