Pages that link to "Item:Q1978641"
From MaRDI portal
The following pages link to Termination of term rewriting using dependency pairs (Q1978641):
Displaying 50 items.
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- All-Termination(T) (Q3617771) (← links)
- Automatic Termination (Q3636815) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Well-Definedness of Streams by Termination (Q3636825) (← links)
- Local Termination (Q3636830) (← links)
- From Outermost to Context-Sensitive Rewriting (Q3636831) (← links)
- Proving Infinitary Normalization (Q3638246) (← links)
- Degrees of Undecidability in Term Rewriting (Q3644753) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- Termination checking with types (Q4659886) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Termination of constructor systems (Q5055852) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- (Q5089009) (← links)
- (Q5094148) (← links)
- Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- Complexity of Fractran and Productivity (Q5191114) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs (Q5214098) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
- Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction (Q5458374) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Term Rewriting and Applications (Q5703843) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
- Automated Deduction – CADE-19 (Q5900708) (← links)
- Rewriting Techniques and Applications (Q5901572) (← links)
- The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
