Abstract
One of the main applications of computational techniques to pure mathematics has been the use of computer algebra systems to perform calculations which mathematicians cannot perform by hand. Because the data is produced within the computer algebra system, this becomes an environment for the exploration of new functions and the data produced is often analysed in order to make conjectures empirically. We add some automation to this by using the HR theory formation system to make conjectures about Maple functions supplied by the user. Experience has shown that HR produces too many conjectures which are easily proven from the definitions of the functions involved. Hence, we use the Otter theorem prover to discard any theorems which can be easily proven, leaving behind the more interesting ones which are empirically true but not trivially provable. By providing an application of HR’s theory formation in number theory, we show that using Otter to prune HR’s dull conjectures has much potential for producing interesting conjectures about standard computer algebra functions.
Keywords
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B Buchberger. Theory exploration versus theorem proving. In Proceedings of Calculemus 99, Systems for Integrated Computation and Deduction, 1998.
S Chou. Proving and discovering geometry theorems using Wu’s method. Technical Report 49, Computing Science, University of Austin at Texas, 1985.
S Colton. Refactorable numbers-a machine invention. Journal of Integer Sequences, 2, 1999.
S Colton. Automated Theory Formation in Pure Mathematics. PhD thesis, Department of Artificial Intelligence, University of Edinburgh, 2000.
S Colton, A Bundy, and T Walsh. Automatic identification of mathematical concepts. In Machine Learning: Proceedings of the 17th International Conference, 2000.
S Colton, A Bundy, and T Walsh. Automatic invention of integer sequences. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, 2000.
S Colton and I Miguel. Constraint generation via automated theory formation. In Proceedings of CP-01, 2001.
S Fajtlowicz. On conjectures of Graffiti. Discrete Mathematics 72, 23:113–118, 1988.
Andreas Franke and Michael Kohlhase. System description: MathWeb, an agent-based communication layer for distributed automated theorem proving. In Proceedings of CADE-16, pages 217–221, 1999.
G Hardy and E Wright. The Theory of Numbers. Oxford University Press, 1938.
D Lenat. AM: Discovery in mathematics as heuristic search. In D Lenat and R Davis, editors, Knowledge-Based Systems in Artificial Intelligence. McGraw-Hill Advanced Computer Science Series, 1982.
R McCasland, M Moore, and P Smith. An introduction to Zariski spaces over Zariski topologies. Rocky Mountain Journal of Mathematics, 28:1357–1369, 1998.
W McCune. The OTTER user’s guide. Technical Report ANL/90/9, Argonne National Laboratories, 1990.
W McCune. Single axioms for groups and Abelian groups with various operations. Journal of Automated Reasoning, 10(1):1–13, 1993.
W McCune. A Davis-Putnam program and its application to finite first-order model search. Technical Report ANL/MCS-TM-194, Argonne National Laboratories, 1994.
D. Redfern. The Maple Handbook: Maple V Release 5. Springer Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colton, S. (2002). Making Conjectures about Maple Functions. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds) Artificial Intelligence, Automated Reasoning, and Symbolic Computation. AISC Calculemus 2002 2002. Lecture Notes in Computer Science(), vol 2385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45470-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-45470-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43865-6
Online ISBN: 978-3-540-45470-0
eBook Packages: Springer Book Archive