Theorem proving modulo associativity
Author:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 452-467
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Theorem Proving with Ordering and Equality Constrained ClausesJournal of Symbolic Computation, 1995
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- Basic superposition is complete1992
- Any ground associative-commutative theory has a finite canonical system1991
- Canonical Equational Proofs1991
- Completion for rewriting modulo a congruence1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Confluent and coherent equational term rewriting systems application to proofs in abstract data types1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUPMathematics of the USSR-Sbornik, 1977