Pages that link to "Item:Q1188722"

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

Displaying 8 items.

• Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
• A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← 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)