Download:
|
by Arthur C. Sehn, Manfred Kerber, Manfred Kerber, Arthur Christian Sehn
ftp://ftp.cs.bham.ac.uk/pub/authors/M.Kerber/97-FLAIRS.ps.gz
Add To MetaCart
Abstract:
A lot of the human ability to prove hard mathematical theorems can be ascribed to a domain-specific problem solving know-how. Such knowledge is intrinsically incomplete. In order to solve related problems, human mathematicians can go beyond their acquired knowledge by adapting their know-how. These two aspects, having rich experience and extending it by need, can be simulated in a proof planning framework. The domain-specific reasoning knowledge is represented in form of declarative planning operators, called methods. Since these are declarative, they can be mechanically adapted to new situations by socalled meta-methods. In this contribution we apply this framework to two prominent proofs in theorem proving. First, we present methods for proving the ground completeness of binary resolution, which essentially correspond to key lemmata, and then, we show how these methods can be reused for the proof of the ground completeness of lock resolution.
Citations
|
253
|
The use of explicit plans to guide inductive proofs
– Bundy
- 1988
|
|
204
|
Automated Theorem Proving: A Logical Basis
– Loveland
- 1978
|
|
129
|
On the evaluation of R systems
– ROBERTSON, HANCOCK-BEAULIEU
- 1992
|
|
96
|
Edinburgh LCF, a mechanical logic of computation
– Gordon, Milner, et al.
- 1977
|
|
41
|
Transforming matings into natural deduction proofs
– Andrews
- 1980
|
|
27
|
Locking: A Restriction of Resolution
– Boyer
- 1971
|
|
19
|
Planning mathematical proofs with methods
– Huang, Kerber, et al.
- 1994
|
|
11
|
Adapting methods to novel tasks in proof planning
– Huang, Kerber, et al.
- 1994
|
|
9
|
A precondition prover for analogy
– Bledsoe
- 1995
|
|
7
|
Adaptation of declaratively represented methods in proof planning
– Huang, Kerber, et al.
- 1995
|
|
7
|
DECLAME -- eine deklarative Sprache zur Reprasentation von Methoden
– Sehn
- 1995
|
|
5
|
Proving ground completeness of resolution by proof planning
– Kerber, Sehn
- 1997
|
|
3
|
A Linear Proof Format for Resolution with Merging and a New Technique for Establishing Completeness
– Anderson, Bledsoe
- 1970
|
|
1
|
Siekmann.\Omega -MKRP: A proof development environment
– Huang, Kerber, et al.
- 1994
|
