• Publications
  • Influence
Abstract Dialectical Frameworks
TLDR
In this paper we introduce dialectical frameworks, a powerful generalization of Dung-style argumentation frameworks where each node comes with an associated acceptance condition. Expand
  • 234
  • 45
  • PDF
Abstract Dialectical Frameworks Revisited
TLDR
We present various new concepts and results related to abstract dialectical frameworks (ADFs), a powerful generalization of Dung's argumentation frameworks (AFs) for handling conflicts among (abstract) arguments. Expand
  • 159
  • 29
  • PDF
Characteristics of multiple viewpoints in abstract argumentation
TLDR
The study of extension-based semantics within the seminal abstract argumentation model of Dung has largely focused on definitional, algorithmic and complexity issues. Expand
  • 81
  • 10
  • PDF
Characterizing Strong Equivalence for Argumentation Frameworks
TLDR
We study strong equivalence between argumentation frameworks under the assumption that the frameworks in question are incomplete, i.e. further information might be added later to both frameworks simultaneously. Expand
  • 97
  • 9
  • PDF
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
TLDR
The system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. Expand
  • 98
  • 9
  • PDF
Answer-set programming encodings for argumentation frameworks
TLDR
We provide ASP-encodings for computing different forms of extensions in Dung’sAF as well as in some recent extensions of it. Expand
  • 112
  • 8
  • PDF
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
TLDR
We present a method to implement equilibrium logic and, as a special case, stable models for logic programs with nested expressions, based on polynomial reductions to quantified Boolean formulas (QBFs). Expand
  • 84
  • 8
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems
TLDR
We experimentally compare the original encodings (for the argumentation semantics based on preferred, semi-stable, and respectively, stage extensions) with new metasp encodes for the recently introduced resolution-based grounded semantics. Expand
  • 47
  • 8
  • PDF
Simplifying Logic Programs Under Uniform and Strong Equivalence
TLDR
We consider the simplification of logic programs under the stable model semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Expand
  • 96
  • 7
  • PDF
Complexity of semi-stable and stage semantics in argumentation frameworks
TLDR
In this work, we answer two questions about the complexity of semi-stable semantics for abstract argumentation frameworks: we show @P"2^P-completeness for the problem of deciding whether an argument is skeptically accepted. Expand
  • 82
  • 7
  • PDF
...
1
2
3
4
5
...