Variable elimination and chaining in a resolution-based prover for inequalities
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This prover uses "variable elimination", and a modified form of inequality chaining (in which chaining is allowed only on so called "shielding terms"), and a decision procedure for proving ground inequality theorems. These techniques and others help to avoid the explicit use of certain axioms, such as the transitivity and interpolation axioms for inequalities, in order to reduce the size of the search space and to speed up proofs. Several examples are given along with results from a computer implementation. In particular this program has proved some difficult theorems such as: The sum of two continuous functions is continuous.
- W.W. Bledsoe. A Resolution-based Prover for General Inequalities. University of Texas, Math Department Memo ATP-52, July 1979.
- J.R. Slagle and L. Norton. Experiments with an Automatic Theorem Prover Having Partial Ordering Rules. CACM 16 (1973), 683–688.
- J.C. King. A Program Verifier. Ph.D. Thesis, Carnegie-Mellon University, 1969.
- Greg Nelson and Derek Oppen. A Simplifier Based on Efficient Decision Algorithms. Proc. 5th ACM Symp. on Principles of Programming Languages, 1978.
- Robert Shostak. A Practical Decision Procedure for Arithmetic with Function Symbols. JACM, April 1979.
- W.W. Bledsoe, Peter Bruell and Robert Shostak. A Prover for General Inequalities. University of Texas, Math Department Memo ATP-40A, February 1979. Also IJCAI-79, Tokyo, Japan, August 1979.
- Louis Hodes. Solving Programs by Formula Manipulation in Logic and Linear Inequality. Proc. IJCAI-71, London, 1971, pages 553–559.
- M.A. Stickel. A Complete Unification for Associative-Commutative Functions, IJCAI-75, Tbilisi, USSR, 1975, pages 71–76.
- J.A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. JACM 12 (1965), 23–41. CrossRef
- W.W. Bledsoe. Splitting and Reduction Heuristics in Automatic Theorem Proving. AEJ 2 (1971), 55–77.
- L. Wos and G.A. Robinson. Paramodulation and Set of Support. Proc. Symp. Automatic Demonstration, Versailles, France. Springer-Verlag, New York, 1968, 276–310.
- Variable elimination and chaining in a resolution-based prover for inequalities
- Book Title
- 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980
- pp 70-87
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.