The following pages link to Automated Reasoning (Q5307050):
Displaying 14 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932) (← links)
