Sciweavers

38 search results - page 1 / 8
» A Labeling Approach to the Computation of Credulous Acceptan...
Sort
View
IJCAI
2007
13 years 9 months ago
A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
Bart Verheij
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
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è...
AI
2002
Springer
13 years 7 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon
ATAL
2005
Springer
14 years 1 months ago
Liberalizing protocols for argumentation in multi-agent systems
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...
Gerard Vreeswijk