On using ground joinable equations in equational theorem proving

Journal of Symbolic Computation

Volumn 36, Issue 1-2, 2003, Pages 217-233

  Avenhaus, J ^a   Hillenbrand, Th ^a   Lochner B ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 9444250594     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00024-5     Document Type: Article

References (19)

1. Bachmair, L., Dershowitz, N., Plaisted, D.A., 1989. Completion without failure. In: Aït-Kaci, H. (Ed.), Resolution of Equations in Algebraic Structures, vol. 2. Academic Press, San Diego, CA, pp. 1-30.
2. Bachmair, L., Ganzinger, H., 1994. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4, 217-247.
3. Bonacina, M.P., Hsiang, J., 1995. Towards a foundation of completion procedures as semidecision procedures. Theoretical Computer Science 146, 199-242.
4. Buch, A., Hillenbrand, Th., 1996. Waldmeister: Development of a High Performance Completion-Based Theorem Prover. SEKI-Report 96-01, Universität Kaiserslautern.
5. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M., 1998. Decision problems in ordered rewriting. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, Los Alamitos, CA, pp. 276-286.
6. Graf, P., 1996. Term Indexing. In: LNCS, vol. 1053.
7. Hillenbrand, Th., Buch, A., Vogt, R., Löchner, B., 1997. Waldmeister: high performance equational deduction. Journal of Automated Reasoning 18, 265-270.
8. Hillenbrand, Th., Jaeger, A., Löchner, B., 1999. System description: Waldmeister-improvements in performance and ease of use. In: Proceedings of the 16th International Conference on Automated Deduction, LNAI, vol. 1632. pp. 232-236.
9. Hsiang, J., Rusinowitch, M., 1987. On word problems in equational theories. In: Proceedings of the 14th International Colloquium on Automata, Languages and Programming, LNCS, vol. 267. pp. 54-71.
10. Kapur, D., Narendran, P., Otto, F., 1990. On ground-confluence of term rewriting systems. Information and Computation 86, 14-31.
11. Knuth, D.E., Bendix, P.B., 1970. Simple word problems in universal algebras. In: Leech, J. (Ed.), Combinatorial Problems in Abstract Algebra, Pergamon Press, Oxford, UK, pp. 263-297.
12. Lankford, D., 1975. Canonical Inference. Technical Report ATP-32. Department of Mathematics and Computer Science, University of Texas, Austin.
13. Martin, U., Nipkow, T., 1990. Ordered rewriting and confluence. In: Proceedings of the 10th International Conference on Automated Deduction, LNCS, vol. 449. pp. 366-380.
14. Nieuwenhuis, R., Rubio, A., 1995. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation 19, 321-352.
15. Peterson, G., 1983. A technique to establish completeness results in theorem proving with equality. SIAM Journal of Computing 12, 82-100.
16. Peterson, G.E., 1990. Complete sets of reductions with constraints. In: Proceedings of the 10th International Conference on Automated Deduction, LNCS, vol. 449. pp. 381-395.
17. Peterson, G., Stickel, M., 1981. Complete sets of reduction for some equational theories. Journal of the ACM 28, 233-264.
18. Sutcliffe, G., 2000. The CADE-16 system competition. Journal of Automated Reasoning 24, 371-396.
19. Sutcliffe, G., Suttner, G., 1998, The TPTP problem library. CNF release v.1.2.1. Journal of Automated Reasoning 21, 177-203.