Search Results for author:
Found 5 papers, 0 papers with code
Solving Advanced Argumentation Problems with Answer Set Programming
Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments, and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labelled graphs.
Design and Results of the Second International Competition on Computational Models of Argumentation
Argumentation is a major topic in the study of Artificial Intelligence.
Characterizing Realizability in Abstract Argumentation
Realizability for knowledge representation formalisms studies the following question: given a semantics and a set of interpretations, is there a knowledge base whose semantics coincides exactly with the given interpretation set?
Verifiability of Argumentation Semantics
Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations.
Compact Argumentation Frameworks
(3) Finally, we show that compact AFs are indeed a non-trivial subclass, since the verification problem remains coNP-hard for certain semantics.
