Normalized rewriting: an alternative to rewriting modulo a set of equations

Cancellative abelian monoids and related structures in refutational theorem proving (Part I)

Journal of Symbolic Computation

Cancellative abelian monoids and related structures in refutational theorem proving (part II)

Journal of Symbolic Computation

Theory Path Orderings

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Superposition and Chaining for Totally Ordered Divisible Abelian Groups

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Paramodulation with Built-In Abelian Groups

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Cited References

Computer algebra handbook

Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

Journal of Functional Programming

Superposition with completely built-in Abelian groups

Journal of Symbolic Computation

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups

Constraints

Term Collections in λ and ρ-calculi

Electronic Notes in Theoretical Computer Science (ENTCS)

Canonical Abstract Syntax Trees

Electronic Notes in Theoretical Computer Science (ENTCS)

Dependency Pairs for Rewriting with Non-free Constructors

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction

Languages Modulo Normalization

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications

Anti-pattern Matching Modulo

Language and Automata Theory and Applications

Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures

Electronic Notes in Theoretical Computer Science (ENTCS)

Combination of convex theories: Modularity, deduction completeness, and explanation

Journal of Symbolic Computation

Anti-patterns for rule-based languages

Journal of Symbolic Computation

Canonized rewriting and ground AC completion modulo shostak theories

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software

Combining Clifford Algebraic Computing and Term-Rewriting for Geometric Theorem Proving

Fundamenta Informaticae

Integrating linear arithmetic into superposition calculus

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic