5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980
Volume 87 of the series Lecture Notes in Computer Science pp 7087
Variable elimination and chaining in a resolutionbased prover for inequalities
 W. W. BledsoeAffiliated withThe University of Texas
 , Larry M. HinesAffiliated withThe University of Texas
Abstract
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.
 Title
 Variable elimination and chaining in a resolutionbased prover for inequalities
 Book Title
 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980
 Pages
 pp 7087
 Copyright
 1980
 DOI
 10.1007/3540100091_7
 Print ISBN
 9783540100096
 Online ISBN
 9783540381402
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 87
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 W. W. Bledsoe ^{(1)}
 Larry M. Hines ^{(1)}
 Author Affiliations

 1. The University of Texas, Austin
Continue reading...
To view the rest of this content please follow the download PDF link above.