- Record: found
- Abstract: not found
- Book Chapter: not found
Argumentation in Artificial Intelligence
Complexity of Abstract Argumentation
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references34
- Record: found
- Abstract: not found
- Conference Proceedings: not found
The complexity of theorem-proving procedures
Stephen Cook (1971)
- Record: found
- Abstract: not found
- Article: not found
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Bruno Courcelle (1990)
- Record: found
- Abstract: not found
- Article: not found
A partial k-arboretum of graphs with bounded treewidth
Hans L. Bodlaender (1998)