11 search results - page 1 / 3 » A Level-based Approach to Computing Warranted Arguments in P... |
COMMA
2008
13 years 9 months ago
2008
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
COMMA
2010
13 years 2 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
CCIA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
IBERAMIA
2010
Springer
13 years 5 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
ECSQARU
2005
Springer
14 years 1 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...