TY - CONF

T1 - Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study

AU - Adams, AA

AU - Gottliebsen, H

AU - Linton, Stephen Alexander

AU - Martin, Ursula Hilda Mary

AU - Dooley, S

N1 - Proc 1999 ACM International Symposium on Symbolic and Algebraic Computation (ISSAC '99), Vancouver, Canada, ACM Press

PY - 1999

Y1 - 1999

N2 - We assess the current state of research in the application of computer aided formal reasoning to computer algebra, and argue that embedded verification support allows users to enjoy its benefits without wrestling with technicalities. We illustrate this claim by considering symbolic definite integration, and present a verifiable symbolic definite integral table look up: a system which matches a query comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of lemmas about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. We present the full model of such a system as well as a description of our prototype implementation showing the efficacy of such a system: for example, the prototype is able to obtain correct answers in cases where computer algebra systems [CAS] do not. We extend upon Fateman's web-based table by including parametric limits of integration and queries with side conditions.

AB - We assess the current state of research in the application of computer aided formal reasoning to computer algebra, and argue that embedded verification support allows users to enjoy its benefits without wrestling with technicalities. We illustrate this claim by considering symbolic definite integration, and present a verifiable symbolic definite integral table look up: a system which matches a query comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of lemmas about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. We present the full model of such a system as well as a description of our prototype implementation showing the efficacy of such a system: for example, the prototype is able to obtain correct answers in cases where computer algebra systems [CAS] do not. We extend upon Fateman's web-based table by including parametric limits of integration and queries with side conditions.

UR - http://www.dcs.st-and.ac.uk/research/publications/AGL+99a.php

M3 - Paper

SP - 253

EP - 260

ER -