Pages that link to "Item:Q1318707"

The following pages link to Norms on terms and their use in proving universal termination of a logic program (Q1318707):

Displaying 5 items.

• Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
• A decidable subclass of finitary programs (Q3585163) (← links)
• Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Computable Functions in ASP: Theory and Implementation (Q5504670) (← links)