The following pages link to Automated Deduction – CADE-19 (Q5900708):
Displaying 8 items.
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Rewriting Techniques and Applications (Q5901572) (← links)
