AC completion with termination tools
From MaRDI portal
Recommendations
Cites work
- A dependency pair framework for \(A \vee C\)-termination
- Adventures in associative-commutative unification
- An algebraic approach to unification under associativity and commutativity
- Complete Sets of Reductions for Some Equational Theories
- Completion for multiple reduction orderings
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- scientific article; zbMATH DE number 6027911 (Why is no real title available?)
- Matrix interpretations for proving termination of term rewriting
- Modular and incremental proofs of AC-termination
- Multi-completion with Termination Tools (System Description)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Proving termination properties with \textsc{mu-term}
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- Termination of rewriting systems by polynomial interpretations and its implementation
Cited in
(5)
This page was built for publication: AC completion with termination tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200044)