Sciweavers

31 search results - page 7 / 7
» On Parameterized Intractability: Hardness and Completeness
Sort
View
AI
2007
Springer
13 years 5 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne