On the complexity of recursive path orderings
From MaRDI portal
Recommendations
- Efficient ground completion
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- scientific article; zbMATH DE number 58292
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Extensions and comparison of simplification orderings
Cites work
- scientific article; zbMATH DE number 3905845 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1348470 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- On recursive path ordering
- Path of subterms ordering and recursive decomposition ordering revisited
- Proving refutational completeness of theorem-proving strategies
- Termination of rewriting
Cited in
(12)- Algorithms and reductions for rewriting problems. II.
- The computability path ordering
- Polymorphic higher-order recursive path orderings
- scientific article; zbMATH DE number 3926235 (Why is no real title available?)
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Efficient ground completion
- The complexity of counting problems in equational matching
- Recursive Path Orderings Can Also Be Incremental
- A path order for rewrite systems that compute exponential time functions
- Combinatorial Algorithms for Listing Paths in Minimal Change Order
- Improving associative path orderings
- The number of depth-first searches of an ordered set
This page was built for publication: On the complexity of recursive path orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685537)
