Pages that link to "Item:Q438537"
From MaRDI portal
The following pages link to Proving termination by dependency pairs and inductive theorem proving (Q438537):
Displaying 8 items.
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Termination of theorem proving by reuse (Q4647503) (← links)
- Automated Reasoning (Q5307050) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932) (← links)