Weighted Path Orders Are Semantic Path Orders

DOI10.1007/978-3-031-43369-6_4MaRDI QIDQ6496619zbMATH OpenFDO

Authors Nao Hirokawa

Publication date 3 May 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-43369-6_4

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• scientific article; zbMATH DE number 1614707
• An improved general path order
• Relaxed weighted path order in theorem proving
• Invariants, patterns and weights for ordering terms
• A Monotonic Higher-Order Semantic Path Ordering

Cites work

• An improved general path order
• Formalizing Knuth-Bendix orders and Knuth-Bendix completion
• scientific article; zbMATH DE number 1614707 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• KBO orientability
• MædMax: a maximal ordered completion tool
• Nagoya termination tool
• Natural termination
• Orderings for term-rewriting systems
• Proof-theoretic analysis of termination proofs
• Relaxed weighted path order in theorem proving
• Rewriting Techniques and Applications
• Simple termination of rewrite systems
• Term orderings for non-reachability of (conditional) rewriting
• Term Rewriting and All That
• Termination of term rewriting using dependency pairs

This page was built for publication: Weighted Path Orders Are Semantic Path Orders

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