2 search results - page 1 / 1 » Towards Fixed-Parameter Tractable Algorithms for Argumentati... |
KR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...