Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
27
views
34
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,196
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Argumentation in Artificial Intelligence
Complexity of Abstract Argumentation
other
Author(s):
Paul E. Dunne
,
Michael Wooldridge
Publication date
(Online):
May 10 2009
Publisher:
Springer US
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
Point-Of-Care Testing for AMR
Most cited references
34
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The complexity of theorem-proving procedures
Stephen Cook
(1971)
0
comments
Cited
408
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Bruno Courcelle
(1990)
0
comments
Cited
224
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A partial k-arboretum of graphs with bounded treewidth
Hans L. Bodlaender
(1998)
0
comments
Cited
149
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Publication date (Online):
May 10 2009
Pages
: 85-104
DOI:
10.1007/978-0-387-98197-0_5
SO-VID:
cd95dc13-2e4f-4be0-99ae-7c7810891fcb
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 25
Semantics of Abstract Argument Systems
pp. 85
Complexity of Abstract Argumentation
pp. 105
Proof Theories and Algorithms for Abstract Argumentation Frameworks
pp. 199
Assumption-Based Argumentation
pp. 239
Proof Burdens and Standards
Similar content
2,196
Motor imagery training to improve language processing: What are the arguments?
Authors:
Mariam Bayram
,
Richard Palluel-Germain
,
Florent Lebon
…
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
Authors:
Yasir Mahmood
,
Arne Meier
,
Johannes Schmidt
An improved upper bound for the argument of the Riemann zeta-function on the critical line II
Authors:
Timothy Trudgian
See all similar
Cited by
13
An introduction to argumentation semantics
Authors:
Pietro Baroni
,
Martin Caminada
,
Massimiliano Giacomin
Probabilistic Argumentation Frameworks
Authors:
Hengfei Li
,
Nir Oren
,
Timothy J. Norman
On the Complexity of Probabilistic Abstract Argumentation Frameworks
Authors:
Bettina Fazzinga
,
Sergio Flesca
,
Francesco Parisi
See all cited by