Publications
Preprints
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
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
Information for reviewers
Review process
How to peer review
Peer review policy
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

Register Dashboard
Search
26
views
34
references
 Top references
cited by
13
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,444
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Argumentation in Artificial Intelligence 

      Complexity of Abstract Argumentation

      other
      Author(s): ,
      Publication date (Online):
      Publisher: Springer US

      Read this book at

      Publisher
      Buy book
      Bookmark
          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)
          Article 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)
            Article 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)
              Article 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

                Book chapters

                Similar content2,444

                See all similar

                Cited by13

                See all cited by