A page from the OpenDepot.org service

Jump to the start of the main contents

Adams, A.A. and Gottliebsen, H. and Linton, S.A. and Martin, U. (1999) Automated theorem proving in support of computer algebra: symbolic definite integration as a case study. In: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation. ACM Press, pp. 253-260. ISBN 1-58113-073-2

[img]
Preview
PDF
Download (92Kb) | Preview

    Abstract

    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.

    Item Type: Book Section
    Subjects: Mathematical and Computer Sciences > Others in Mathematical and Computing Sciences > Mathematical and Computing Sciences not elsewhere classified
    Divisions: UNSPECIFIED
    Depositing User: Dr Andrew Adams
    Date Deposited: 23 Jul 2008 14:23
    Last Modified: 23 Aug 2010 14:26
    URI: http://opendepot.org/id/eprint/75

    Actions (login required)

    View Item