5 search results - page 1 / 1 » On the Compilation of Possibilistic Default Theories |
FLAIRS
2008
13 years 6 months ago
2008
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
IJCAI
1997
13 years 5 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
KR
2004
Springer
13 years 10 months ago
2004
Springer
This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specifici...
AMAI
2006
Springer
13 years 4 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
LPNMR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...