118 search results - page 5 / 24 » A Simple Proof of Miller-Yu Theorem |
CADE
2003
Springer
15 years 9 months ago
2003
Springer
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
FMSD
2002
14 years 9 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
STOC
1999
ACM
15 years 1 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
101
click to vote
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...