AC completion with termination tools

Authors:
Sarah Winkler;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 17
Cited 0

An algebraic approach to unification under associativity and commutativity

Journal of Symbolic Computation
Termination of rewriting systems by polynomial interpretations and its implementation

Science of Computer Programming
Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation
Adventures in associative-commutative unification

Journal of Symbolic Computation
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Canonical Equational Proofs

Canonical Equational Proofs
Completion for Multiple Reduction Orderings

Journal of Automated Reasoning
Associative-Commutative Discrimination Nets

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Dependency Pairs for Equational Rewriting

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
CiME: Completion Modulo E

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Multi-completion with Termination Tools (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A dependency pair framework for A∨C-termination

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Proving termination properties with MU-TERM

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Slothrop: Knuth-Bendix completion with a modern termination checker

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present mascott, a tool for Knuth-Bendix completion modulo the theory of associative and commutative operators. In contrast to classical completion tools, mascott does not rely on a fixed ACcompatible reduction order. Instead, a suitable order is implicitly constructed during a deduction by collecting all oriented rules in a similar fashion as done in the tool Slothrop. This allows for convergent systems which cannot be completed using standard orders. We outline the underlying inference system and comment on implementation details such as the use of multi-completion, term indexing techniques, and critical pair criteria.