On the complexity of model checking for propositional default logics: new results and tractable cases

Authors:
Robert Baumgartner;Georg Gottlob
Affiliations:
Institut fur Informationssysteme, Technische Universitat Wien, Vienna, Austria;Institut fur Informationssysteme, Technische Universitat Wien, Vienna, Austria
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 12
Cited 2

Bounded query classes

SIAM Journal on Computing
Relating autoepistemic and default logics

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Hard problems for simple default logics

Artificial Intelligence - Special issue on knowledge representation
Relating disjunctive logic programs to default theories

Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Translating default logic into standard autoepistemic logic

Journal of the ACM (JACM)
The complexity of default reasoning under the stationary fixed point semantics

Information and Computation
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
On Finding Extensions of Default Theories

ICDT '92 Proceedings of the 4th International Conference on Database Theory
Towards Automatic Autoepistemic Reasoning

JELIA '90 Proceedings of the European Workshop on Logics in AI
On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Complexity and Expressive Power of Logic Programming

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Living with inconsistency and taming nonmonotonicity

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Complexity of the Unique Extension Problem in Default Logic

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse the complexity of standard and weak model checking for propositional default logic; in particular, we solve the open problem of complexity in case of normal default theories and introduce a new ample class of default theories with a tractable model checking problem.