58 search results - page 3 / 12 » Possibilistic uncertainty handling for answer set programmin... |
UAI
2004
13 years 7 months ago
2004
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. ...
FUZZIEEE
2007
IEEE
14 years 3 days ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
ASP
2005
Springer
13 years 11 months ago
2005
Springer
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
UAI
2004
13 years 7 months ago
2004
Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various stren...
WILF
2009
Springer
14 years 11 days ago
2009
Springer
A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...