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

DOI10.1016/S0304-3975(01)00383-8zbMath1061.68068WikidataQ59259721 ScholiaQ59259721MaRDI QIDQ1853549

Georg Gottlob, Robert Baumgartner

Publication date: 21 January 2003

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

zbMATH Keywords

Computational complexityModel checkingReiter's default logicEHNF default theoriesNormal default theoriesWeak extensions

Mathematics Subject Classification ID

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

Related Items (2)

On the complexity of extension checking in default logic ⋮ Seminormalizing a default theory

Cites Work

• A logic for default reasoning
• Hard problems for simple default logics
• The complexity of default reasoning under the stationary fixed point semantics
• On the computational cost of disjunctive logic programming: Propositional case
• Bounded Query Classes
• Complexity Results for Nonmonotonic Logics
• A survey of complexity results for non-monotonic logics
• Autoepistemic logic
• Translating default logic into standard autoepistemic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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