## Progress in Proof Planning: Planning Limit Theorems Automatically (1997)

Citations: | 2 - 1 self |

### BibTeX

@TECHREPORT{Melis97progressin,

author = {Erika Melis},

title = {Progress in Proof Planning: Planning Limit Theorems Automatically},

institution = {},

year = {1997}

}

### OpenURL

### Abstract

Proof planning is an alternative methodology to classical automated theorem proving based on exhaustive search that was first introduced by Bundy [8]. The goal of this paper is to extend the current realm of proof planning to cope with genuinely mathematical problems such as the well-known limit theorems first investigated for automated theorem proving by Bledsoe. The report presents a general methodology and contains ideas that are new for proof planning and theorem proving, most importantly ideas for search control and for the integration of domain knowledge into a general proof planning framework. We extend proof planning by employing explicit control-rules and supermethods. We combine proof planning with constraint solving. Experiments show