150 search results - page 3 / 30 » Complexity of the Unique Extension Problem in Default Logic |
114
click to vote
LPNMR
1995
Springer
15 years 1 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
AI
2002
Springer
14 years 9 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...
AI
2000
Springer
14 years 9 months ago
2000
Springer
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from th...
73
Voted
NMR
2004
Springer
15 years 2 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
KR
1992
Springer
15 years 1 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...