Literature Survey

  • Simon Colton
Part of the Distinguished Dissertations book series (DISTDISS)


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].


Logic Program Theory Formation Concept Formation Theorem Prove Inductive Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Simon Colton
    • 1
  1. 1.University of EdinburghEdinburghUK

Personalised recommendations