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
166
views
13
references
 Top references
cited by
17
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,070
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      SAT Solving for Termination Analysis with Polynomial Interpretations

      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 references13

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          On the Complexity of Derivation in Propositional Calculus

          G. S. Tseitin (1970)
          Article 0 comments Cited 57 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

            Jürgen Giesl, Peter Schneider-Kamp, René Thiemann (2006)
            Article 0 comments Cited 44 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

              Jürgen Giesl, René Thiemann, Peter Schneider-Kamp (2005)
              Article 0 comments Cited 33 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Pages: 340-354
                DOI: 10.1007/978-3-540-72788-0_33
                SO-VID: ee5ed648-c1c8-405c-806c-c28c18baf3b3
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content4,070

                See all similar

                Cited by17

                See all cited by