Pages that link to "Item:Q4306397"

The following pages link to A methodology for proving termination of logic programs (Q4306397):

Displaying 19 items.

• Reasoning about termination of pure Prolog programs (Q1308986) (← links)
• A context-based approach to proving termination of evaluation (Q2805157) (← links)
• A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4 (Q3406694) (← links)
• Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016) (← links)
• Automated termination analysis for logic programs with cut (Q3585154) (← links)
• Transformational methodology for proving termination of logic programs (Q3841095) (← links)
• Strong termination of logic programs (Q4036282) (← links)
• Termination of logic programs: the never-ending story (Q4305628) (← links)
• (Q4386947) (← links)
• (Q4411982) (← links)
• A semantic basis for the termination analysis of logic programs (Q4719375) (← links)
• Proving termination of general Prolog programs (Q5096221) (← links)
• A proof-theoretic study of abstract termination principles (Q5216340) (← links)
• A dynamic approach to characterizing termination of general logic programs (Q5267437) (← links)
• Reasoning in Dynamic Logic about Program Termination (Q5452190) (← links)
• Input-Termination of Logic Programs (Q5458804) (← links)
• Program Development in Computational Logic (Q5712541) (← links)
• (Q5740448) (← links)
• Termination of logic programs: Transformational methods revisited (Q5941754) (← links)