Pages that link to "Item:Q5705932"
From MaRDI portal
The following pages link to Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932):
Displayed 50 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- KBO orientability (Q846165) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion (Q3454089) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Maximal Termination (Q3522012) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Root-Labeling (Q3522028) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Well-Definedness of Streams by Termination (Q3636825) (← links)
- Degrees of Undecidability in Term Rewriting (Q3644753) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- (Q5089009) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Beyond Dependency Graphs (Q5191112) (← 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)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← 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)