论文信息 - Str+ve and Integers

Str+ve and Integers

The str∔ve theorem prover is designed to prove theorems about dense linear orders. In this paper, we discuss two extensions of str∔ve to theorems about the integers. We describe a version of str∔ve which proves theorems solely about integers. Also, we describe a version for theorems over two separate linear orders, one dense and one the integers.

Larry M. Hines

[1] Derek C. Oppen,et al. A simplifier based on efficient decision algorithms , 1978, POPL.

[2] Larry M. Hines. The Central Variable Strategy of Str+ve , 1992, CADE.

[3] Thomas Käufl,et al. Reasoning about Systems of Linear Inequalities , 1988, CADE.

[4] James C. King,et al. A Program Verifier , 1971, IFIP Congress.

[5] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

[6] Larry Marvin Hines. Building in axioms and lemmas , 1988 .

[7] Larry M. Hines. Str+ve ⊆ : the Str+ve-based subset prover , 1990 .

[8] W. W. Bledsoe,et al. Variable Elimination and Chaining in a Resolution-based Prover for Inequalities , 1980, CADE.

[9] Robert E. Shostak,et al. A Practical Decision Procedure for Arithmetic with Function Symbols , 1979, JACM.

[10] Larry M. Hines. Hyper-Chaining and Knowledge-Based Theorem Proving , 1988, CADE.

[11] Arkady Rabinov. A Restriction of Factoring in Binary Resolution , 1988, CADE.

[12] Rodney A. Brooks,et al. Model-Based Computer Vision , 1984 .

[13] Lewis M. Norton,et al. Experiment with an automatic theorem-prover having partial ordering inference rules , 1973, CACM.

[14] Robert S. Boyer,et al. Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic , 1988 .