On ground AC-completion

DOI10.1007/3-540-53904-2_114OpenAlexW2158674509MaRDI QIDQ5055778

Claude Marché

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-53904-2_114

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40)

Related Items

On ground AC-completion, Buchberger's algorithm: The term rewriter's point of view, Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties, A total AC-compatible ordering based on RPO, Decidability and complexity analysis by basic paramodulation

Cites Work

• Unnamed Item
• Unnamed Item
• Completion of a Set of Rules Modulo a Set of Equations
• Complete Sets of Reductions for Some Equational Theories
• Recursive Unsolvability of a problem of Thue
• On ground AC-completion
• Ordering by Divisibility in Abstract Algebras