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
64
views
89
references
 Top references
cited by
23
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,600
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Handbook of Model Checking 

      Satisfiability Modulo Theories

      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 references89

          • 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 304 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
              • Article: not found

              Efficiency of a Good But Not Linear Set Union Algorithm

              Robert Tarjan (1975)
              Article 0 comments Cited 126 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2018
                Publication date (Online): May 19 2018
                Pages: 305-343
                DOI: 10.1007/978-3-319-10575-8_11
                SO-VID: 63909d26-a93e-452b-b53c-e41614adcab8
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content1,600

                See all similar

                Cited by23

                See all cited by