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
23
views
27
references
 Top references
cited by
3
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,144
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Graph-Theoretic Concepts in Computer Science : 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998. Proceedings 

      QBF as an Alternative to Courcelle’s Theorem

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

      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 references27

          • Record: found
          • Abstract: not found
          • Article: not found

          A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

          Hans L. Bodlaender (1996)
          Article 0 comments Cited 248 times – based on 0 reviews     Review now
            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

              On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

              Phan Dung (1995)
              Article 0 comments Cited 88 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2018
                Publication date (Online): June 26 2018
                Pages: 235-252
                DOI: 10.1007/978-3-319-94144-8_15
                SO-VID: 6e81335c-3af6-4832-97cc-623dda278a6f
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,144

                See all similar

                Cited by3

                See all cited by