Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a… (More)

- Modulo operation
- Unification (computer science)
- Exclusive or
- Theory
- Automated reasoning
- Algorithm
- Divergence (computer science)
- Coherence (physics)
- Programming language
- Encryption
- Rewriting
- Mathematical optimization
- Hellmann–Feynman theorem
- Rewrite (programming)
- Admissible rule
- Maude system
- Type system
- Diffie–Hellman key exchange
- Substitution (logic)
- Dual polyhedron

Sorry, we couldn't extract any figures or tables for this paper.