Weighted Path Orders Are Semantic Path Orders
From MaRDI portal
Publication:6496619
DOI10.1007/978-3-031-43369-6_4MaRDI QIDQ6496619
Nao Hirokawa, Author name not available (Why is that?)
Publication date: 3 May 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orderings for term-rewriting systems
- Natural termination
- KBO orientability
- Simple termination of rewrite systems
- MædMax: a maximal ordered completion tool
- Proof-theoretic analysis of termination proofs
- An improved general path order
- Termination of term rewriting using dependency pairs
- Term orderings for non-reachability of (conditional) rewriting
- Relaxed weighted path order in theorem proving
- Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
- Term Rewriting and All That
- Nagoya Termination Tool
- Rewriting Techniques and Applications
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)
