On ground-confluence of term rewriting systems
Information and Computation
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Towards a foundation of completion procedures as semidecision procedures
Theoretical Computer Science
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Term Indexing
WALDMEISTER - High-Performance Equational Deduction
Journal of Automated Reasoning
Journal of Automated Reasoning
The CADE-16 ATP System Competition
Journal of Automated Reasoning
On Word Problems in Equational Theories
ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
Complete Sets of Reductions with Constraints
Proceedings of the 10th International Conference on Automated Deduction
Ordered Rewriting and Confluence
Proceedings of the 10th International Conference on Automated Deduction
Decision Problems in Ordered Rewriting
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
AI Communications - CASC
AI Communications - CASC
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
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
Hi-index | 0.00 |
When rewriting and completion techniques are used for equational theorem proving, the axiom set is saturated with the aim to get a rewrite system that is terminating and confluent on ground terms. To reduce the computational effort it should (1) be powerful for rewriting and (2) create not too many critical pairs. These problems become especially important if some operators are associative and commutative (AC). We show in this paper how these two goals can be reached to some extent by using ground joinable equations for simplification purposes and omitting them from the generation of new facts. For the special case of AC-operators we present a simple redundancy criterion which is easy to implement, efficient, and effective in practice, leading to significant speed-ups.