Termination and completion modulo associativity, commutativity and identity

DOI10.1016/0304-3975(92)90165-CzbMath0759.68047MaRDI QIDQ1199927

Jean-Pierre Jouannaud, Claude Marché

Publication date: 17 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (10)

Extending reduction orderings to ACU-compatible reduction orderings ⋮ Open problems in rewriting ⋮ More problems in rewriting ⋮ AC-complete unification and its application to theorem proving ⋮ Theorem proving in cancellative abelian monoids (extended abstract) ⋮ Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I ⋮ On pot, pans and pudding or how to discover generalised critical Pairs ⋮ Extending Maximal Completion (Invited Talk) ⋮ Termination Modulo Combinations of Equational Theories ⋮ Cancellative Abelian monoids and related structures in refutational theorem proving. I

Uses Software

• REVE

Cites Work

• Termination orderings for associative-commutative rewriting systems
• Termination of rewriting
• New decision algorithms for finitely presented commutative semigroups
• Completion for rewriting modulo a congruence
• Completion of a Set of Rules Modulo a Set of Equations
• Complete Sets of Reductions for Some Equational Theories
• Complete sets of reductions modulo associativity, commutativity and identity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination and completion modulo associativity, commutativity and identity