Recommendations
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Mechanically proving termination using polynomial interpretations
- Matrix interpretations for proving termination of term rewriting
- Matrix Interpretations for Proving Termination of Term Rewriting
- Search Techniques for Rational Polynomial Orders
Cites work
- Automating the dependency pair method
- Counterexamples to termination for the direct sum of term rewriting systems
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Maximal Termination
- Mechanizing and improving dependency pairs
- Polytool: polynomial interpretations as a basis for termination analysis of logic programs
- Proof of termination of the rewriting system SUBSET on CCL
- Proving Termination by Bounded Increase
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Termination of term rewriting using dependency pairs
- Testing positiveness of polynomials
- TPA: Termination Proved Automatically
- Tyrolean termination tool: techniques and features
Cited in
(22)- Increasing interpretations
- Automatic synthesis of logical models for order-sorted first-order theories
- Multi-dimensional interpretations for termination of term rewriting
- Tuple interpretations for termination of term rewriting
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Outermost ground termination
- Maximal Termination
- Automated Implicit Computational Complexity Analysis (System Description)
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Proving Termination of Integer Term Rewriting
- Automatic proofs of termination with elementary interpretations
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Ramsey versus lexicographic termination proving
- Increasing Interpretations
- Monotonicity criteria for polynomial interpretations over the naturals
- Analysing parallel complexity of term rewriting
- On complexity bounds and confluence of parallel term rewriting
- Certifying the weighted path order (invited talk)
- Implementing field extensions of the form Q[sqrt(b)]
- KBO orientability
This page was built for publication: Maximal Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522012)
