Abstract
After having observed how mathematicians work, we were convinced that, in order to prove rather difficult theorems, a program must require a lot of Knowledge. As it has already been done, and successfully, in other areas of Artificial Intelligence, items of Knowledge [Known theorems, rules, types of proofs, heuristics, examples,…) should be given to the program, as data, in a suitable language. We are writing such a program. The principles are of general value, but are applied to the following domain as a concrete support: Topological Linear Spaces and Convex Sets.
UER de Mathématiques de ⊥ Université Paris VII et GR22 du CNRS (Université Paris VI)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Pastre, D. (1980). Knowledge-Based Theorem Proving. In: Wilhelm, R. (eds) GI - 10. Jahrestagung. Informatik-Fachberichte, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-67838-7_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10388-2
Online ISBN: 978-3-642-67838-7
eBook Packages: Springer Book Archive