Complete monotonic semantic path orderings

DOI10.1007/10721959_27MaRDI QIDQ2723431zbMATH OpenFDO

Authors Cristina Borralleras, Albert Rubio, Maria C. F. Ferreira

Publication date 5 July 2001

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

Full work available at URL https://doi.org/10.1007/10721959_27

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A Monotonic Higher-Order Semantic Path Ordering
• scientific article; zbMATH DE number 2043535
• scientific article; zbMATH DE number 3905845
• Maximal extensions of simplification orderings
• Theory path orderings

Cited in

(11)

• Context-sensitive rewriting strategies
• Automating the dependency pair method
• The size-change principle and dependency pairs for termination of term rewriting
• Modular and incremental automated termination proofs
• A Monotonic Higher-Order Semantic Path Ordering
• Paramodulation with non-monotonic orderings and simplification
• Real_Impl
• scientific article; zbMATH DE number 2043535 (Why is no real title available?)
• Weighted Path Orders Are Semantic Path Orders
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs

This page was built for publication: Complete monotonic semantic path orderings

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