by Benjamin Shults, Benjamin Shults
http://www.cs.utexas.edu/ftp/pub/AI-Lab/tech-reports/UT-AI-TR-95-231.ps.Z
Add To MetaCart
Abstract:
IPR is an automatic theorem-proving system intended particularly for use in higher-level mathematics. It discovers the proofs of theorems in mathematics applying known theorems and definitions. Theorems and definitions are stored in the knowledge base in the form of sequents rather than formulas or rewrite rules. Because there is more easily-accessible information in a sequent than there is in the formula it represents, a simple algorithm can be used to search the knowledge base for the most useful theorem or definition to be used in the theorem-proving process. This paper describes how the sequents in the knowledge base are formed from theorems stated by the user and how the knowledge base is used in the theorem-proving process. An example of a theorem proved and the English proof output are also given. 1
Citations
|
341
|
First-Order Logic and Automated Theorem Proving (2 nd ed
– Fitting
- 1996
|
|
210
|
First-order logic
– Smullyan
- 1968
|
|
206
|
A proof generating system for higher-order logic
– Gordon
- 1987
|
|
164
|
Investigations into logical deductions
– Gentzen
- 1969
|
|
152
|
Real Analysis
– Royden
- 1988
|
|
138
|
Fast decision procedures based on congruence closure
– Nelson, Oppen
- 1980
|
|
128
|
Topology, A first course
– Munkres
- 1975
|
|
83
|
Imps: An interactive mathematical proof system
– Farmer, Guttman, et al.
- 1993
|
|
62
|
TPS: A theorem proving system for classical type theory. Research report 94-166
– Andrews, Bishop, et al.
- 1994
|
|
48
|
Differential Forms with Applications to the Physical Sciences
– Flanders
- 1963
|
|
43
|
Automated development of fundamental mathematical theories
– Quaife
- 1992
|
|
39
|
Little theories
– Farmer, Guttman, et al.
- 1992
|
|
37
|
HARP: A tableau-based theorem prover
– Oppacher, Suen
- 1988
|
|
36
|
Automated deduction in von Neumann-Bernays-Godel set theory
– Quaife
- 1992
|
|
30
|
Algernon: A tractable system for knowledge representation
– Crawford, Kuipers
- 1991
|
|
29
|
A system of axiomatic set theory
– Bernays
- 1937
|
|
29
|
Paramodulation and theorem-proving in first-order theories with equality
– Robinson, Wos
- 1969
|
|
25
|
Tensor Analysis on Manifolds
– BISHOP, GOLDBERG
- 1980
|
|
24
|
Rigid E-unification is NP-complete
– Gallier, Narendran, et al.
- 1988
|
|
23
|
A completion-based method for mixed universal and rigid Eunification
– Beckert
- 1994
|
|
20
|
Calculus on manifolds. A modern approach to classical theorems of advanced calculus
– Spivak
- 1965
|
|
17
|
A Man-Machine Theorem-Proving System
– Bledsoe, Bruell
- 1974
|
|
14
|
The liberalized ffi-rule in free variable semantic tableaux
– Hahnle, Schmitt
- 1994
|
|
12
|
Gazing: An Approach to the Problem of Definition and Lemma Use
– Barker-Plummer
- 1992
|
|
12
|
General Topology. The University Series in Higher Mathematics
– Kelley
- 1955
|
|
10
|
Grammar rewriting
– McAllester
- 1992
|
|
7
|
Checking natural language proofs
– Simon
- 1988
|
|
5
|
The Gazer theorem prover
– Barker-Plummer, Rothenberg
- 1992
|
|
4
|
Introduction of Mathematical Logic. mathematics series
– Mendelson
- 1987
|
|
2
|
Interactive proof presentation
– Bledsoe
- 1991
|
