## How Mathematicians Prove Theorems

- This paper analyzes how mathematicians prove the-orems. The analysis is based upon several empiricalsources such as reports of mathematicians and math-ematical proofs by analogy. In order to combine thestrength of traditional automated theorem provers withhuman-like capabilities, the questions arise: Whichproblem solving strategies are appropriate? Which rep-resentations have to be employed? As a result of ouranalysis, the following reasoning strategies are recog-nized: proof planning with partially instantiated meth-ods, structuring of proofs, the transfer of subproofs andof reformulated subproofs. We discuss the represent-ation of a component of these reasoning strategies, aswell as its properties. We find some mechanisms neededfor theorem proving by analogy, that are not providedby previous approaches to analogy. This leads us to acomputational representation of new components andprocedures for automated theorem proving systems.

Author: | Erica Melis |
---|---|

URN (permanent link): | urn:nbn:de:hbz:386-kluedo-2602 |

Document Type: | Article |

Language of publication: | English |

Year of Completion: | 1999 |

Year of Publication: | 1999 |

Publishing Institute: | Technische Universität Kaiserslautern |

Date of the Publication (Server): | 2000/04/03 |

Faculties / Organisational entities: | Fachbereich Informatik |

DDC-Cassification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |

Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |