[Back]

G. Charwat, W. Dvorak:
"dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool";
Talk: COMMA - International Conference on Computational Models of Argument, Wien; 09-10-2012 - 09-12-2012; in: "Proceedings of Computational Models of Argument - Proceedings of COMMA 2012", B. Verheij, St. Szeider, S. Woltran (ed.); Frontiers in Artificial Intelligence and Applications / IOS Press, 245 (2012), ISBN: 978-1-61499-110-6; 507 - 508.

Most reasoning tasks in abstract argumentation are in general computationally hard. One approach of dealing with such problems stems from the field of parameterized complexity theory. For so-called fixed-parameter tractable algorithms, one identifies problem parameters, e.g. the graph parameter tree width, such that the run-time of algorithms heavily scales with the parameter but only polynomially with the input size. The dynPARTIX system turns these fixed-parameter tractability results into practice by implementing dynamic programming algorithms for the graph parameter tree width.

abstract argumentation, tree-width, fixed-parameter tractability, algorithms

http://dx.doi.org/10.3233/978-1-61499-111-3-507

Project Head Stefan Woltran:
Neue Methoden für Analyse, Vergleich und Lösung von Argumentationsproblemen