Talks and Poster Presentations (without Proceedings-Entry):
W. Dvorak:
"Argumentation with Bounded Tree-Width";
Poster: Advanced Course in Artificial Intelligence '09,
Belfast, GB;
2009-08-23
- 2009-08-29.
English abstract:
Many problems on abstract argumentation frameworks are computationally
intractable. Therefore, in practical applications, one requires
sufficient conditions under which argumentation becomes efficiently
solvable.
It has been shown that the notion of tree-width makes many argumentation problems tractable. But as these results are based on Courcelle's Theorem there is no straightforward translation into algorithms for these problems. In this work, we present algorithms based on dynamic programming for counting, and respectively, enumerating different extensions in argumentation frameworks.
Related Projects:
Project Head Stefan Woltran:
Neue Methoden für Analyse, Vergleich und Lösung von Argumentationsproblemen
Created from the Publication Database of the Vienna University of Technology.