Sciweavers

1094 search results - page 11 / 219
» On Computing Explanations in Argumentation
Sort
View
COMMA
2010
14 years 10 months ago
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
Ringo Baumann, Gerhard Brewka
136
Voted
DSL
2009
15 years 1 months ago
A DSL for Explaining Probabilistic Reasoning
We propose a new focus in language design where languages provide constructs that not only describe the computation of results, but also produce explanations of how and why those r...
Martin Erwig, Eric Walkingshaw
132
Voted
AI
2007
Springer
15 years 3 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
152
Voted
CCIA
2010
Springer
14 years 10 months ago
WizArg: Visual Argumentation Framework Solving Wizard
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
Ignasi Gómez-Sebastià, Juan Carlos N...
95
Voted
KBS
2006
59views more  KBS 2006»
15 years 3 months ago
Representing dialogic argumentation
Dialogic argumentation is a crucial component in many computational domains, and forms a core component of argumentation theory. This paper compares two approaches to dialogue tha...
Chris Reed