(Enter summary)
Abstract: computation. The challenge problems in this paper are taken from Chapter 2 of Ramanujan
's Notebooks. They were selected because they are non-trivial and require the use of
symbolic computation techniques. We have developed a theorem prover based on the symbolic
computation system Mathematica that can prove all the challenge problems completely
automatically. The axioms and inference rules for constructing the proofs are also briefly
discussed.
This research was sponsored in part by the... (Update)
Context of citations to this paper: More
.... quantifier elimination in REDUCE [42] and induction in Mathematica [7] A particularly successful application is Clarke s Analytica system [11], which extended Mathematica with a collection of inference rules, including first order natural deduction and induction, implemented...
.... recently, in the form of verifying computer algebra algorithms in theorem provers [Th e98] adding inference mechanisms to CAS [CZ94], using proof planning techniques to aid in organising calculations [KKS96] or arranging for provers to make calls to CAS [HT94,HC94]...
Cited by: More
Model Checking - Clarke, Schlingloff (2000)
(Correct)
System Description: Analytica 2 - Edmund Clarke Michael
(Correct)
Automated Theorem Proving in Support of Computer.. - Adams..
(Correct)
Active bibliography (related documents): More All
0.6: Combining symbolic computation and theorem proving: some.. - Clarke, Zhao (1994)
(Correct)
0.4: Analytica - An Experiment in Combining Theorem Proving and.. - Bauer, Clarke, Zhao (1997)
(Correct)
0.4: Analytica - A Theorem Prover for Mathematica - Clarke, Zhao (1993)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
5: Extending the HOL theorem prover with a computer algebra system to reason about ..
- Harrison, Thery - 1993
4: Integrating Symbolic Mathematical Computation and Artificial Intelligence (context) - Calmet, Campbell - 1994
4: Really Strong Integration Algorithms (context) - Davenport
BibTeX entry: (Update)
E. Clarke and X. Zhao. Combining symbolic computation and theorem proving: Some problems of Ramanujan. In A. Bundy, editor, Proceedings of Cade-12, volume 814 of Lecture Notes in Artificial Intelligence, pages 758--763. Springer-Verlag, 1994. http://citeseer.ist.psu.edu/clarke94combining.html More
@inproceedings{ clarke94combining,
author = "Edmund M. Clarke and Xudong Zhao",
title = "Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan",
booktitle = "Conference on Automated Deduction",
pages = "758-763",
year = "1994",
url = "citeseer.ist.psu.edu/clarke94combining.html" }
Citations (may not include all citations):
287
Mathematica: A System for Doing Mathematics by Computer (context) - Wolfram - 1988
110
Ramanujan's Notebooks (context) - Berndt - 1985
38
Analytica -- A theorem prover for Mathematica
- Clarke, Zhao - 1993
33
The Use of Proof Plans to Sum Series
- Walsh, Nunes et al. - 1992
12
Indefinite Hypergeometric sums in MACSYMA (context) - Gosper - 1977
8
Analytica -- An Experiment in Combining Theorem Proving and ..
- Clarke, Zhao - 1992
6
The Application of a Symbolic Mathematical System to Program.. (context) - London, Musser
5
An Interactive Calculus Theorem-prover for Continuity Proper.. (context) - Suppes, Takahashi - 1989
Documents on the same site (http://www.cs.cmu.edu/~emc/papers.htm): More
Hybrid Spectral Transform Diagrams - Clarke, Fujita, Heinle (1997)
(Correct)
Another Look at LTL Model Checking - Clarke, Grumberg, Hamaguchi (1994)
(Correct)
Verification of the Futurebus+ Cache Coherence Protocol - Clarke, Grumberg.. (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC