scientific article; zbMATH DE number 3905845
From MaRDI portal
Publication:3683533
Recommendations
Cited in
(32)- On the recursive decomposition ordering with lexicographical status and other related orderings
- On the complexity of recursive path orderings
- Improving associative path orderings
- Practical algorithms for deciding path ordering constraint satisfaction.
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Path of subterms ordering and recursive decomposition ordering revisited
- scientific article; zbMATH DE number 1405624 (Why is no real title available?)
- An improved general path order
- On recursive path ordering
- A path ordering for proving termination of AC rewrite systems
- Extensions and comparison of simplification orderings
- Rewriting Techniques and Applications
- Proving termination of (conditional) rewrite systems. A semantic approach
- Leanest quasi-orderings
- scientific article; zbMATH DE number 4007716 (Why is no real title available?)
- Termination of rewriting
- Simplification orderings: Putting them to the test
- Termination orderings for associative-commutative rewriting systems
- scientific article; zbMATH DE number 3870584 (Why is no real title available?)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Automatic termination proofs with transformation orderings
- Graph path orderings
- scientific article; zbMATH DE number 1614707 (Why is no real title available?)
- scientific article; zbMATH DE number 176122 (Why is no real title available?)
- scientific article; zbMATH DE number 408817 (Why is no real title available?)
- Time bounded rewrite systems and termination proofs by generalized embedding
- Topics in termination
- scientific article; zbMATH DE number 794239 (Why is no real title available?)
- scientific article; zbMATH DE number 3926235 (Why is no real title available?)
- Optimization of rewriting and complexity of rewriting
- Maximal extensions of simplification orderings
- Proving Termination Using Recursive Path Orders and SAT Solving
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683533)
