Many computational problems in the area of abstract argumentation are intractable. For some semantics like preferred and semi-stable, important decision problems can even be hard for classes of the second level of the polynomial hierarchy. One approach to deal with this inherent difficulty is to exploit structure of argumentation frameworks. In particular, algorithms that run in linear time for argumentation frameworks of bounded treewidth have been proposed for several semantics. In this paper, we contribute to this line of research and propose a novel algorithm for the semi-stable semantics. We also present an implementation of the algorithm and report on some experimental results.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com