Login / Signup
Tractable Abstract Argumentation via Backdoor-Treewidth.
Wolfgang Dvorák
Markus Hecher
Matthias König
André Schidler
Stefan Szeider
Stefan Woltran
Published in:
AAAI (2022)
Keyphrases
</>
fixed parameter tractable
bounded treewidth
abstract argumentation
np complete
decision problems
boolean functions
conjunctive queries
relational learning
tractable classes
theorem proving
space complexity
reinforcement learning
computational complexity
np hard
probabilistic model
upper bound