Pages that link to "Item:Q3841095"

The following pages link to Transformational methodology for proving termination of logic programs (Q3841095):

Displaying 13 items.

• A general proof rule for procedures in predicate transformer semantics (Q797986) (← links)
• A framework for incremental learning of logic programs (Q1390950) (← links)
• Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
• Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
• Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
• Termination prediction for general logic programs (Q3648357) (← links)
• A methodology for proving termination of logic programs (Q4306397) (← links)
• (Q4386947) (← links)
• A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
• Program Development in Computational Logic (Q5712541) (← links)
• Combining termination proofs in model transformation systems (Q5740376) (← links)
• Termination proofs of well-moded logic programs via conditional rewrite systems (Q5881206) (← links)
• Termination of logic programs: Transformational methods revisited (Q5941754) (← links)