Sciweavers

1187 search results - page 3 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
COMMA
2010
13 years 2 months ago
A characterization of collective conflict for defeasible argumentation
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...
Teresa Alsinet, Ramón Béjar, Lluis G...
COMMA
2010
13 years 2 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
COMMA
2006
13 years 8 months ago
A dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
Phan Minh Dung, Paolo Mancarella, Francesca Toni
AI
2002
Springer
13 years 7 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
14 years 1 months ago
Extending Argumentation to Make Good Decisions
Abstract. Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud