On the complexity of extension checking in default logic

Authors:
Paolo Liberatore
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00198 Roma, Italy
Venue:
Information Processing Letters
Year:
2006

Citing 9
Cited 0

On constrained default theories

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Alternative approaches to default logic

Artificial Intelligence
A tutorial on default logics

ACM Computing Surveys (CSUR)
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Propositional default logics made easier: computational complexity of model checking

Theoretical Computer Science
A Framework for Default Logics

JELIA '92 Proceedings of the European Workshop on Logics in AI
Model Checking for Nonmonotonic Logics: Algorithms and Complexity

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The complexity of model checking for propositional default logics

Data & Knowledge Engineering
Constrained and rational default logics

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

The complexity of deciding equivalence of a formula to an extension of a default theory is investigated for the Reiter, justified, constrained, and rational semantics.