Pages that link to "Item:Q3591084"
From MaRDI portal
The following pages link to Automated Termination Analysis for Logic Programs by Term Rewriting (Q3591084):
Displaying 15 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt) (Q2726244) (← links)
- (Q2766778) (← links)
- Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
- Automated termination analysis for logic programs with cut (Q3585154) (← links)
- A New Approach to Non-termination Analysis of Logic Programs (Q4649732) (← links)
- A semantic basis for the termination analysis of logic programs (Q4719375) (← links)
- (Q4779112) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Termination of logic programs: Transformational methods revisited (Q5941754) (← links)