Towards fixed-parameter tractable algorithms for abstract argumentation.

Wolfgang Dvorák Reinhard Pichler Stefan Woltran

Published in: Artif. Intell. (2012)

Keyphrases

fixed parameter tractable
abstract argumentation
computational problems
np hard
parameterized complexity
np complete
combinatorial optimization
learning algorithm
lower bound
data model
worst case
optimization problems
metaheuristic
theorem proving