This paper presents a new kind of abstraction, which has been developed for the purpose of proofplanning. The basic idea of this paper is to abstract a given theorem and to find an abstractproof of it. Once an abstract proof has been found, this proof has to be refined to a real proofof the original theorem. We present a goal oriented abstraction for the purpose of equality proofplanning, which is parameterized by common parts of the left- and right-hand sides of the givenequality. Therefore, this abstraction technique provides an abstract equality problem which ismore adequate than those generated by the abstractions known so far. The presented abstractionalso supports the heuristic search process based on the difference reduction paradigm. We give aformal definition of the abstract space including the objects and their manipulation. Furthermore,we prove some properties in order to allow an efficient implementation of the presented abstraction.
[1]
Dieter Hutter,et al.
INKA: The Next Generation
,
1996,
CADE.
[2]
David A. Plaisted,et al.
Theorem Proving with Abstraction
,
1981,
Artif. Intell..
[3]
Michael J. C. Gordon,et al.
Edinburgh LCF: A mechanised logic of computation
,
1979
.
[4]
Alan Bundy,et al.
The Use of Explicit Plans to Guide Inductive Proofs
,
1988,
CADE.
[5]
Frank van Harmelen,et al.
Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs
,
1990,
CADE.
[6]
G. Huet,et al.
Equations and rewrite rules: a survey
,
1980
.
[7]
Dieter Hutter,et al.
The Karlsruhe Induction Theorem Proving System
,
1986,
CADE.
[8]
Fausto Giunchiglia,et al.
A Theory of Abstraction
,
1992,
Artif. Intell..