Propositional default logics made easier: computational complexity of model checking.

DOI10.1016/S0304-3975(01)00383-8MaRDI QIDQ1853549zbMATH OpenWikidataFDO

Authors Robert Baumgartner, Georg Gottlob

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computational complexityModel checkingEHNF default theoriesNormal default theoriesReiter's default logicWeak extensions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 408811
• scientific article; zbMATH DE number 4106303
• The Complexity of Reasoning for Fragments of Default Logic
• On the computational cost of disjunctive logic programming: Propositional case
• Default reasoning using classical logic

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 140397 (Why is no real title available?)
• scientific article; zbMATH DE number 1301756 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 549992 (Why is no real title available?)
• A logic for default reasoning
• A survey of complexity results for non-monotonic logics
• Autoepistemic logic
• Bounded Query Classes
• Complexity Results for Nonmonotonic Logics
• Hard problems for simple default logics
• On the computational cost of disjunctive logic programming: Propositional case
• The complexity of default reasoning under the stationary fixed point semantics
• Translating default logic into standard autoepistemic logic

Cited in

(5)

• Strong backdoors for default logic
• On the complexity of extension checking in default logic
• The complexity of default reasoning under the stationary fixed point semantics
• Strong backdoors for default logic
• Seminormalizing a default theory

This page was built for publication: Propositional default logics made easier: computational complexity of model checking.

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