32 search results - page 3 / 7 » Herbrand's theorem and term induction |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
ESOP
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
ENTCS
2006
13 years 7 months ago
2006
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
CADE
2008
Springer
14 years 7 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...
TCS
2008
13 years 7 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...