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
16
views
18
references
 Top references
cited by
8
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,856
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Principles and Practice of Constraint Programming - CP 2005 

      Using SAT in QBF

      other
      Author(s): ,
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      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 references18

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

          A machine program for theorem-proving

          Martin Davis, George Logemann, Donald Loveland (1962)
          Article 0 comments Cited 305 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A Computing Procedure for Quantification Theory

            Martin Davis, Hilary Putnam (1960)
            Article 0 comments Cited 222 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Word problems requiring exponential time(Preliminary Report)

              L. J. Stockmeyer, A. R. Meyer (1973)
              Article 0 comments Cited 85 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2005
                Pages: 578-592
                DOI: 10.1007/11564751_43
                SO-VID: 81e12212-d1a1-41b1-aa77-a26f59f67e7c
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content1,856

                See all similar

                Cited by8

                See all cited by