Pages that link to "Item:Q3585154"

The following pages link to Automated termination analysis for logic programs with cut (Q3585154):

Displaying 9 items.

• Proving completeness of logic programs with the cut (Q511027) (← links)
• A framework for computing finite SLD trees (Q2258840) (← links)
• Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
• Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← 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)
• A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
• A practical analysis of non-termination in large logic programs (Q5398306) (← links)
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)