Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
A superposition oriented theorem prover
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
How to facilitate the proof of theories by using the induction matching, and by generalization
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
We show how to prove (and disprove) theorems in the initial algebra of an equational variety by a simple extension of the Knuth-Bendix completion algorithm. This allows us to prove by purely equational reasoning theorems whose proof usually requires induction. We show applications of this method to proofs of programs computing over data structures, and to proofs of algebraic summation identities. This work extends and simplifies recent results of Musser15 and Goguen6.