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
38
views
15
references
 Top references
cited by
17
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,911
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Computer Aided Verification 

      Theorem Proving Using Lazy Proof Explication

      other

      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 references15

          • 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

            Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

            Robert Tarjan, Mihalis Yannakakis (1984)
            Article 0 comments Cited 127 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              GRASP: a search algorithm for propositional satisfiability

              J.P. Marques-Silva, K.A. Sakallah (1999)
              Article 0 comments Cited 125 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2003
                Pages: 355-367
                DOI: 10.1007/978-3-540-45069-6_34
                SO-VID: e1e20357-fe0f-4c41-bf3f-ca8d1caae92b
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,911

                See all similar

                Cited by17

                See all cited by