The Complexity of Reasoning for Fragments of Default Logic

DOI10.1007/978-3-642-02777-2_7MaRDI QIDQ3637157zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 7 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02777-2_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• The complexity of reasoning for fragments of default logic
• Complexity of Default Logic on Generalized Conjunctive Queries
• scientific article; zbMATH DE number 4166939
• Hard problems for simple default logics
• scientific article; zbMATH DE number 52991

Cites work

• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Complexity of Default Logic on Generalized Conjunctive Queries
• Complexity Results for Nonmonotonic Logics
• Hard problems for simple default logics
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• On the relation between default and autoepistemic logic
• Reductions on NP and p-selective sets
• Satisfiability problems for propositional calculi
• Sequent calculi for propositional nonmonotonic logics
• The complexity of propositional implication
• Translating default logic into standard autoepistemic logic
• Yet some more complexity results for default logic

Cited in

(21)

• Hard problems for simple default logics
• Fixed-parameter tractability of disjunction-free default reasoning
• On the computational complexity of assumption-based argumentation for default reasoning.
• Propositional default logics made easier: computational complexity of model checking.
• The complexity of default reasoning under the stationary fixed point semantics
• Default reasoning using classical logic
• Complexity results for restricted credulous default reasoning
• Complexity results for 2CNF default theories
• The complexity of reasoning for fragments of default logic
• scientific article; zbMATH DE number 4166939 (Why is no real title available?)
• scientific article; zbMATH DE number 52991 (Why is no real title available?)
• scientific article; zbMATH DE number 408811 (Why is no real title available?)
• On the applicability of Post's lattice
• scientific article; zbMATH DE number 1123617 (Why is no real title available?)
• scientific article; zbMATH DE number 2032416 (Why is no real title available?)
• Parametrised complexity of satisfiability in temporal logic
• Complexity of Default Logic on Generalized Conjunctive Queries
• Proof complexity of propositional default logic
• The complexity of circumscriptive inference in Post's lattice
• On the complexity of extension checking in default logic
• The complexity of propositional implication

This page was built for publication: The Complexity of Reasoning for Fragments of Default Logic

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