## Integrating computer algebra into proof planning (1998)

### Cached

### Download Links

- [www.cs.bham.ac.uk]
- [www.ags.uni-sb.de]
- [ftp.cs.bham.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Automated Reasoning |

Citations: | 41 - 26 self |

### BibTeX

@ARTICLE{Kerber98integratingcomputer,

author = {Manfred Kerber and Michael Kohlhase and Volker Sorge},

title = {Integrating computer algebra into proof planning},

journal = {Journal of Automated Reasoning},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Mechanised reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two di erent tasks, proving and calculating. Even more importantly, proof and computation are often interwoven and not easily separable. In this contribution we advocate an integration of computer algebra into mechanised reasoning systems at the proof plan level. This approach allows to view the computer algebra algorithms as methods, that is, declarative representations of the problem solving knowledge speci c to a certain mathematical domain. Automation can be achieved in many cases bysearching for a hierarchic proof plan at the methodlevel using suitable domain-speci c control knowledge about the mathematical algorithms. In other words, the uniform framework of proof planning allows to solve a large class of problems that are not automatically solvable by separate systems. Our approach also gives an answer to the correctness problems inherent insuch an integration. We advocate an approach where the computer algebra system produces high-level protocol information that can be processed by aninterface to derive proof plans. Such a proof plan in turn can be expanded to proofs at di erent levels of abstraction, so the approach iswell-suited for producing a high-level verbalised explication as well as for a low-level machine checkable calculus-level proof. We present an implementation of our ideas and exemplify them using an automatically solved example. Changes in the criterion of `rigour of the proof ' engender major revolutions in mathematics.