167 search results - page 17 / 34 » Possibilistic-Based Argumentation: An Answer Set Programming... |
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
HIS
2009
13 years 5 months ago
2009
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
FUIN
2010
13 years 5 months ago
2010
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...