Complete sets of reductions modulo associativity, commutativity and identity

DOI10.1007/3-540-51081-8_98zbMath1503.68286OpenAlexW1723526129MaRDI QIDQ5055710

Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51081-8_98

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (7)

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 ⋮ Termination and completion modulo associativity, commutativity and identity ⋮ AC unification through order-sorted AC1 unification ⋮ On pot, pans and pudding or how to discover generalised critical Pairs

Cites Work

• Completion of a Set of Rules Modulo a Set of Equations
• A Unification Algorithm for Associative-Commutative Functions
• Complete Sets of Reductions for Some Equational Theories
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete sets of reductions modulo associativity, commutativity and identity