Recommendations
Cites work
- Automating the dependency pair method
- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- Innermost termination of rewrite systems by labeling
- Logic for Programming, Artificial Intelligence, and Reasoning
- Matrix Interpretations for Proving Termination of Term Rewriting
- Mechanizing and improving dependency pairs
- Predictive Labeling
- Predictive Labeling with Dependency Pairs Using SAT
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Termination by Quasi-periodic Interpretations
- Termination of term rewriting using dependency pairs
- Theory and Applications of Satisfiability Testing
- TPA: Termination Proved Automatically
- Transforming termination by self-labelling
Cited in
(6)- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
- Size-based termination of higher-order rewriting
- Using linear constraints for logic program termination analysis
- Sparse tiling through overlap closures for termination of string rewriting
- Root to Kellerer
- Duplication Roots
This page was built for publication: Root-Labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522028)
