A fully syntactic AC-RPO

DOI10.1007/3-540-48685-2_11MaRDI QIDQ4938602zbMATH OpenFDO

Authors Albert Rubio

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48685-2_11

zbMATH Keywords

recursive path ordering

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A fully syntactic AC-RPO.
• A total AC-compatible ordering based on RPO
• A precedence-based total AC-compatible ordering
• scientific article; zbMATH DE number 2043535
• An AC-compatible Knuth-Bendix order.

Cited in

(4)

• A fully syntactic AC-RPO.
• Modular and incremental proofs of AC-termination
• “Syntactic” AC-unification
• A total AC-compatible ordering based on RPO

This page was built for publication: A fully syntactic AC-RPO

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938602)