Automated conjecture making in number theory using HR, Otter and Maple

Journal of Symbolic Computation

Volumn 39, Issue 5 SPEC. ISS., 2005, Pages 593-615

  Colton, Simon ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Automated mathematical discovery; Automated reasoning; Computer algebra systems; Integration of reasoning systems; Machine learning

Indexed keywords

EID: 17044362622     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.12.003     Document Type: Article

References (27)

1. B. Buchberger Theory exploration versus theorem proving Proceedings of Calculemus 99, Systems for Integrated Computation and Deduction 1998
2. Chou, S., 1985. Proving and discovering geometry theorems using Wu's method. Technical Report 49. Computing Science, University of Austin at Texas
3. S. Colton Refactorable numbers - a machine invention Journal of Integer Sequences 2 1999
4. Colton, S., 2002a. Automated theory formation applied to mutagenesis data. In: Proceedings of the 1st British-Cuban Workshop on BioInformatics
5. S. Colton Automated Theory Formation in Pure Mathematics 2002 Springer-Verlag
6. Colton, S., Bundy, A., Walsh, T., 2000a. Automatic identification of mathematical concepts. In: Machine Learning: Proceedings of the 17th International Conference
7. Colton, S., Bundy, A., Walsh, T., 2000b. Automatic invention of integer sequences. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence
8. S. Colton A. Bundy T. Walsh On the notion of interestingness in automated mathematical discovery International Journal of Human Computer Studies 53 3 2000 351-375
9. S. Colton S. Huczynska The Homer system Proceedings of the 19th International Conference on Automated Deduction LNAI vol. 2741 2003 289-294
10. Colton, S., Miguel, I., 2001. Constraint generation via automated theory formation. In: Proceedings of CP-01
11. L. De Raedt L. Dehaspe Clausal discovery Machine Learning 26 1997 99-146
12. L. Dehaspe H. Toivonen Discovery of frequent datalog patterns Data Mining and Knowledge Discovery 3 1 1999 7-36
13. S. Fajtlowicz On conjectures of Graffiti Discrete Mathematics 72 23 1988 113-118
14. Franke, A., Kohlhase, M., 1999. System description: MathWeb, an agent-based communication layer for distributed automated theorem proving. In: Proceedings of CADE-16. pp. 217-221
15. Gap, 2000. GAP Reference Manual. The GAP Group, School of Mathematical and Computational Sciences, University of St. Andrews
16. G. Hardy E. Wright The Theory of Numbers 1938 Oxford University Press
17. R. Kennedy C. Cooper Tau numbers, natural density and Hardy and Wright's theorem 437 International Journal of Mathematics and Mathematical Sciences 13 1990 383-386
18. D. Lenat AM: Discovery in mathematics as heuristic search In: D. Lenat R. Davis (Eds.). Knowledge-Based Systems in Artificial Intelligence McGraw-Hill Advanced Computer Science Series 1982
19. R. McCasland M. Moore P. Smith An introduction to Zariski spaces over Zariski topologies Rocky Mountain Journal of Mathematics 28 1998 1357-1369
20. McCune, W., 1990. The OTTER user's guide. Technical Report ANL/90/9. Argonne National Laboratories
21. W. McCune Single axioms for groups and Abelian groups with various operations Journal of Automated Reasoning 10 1 1993 1-13
22. McCune, W., 1994. A Davis-Putnam program and its application to finite first-order model search. Technical Report ANL/MCS-TM-194. Argonne National Laboratories
23. W. McCune Solution of the Robbins problem Journal of Automated Reasoning 19 3 1997 263-276
24. S. Muggleton Inverse entailment and Progol New Generation Computing 13 1995 245-286
25. D. Redfern The Maple Handbook: Maple V Release 5 1999 Springer Verlag
26. N. Sloane The Online Encyclopedia of Integer Sequences 2000 http://www.research.att.com/~njas/sequences
27. Zimmer, J., Franke, A., Colton, S., Sutcliffe, G., 2001. Integrating HR and tptp2x into MathWeb to compare automated theorem provers. Technical Report. Division of Informatics, University of Edinburgh