Now showing items 1-3 of 3
Coloured rippling: An extension of a theorem proving heuristic
(John Wiley & Sons, 1994)
Rippling is a type of rewriting developed in inductive theorem proving for removing differences between terms; the induction conclusion is annotated to mark its differences from the induction hypothesis and rippling ...
Automatic Concept Formation in Pure Mathematics
The HR program forms concepts and makes conjectures in domains of pure mathematics and uses theorem prover OTTER and model generator MACE to prove or disprove the conjectures. HR measures properties of concepts and assesses ...
Theory of abstraction
(The University of Edinburgh, 1990)