Andrej Bauer, Edmund Clarke, Xudong Zhao  Home/Search
Context Related
| andrej.com/papers/analytica.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: andrej.com/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Analytica is an automatic theorem prover for theorems in elementary analysis. The prover is written in Mathematica language and runs in the Mathematica environment. The goal of the project is to use a powerful symbolic computation system to prove theorems that are beyond the scope of previous automatic theorem provers. The theorem prover is also able to deduce correctness of certain simplification steps that would otherwise not be performed. We describe the structure of Analytica and explain... (Update)
Cited by: More
Non-trivial Symbolic Computations in Proof - Planning Volker Sorge (2000) (Correct)
CDM: Teaching Discrete Mathematics - To Computer Science (Correct)
Computer Algebra Meets Automated Theorem Proving.. - Adams, Dunstan.. (2001) (Correct)
Similar documents (at the sentence level):
25.0%: Analytica - A Theorem Prover for Mathematica - Clarke, Zhao (1993) (Correct)
19.6%: Analytica - An Experiment in Combining Theorem Proving and.. - Clarke, Zhao (1992) (Correct)
Active bibliography (related documents): More All
0.4: Combining symbolic computation and theorem proving: some.. - Clarke, Zhao (1994) (Correct)
0.3: Mechanically Verifying Real-Valued Algorithms in ACL2 - Gamboa (1999) (Correct)
0.2: The Quantity Lattice for Engineering Design - Schrag (1994) (Correct)
Similar documents based on text:
97.0: Unknown - (Correct)
Related documents from co-citation: More All
7: A Survey on the Theorema Project - Buchberger - 1997
5: Theorems and algorithms: An interface between Isabelle and Maple - Ballarin, Homann et al. - 1995
4: Symbolic computation: computer algebra and logic - Buchberger - 1996
BibTeX entry: (Update)
Andrej Bauer, Edmund Clarke, and Xudong Zhao. Analytica - an experiment in combining theorem proving and symbolic computation. In Artificial Intelligence and Symbolic Mathematical Computation (AISMC3) , volume 1138 of Lecture Notes in Computer Science, pages 21--37. Springer, 1996. http://citeseer.ist.psu.edu/bauer97analytica.html More
@article{ bauer98analytica,
author = "Andrej Bauer and Edmund M. Clarke and Xudong Zhao",
title = "Analytica - An Experiment in Combining Theorem Proving and Symbolic Computation",
journal = "Journal of Automated Reasoning",
volume = "21",
number = "3",
pages = "295-325",
year = "1998",
url = "citeseer.ist.psu.edu/bauer97analytica.html" }
Citations (may not include all citations):392 A Computational Logic (context) - Boyer, Moore - 1979
322 First-order Logic and Automated Theorem Proving (context) - Fitting - 1990
287 Mathematica: A System for Doing Mathematics by Computer (context) - Wolfram - 1988
157 Edinburgh LCF: A mechanised logic of computation (context) - Gordon, Milner et al. - 1979
110 Ramanujan's Notebooks (context) - Berndt - 1985
99 IMPS: An interactive mathematical proof system - Farmer, Guttman et al. - 1990
97 Experiments with proof plans for induction - Bundy, van Harmelen et al. - 1988
82 Logic for Computer Science: Foundations of Automatic Theorem.. (context) - Gallier - 1986
61 Oxford University Press (context) - Titchmarsh, of - 1932
45 HOL: A machine oriented formulation of higher order logic - Gordon - 1985
43 Theorems and Algorithms: An Interface between Isabelle and M.. - Ballarin, Homann et al. - 1995
38 Analytica: A theorem prover for Mathematica - Clarke, Zhao - 1993
27 Automated deduction in von Neumann-Bernays-Godel set theory (context) - Quaife - 1989
21 Extending HOL Theorem Prover with a Computer Algebra System .. - Harrison, Th'ery - 1994
12 Indefinite hypergeometric sums in MACSYMA (context) - Gosper - 1977
9 Some automatic proofs in analysis (context) - Bledsoe - 1984
6 The application of a symbolic mathematical system to program.. (context) - London, Musser - 1975
5 The UT natural deduction prover (context) - Bledsoe - 1983
5 An interactive calculus theorem-prover for continuity proper.. (context) - Suppes, Takahashi - 1989
4 Hierarchical inequality reasoning (context) - Sacks - 1987
3 A prover for general inequalities (context) - Bledsoe, Bruell et al. - 1979
1 Gazing: An Approach to the Problem of Definition and Lemma U.. (context) - Baker-Plummer - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://andrej.com/papers/): More
Locally Non-compact Spaces and Continuity Principles - Bauer, Simpson (2003) (Correct)
Two Constructive Embedding-Extension Theorems with.. - Bauer, Simpson (2003) (Correct)
Sheaf Toposes for Realizability - Awodey, Bauer (2001) (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