57 search results - page 4 / 12 » A Possibilistic Inconsistency Handling in Answer Set Program... |
UAI
2004
14 years 11 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...
LPNMR
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
110
click to vote
ASP
2005
Springer
15 years 3 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...
105
Voted
AGP
2003
IEEE
15 years 2 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
80
Voted
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....