Propositional default logics made easier: computational complexity of model checking.
type: Item
instance of: scholarly article
title: Propositional default logics made easier: computational complexity of model checking.
zbMATH Open document ID: 1061.68068
DOI: 10.1016/S0304-3975(01)00383-8
author: Robert Baumgartner
author: Georg Gottlob
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 1857081
zbMATH Keywords: Reiter's default logic
zbMATH Keywords: Normal default theories
zbMATH Keywords: Computational complexity
zbMATH Keywords: Model checking
zbMATH Keywords: EHNF default theories
zbMATH Keywords: Weak extensions
MaRDI profile type: Publication
Wikidata QID: Q59259721
cites work: A survey of complexity results for non-monotonic logics
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Complexity Results for Nonmonotonic Logics
cites work: The complexity of default reasoning under the stationary fixed point semantics
cites work: Translating default logic into standard autoepistemic logic
cites work: Q4028804
cites work: Q4246971
cites work: Hard problems for simple default logics
cites work: Autoepistemic logic
cites work: Q4273952
cites work: Q4287511
cites work: Q3221403
cites work: A logic for default reasoning
cites work: Bounded Query Classes
description: scientific article; zbMATH DE number 1857081