Pages that link to "Item:Q1188722"

The following pages link to Termination proofs for logic programs (Q1188722):

Displaying 31 items.

• Proving mutual termination (Q746783) (← links)
• Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
• A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
• Reasoning about termination of pure Prolog programs (Q1308986) (← links)
• Norms on terms and their use in proving universal termination of a logic program (Q1318707) (← links)
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation (Q1322838) (← links)
• On proving the termination of algorithms by machine (Q1341666) (← links)
• A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
• A framework for incremental learning of logic programs (Q1390950) (← links)
• Some classes of Prolog programs inferable from positive data (Q1575466) (← links)
• Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
• Inference of Termination Conditions for Numerical Loops in Prolog (Q2996199) (← 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)
• Termination of constraint logic programs (Q4572011) (← links)
• Termination analysis for partial functions (Q5030190) (← links)
• Proving termination of general Prolog programs (Q5096221) (← links)
• Terminating sequent calculi for proving and refuting formulas in S4 (Q5176550) (← links)
• Reasoning in Dynamic Logic about Program Termination (Q5452190) (← links)
• Input-Termination of Logic Programs (Q5458804) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Program Development in Computational Logic (Q5712540) (← links)
• Program Development in Computational Logic (Q5712541) (← links)
• Logic Based Program Synthesis and Transformation (Q5713935) (← links)
• (Q5740448) (← links)
• \(\exists\)-Universal termination of logic programs (Q5940923) (← links)
• Termination of logic programs: Transformational methods revisited (Q5941754) (← links)
• A general framework for automatic termination analysis od logic programs (Q5941755) (← links)