74 search results - page 1 / 15 » On the Parameterized Complexity of Default Logic and Autoepi... |
LATA
2012
Springer
12 years 1 days ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
ECAI
1992
Springer
13 years 8 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
AI
2002
Springer
13 years 4 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
LPKR
1997
Springer
13 years 8 months ago
1997
Springer
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...