Automated deduction with associative-commutative operators
- 1 January 1995
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 6 (1) , 23-56
- https://doi.org/10.1007/bf01270929
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Proving refutational completeness of theorem-proving strategiesJournal of the ACM, 1991
- On restrictions of ordered paramodulation with simplificationPublished by Springer Nature ,1990
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- SbReve2: A term rewriting laboratory with (AC)-unfailing completionLecture Notes in Computer Science, 1989
- Opening the AC-unification raceJournal of Automated Reasoning, 1988
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- On word problems in equational theoriesPublished by Springer Nature ,1987
- Associative path orderingsPublished by Springer Nature ,1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proving Theorems with the Modification MethodSIAM Journal on Computing, 1975