scientific article; zbMATH DE number 1487842
From MaRDI portal
Publication:4494366
Recommendations
Cited in
(23)- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Constraints for Argument Filterings
- Context-sensitive dependency pairs
- Mechanically proving termination using polynomial interpretations
- Term orderings for non-reachability of (conditional) rewriting
- Mechanizing and improving dependency pairs
- On proving \(C_E\)-termination of rewriting by size-change termination
- Relaxing monotonicity for innermost termination
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Paramodulation with non-monotonic orderings and simplification
- scientific article; zbMATH DE number 1614705 (Why is no real title available?)
- Argument filterings and usable rules for simply typed dependency pairs
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- The size-change principle and dependency pairs for termination of term rewriting
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Polynomials over the reals in proofs of termination : from theory to practice
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Termination of narrowing via termination of rewriting
- Tuple interpretations for termination of term rewriting
- Modular and incremental proofs of AC-termination
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Multi-dimensional interpretations for termination of term rewriting
- Modular and incremental automated termination proofs
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 Q4494366)
