|
Edinburgh Research Archive >
Informatics, School of >
Informatics Report Series >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/3394
|
| Title: | The Automation Of Proof By Mathematical Induction |
| Authors: | Bundy, Alan |
| Issue Date: | Apr-1999 |
| Series/Report no.: | Informatics Report Series
EDI-INF-RR-0002 |
| Abstract: | This paper is a chapter of the Handbook of Automated Reasoning edited by Voronkov and Robinson. It describes techniques for automated reasoning in theories containing rules of mathematical induction. Firstly, inductive reasoning is defined and its importance fore reasoning about any form of repitition is stressed. Then the special search problems that arise in inductive theories are explained followed by descriptions of the heuristic methods that have been devised to solve these problems. |
| Description: | Chapter appears in Handbook of Automated Reasoning
Edited by: Alan Robinson and Andrei Voronkov
ISBN: 978-0-444-50813-3 |
| Keywords: | Informatics |
| URI: | http://hdl.handle.net/1842/3394 |
| Appears in Collections: | Informatics Report Series
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|
