167 search results - page 16 / 34 » Possibilistic-Based Argumentation: An Answer Set Programming... |
KR
2004
Springer
14 years 1 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...