Pages that link to "Item:Q5941754"
From MaRDI portal
The following pages link to Termination of logic programs: Transformational methods revisited (Q5941754):
Displaying 18 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Transformation for refining unraveled conditional term rewriting systems (Q2866802) (← links)
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- Formalizing Soundness and Completeness of Unravelings (Q2964466) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Foundations of the rule-based system ρLog (Q3647259) (← links)
- Transformational methodology for proving termination of logic programs (Q3841095) (← links)
- Termination of logic programs: the never-ending story (Q4305628) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
- Termination proofs of well-moded logic programs via conditional rewrite systems (Q5881206) (← links)
