Abstract
Computer programs which perform specific mathematical tasks have flourished since the beginning of computer science. These tasks include:
-
Symbolic manipulations, which can be achieved by computer algebra systems such as Maple [Abell & Braselton 94], Mathematica [Wolfram 99] and Gap [Gap 00].
-
Example construction, e.g. building Cayley tables, which can be achieved by model generators like MACE [McCune 94], Finder [Slaney 92] and Kimba [Konrad & Wolfram 99].
-
Inventing concepts, which can be achieved by machine learning programs such as Progol [Muggleton 95], RIPPER [Cohen 95] and C4.5 [Quinlan 93].
-
Making conjectures, which can be achieved with specialised techniques such as those employed by Graffiti [Fajtlowicz 88], the PSLQ algorithm [Bailey 98] and the AGX program [Caporossi & Hansen 99].
-
Proving theorems, which can be achieved by a plethora of automated theorem provers, including: Otter [McCune 90], A-Clam [Richardson et al. 98], Spass [Weidenbach 99] and Vampire [Voronkov 95].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Colton, S. (2002). Literature Survey. In: Automated Theory Formation in Pure Mathematics. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-1-4471-0147-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0147-5_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1113-9
Online ISBN: 978-1-4471-0147-5
eBook Packages: Springer Book Archive