Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM

Volumn 45, Issue 6, 1998, Pages 1007-1049

  Bachmair, Leo ^a,c   Ganzinger, Harald ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REFUTATIONAL THEOREM PROVERS; REWRITE SYSTEMS; TERM REWRITING; VARIABLE CHAINING;

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; OPTIMIZATION; THEOREM PROVING;

INFERENCE ENGINES;

EID: 0032201822     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/293347.293352     Document Type: Article

References (24)

1. BACHMAIR, L., DERSHOWITZ, N., AND HSIANG, J. 1986. Orderings for equational proofs. In Proceedings of the Symposium on Logic in Computer Science (Boston, Mass.). pp. 346-357.
2. BACHMAIR, L., DERSHOWITZ, N., AND PLAISTED, D. 1989. Completion without failure. In Resolution of Equations in Algebraic Structures, vol. 2, H. Ait-Kaci and M. Nivat, eds. Academic Press, Orlando, Fla., pp. 1-30.
3. BACHMAIR, L., AND GANZINGER, H. 1990. On restrictions of ordered paramodulation with simplification. In Proceedings of the 10th International Conference on Automated Deduction, Kaiserslautern (Berlin, Germany). Lecture Notes in Computer Science, vol. 449. Springer-Verlag, New York, pp. 427-441.
4. BACHMAIR, L., AND GANZINGER, H. 1994. Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4, 3, 217-247. (Revised version of Tech. Rep. MPI-I-91-208, 1991.)
5. BACHMAIR, L., AND GANZINGER, H. 1995. Ordered chaining calculi for first-order theories of binary relations. Res. Rep. MPI-I-95-2-009. Max-Planck-Institut für Informatik, Saarbrücken, Germany.
6. BACHMAIR, L., AND GANZINGER, H. 1999. A theory of resolution. Handb. Autom. Reas., Alan Robinson and Andrei Voronkov, eds. Elsevier Science Publishers.
7. BACHMAIR, L., GANZINGER, H., AND STUBER, J. 1995. Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings. In Recent Trends in Data Type Specification, E. Astesiano, G. Reggio, and A. Tarlecki, eds. Lecture Notes in Computer Science, Vol. 306. Springer-Verlag, New York, pp. 1-29.
8. BLEDSOE, W., KUNEN, K., AND SHOSTAK, R. 1985. Completeness results for inequality provers. Artif. Int. 27, 255-288.
9. BOYER, R. S., AND MOORE, J. S. 1988. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In Mach. Int. vol. 11, Chap. 5, J. E. Hayes, D. Michie, and J. Richards, eds. Clarendon Press, Oxford, England, pp. 83-124.
10. DERSHOWITZ, N. 1987. Termination of rewriting. J. Symb. Comput. 3, 69-116.
11. DERSHOWITZ, N. 1991. A maximal-literal unit strategy for horn clauses. In Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems. Lecture Notes in Computer Science, vol. 516. Springer-Verlag, New York, pp. 14-25.
12. GANZINGER, H. 1991. A completion procedure for conditional equations. J. Symbol. Comput. 11, 51-81.
13. GANZINGER, H., NIEUWENHUIS, R., AND NIVELA, P. 1994. The Saturate system. User manual maintained on the Web.
14. HINES, L. M. 1992. Completeness of a prover for dense linear logics. J. Automat. Reas. 8, 45-75.
15. HINES, L. M. 1994. Str+ve and integers. In Proceedings of the 12th International Conference on Automated Deduction (Nancy, France, June 26-July 1). Lecture Notes in Artificial Intelligence, vol. 814. Springer-Verlag, New York, pp. 416-430.
16. LEVY, J., AND AGUSTÍ, J. 1993. Bi-rewriting, a term rewriting technique for monotonic order relations. In Rewriting Techniques and Applications, C. Kirchner, ed. Lecture Notes in Computer Science, vol. 690. Springer-Verlag, New York, pp. 17-31.
17. MANNA, Z., AND WALDINGER, R. 1986. Special relations in automated deduction. J. ACM 33, 1 (Mar.), 1-60.
18. MANNA, Z., AND WALDINGER, R. 1992. The special-relation rules are incomplete. In Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, N.Y., June). Lecture Notes in Artificial Intelligence, vol. 607. Springer-Verlag, New York, pp. 492-506.
19. OWRE, S., RUSHBY, J. M., AND SHANKAR, N. 1992. PVS: A prototype verification system. In Proceedings of the 11th International Conference on Automated Deduction. Lecture Notes in Computer Science, vol. 607. Springer-Verlag, New York, pp. 748-752.
20. RICHTER, M. 1984. Some reordering properties for inequality proof trees. In Lecture Notes in Computer Science. Springer-Verlag, New York, pp. 183-197.
21. SCOTT, D. S. 1979. Identity and existence in intuitionistic logic. In Applications of Sheaves, Proceedings Durham. Lecture Notes in Mathematics, vol. 753. Springer-Verlag, New York, pp. 660-695.
22. SLAGLE, J. R. 1972. Automatic theorem proving with built-in theories including equality, partial orderings, and sets. J. ACM 19, 1 (Mar.), 120-135.
23. WALDMANN, U. 1998. Superposition for divisible torsion-free abelian groups. In Automated Deduction-CADE-15, 15th International Conference on Automated Deduction, C. Kirchner and H. Kirchner, eds. Lecture Notes in Artificial Intelligence. Springer-Verlag, New York, pp. 144-159.
24. WEIDENBACH, C. 1997. Spass version 0.49. J. Autom. Reas. 18, 2, 247-252.