75 search results - page 12 / 15 » Certification of Automated Termination Proofs |
CADE
2008
Springer
15 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
ICLP
1999
Springer
15 years 1 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
85
Voted
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
CADE
2003
Springer
15 years 9 months ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
95
Voted
CADE
2010
Springer
14 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...