TY - GEN

T1 - Making conjectures about maple functions

AU - Colton, Simon

PY - 2002

Y1 - 2002

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

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

UR - http://www.scopus.com/inward/record.url?scp=84957039697&partnerID=8YFLogxK

U2 - 10.1007/3-540-45470-5

DO - 10.1007/3-540-45470-5

M3 - Conference Paper

AN - SCOPUS:84957039697

SN - 3540438653

SN - 9783540438656

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 259

EP - 274

BT - Artificial Intelligence, Automated Reasoning and Symbolic Computation - Joint International Conferences AISC 2002 and Calculemus 2002, Proceedings

A2 - Henocque, Laurent

A2 - Calmet, Jacques

A2 - Benhamou, Belaid

A2 - Caprotti, Olga

A2 - Sorge, Volker

PB - Springer

T2 - Symposium on the Integration of Symbolic Computation and Mechanized Reasoning 2002

Y2 - 1 July 2002 through 5 July 2002

ER -