Automated Reasoning
From MaRDI portal
Publication:5307050
DOI10.1007/b98691zbMath1126.68582OpenAlexW4239036627MaRDI QIDQ5307050
Peter Schneider-Kamp, Jürgen Giesl, René Thiemann
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98691
Related Items (10)
On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Tyrolean termination tool: techniques and features ⋮ Elimination transformations for associative-commutative rewriting systems ⋮ Mechanizing and improving dependency pairs ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Automating the dependency pair method ⋮ On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting ⋮ The size-change principle and dependency pairs for termination of term rewriting
Uses Software
This page was built for publication: Automated Reasoning
