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
56
views
29
references
 Top references
cited by
12
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,542
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Theory and Applications of Satisfiability Testing – SAT 2016 

      Incremental Determinization

      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 references29

          • 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

            On the power of clause-learning SAT solvers as resolution engines

            Knot Pipatsrisawat, Adnan Darwiche (2011)
            Article 0 comments Cited 21 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Blocked Clause Elimination for QBF

              Armin Biere, Florian Lonsing, Martina Seidl (2011)
              Article 0 comments Cited 20 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2016
                Publication date (Online): June 11 2016
                Pages: 375-392
                DOI: 10.1007/978-3-319-40970-2_23
                SO-VID: b27870e2-260f-4cdc-a33e-86f28fd31d15
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content1,542

                See all similar

                Cited by12

                See all cited by