Sciweavers

27 search results - page 1 / 6
» Computing Preferred Extensions for Argumentation Systems wit...
Sort
View
COMMA
2006
13 years 6 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons
COMMA
2010
12 years 12 months ago
Reasoning about Preferences in Structured Extended Argumentation Frameworks
Abstract. This paper combines two recent extensions of Dung's abstract argumenrameworks in order to define an abstract formalism for reasoning about preferences in structured ...
Sanjay Modgil, Henry Prakken
AI
2007
Springer
13 years 5 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
2008
13 years 6 months ago
Semantics for Evidence-Based Argumentation
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...
Nir Oren, Timothy J. Norman
COMMA
2010
12 years 12 months ago
Generalizing stable semantics by preferences
Different proposals have been made in the literature for refining Dung's argumentation framework by preferences between arguments. The idea is to ignore an attack if the atta...
Leila Amgoud, Srdjan Vesic