A prover for general inequalities

Authors:
W. W. Bledsoe;Peter Bruell;Robert Shostak
Affiliations:
Department of Mathematics, The University of Texas at Austin, Austin, Texas;Department of Mathematics, The University of Texas at Austin, Austin, Texas;SRI International, Menlo Park, California
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Year:
1979

Citing 4
Cited 2

A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
A simplifier based on efficient decision algorithms

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Verifying programs by algebraic and logical reduction

Proceedings of the international conference on Reliable software
A program verifier

A program verifier

Hierarchical reasoning about inequalities

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Hierarchical reasoning about inequalities

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variation of an earlier prover (described in Machine Intelligence 8) is used to prove theorems about general inequalities, i.e., first-order logic with equality where the only predicate symbols are