Pages that link to "Item:Q1308986"

The following pages link to Reasoning about termination of pure Prolog programs (Q1308986):

Displaying 13 items.

• Proving completeness of logic programs with the cut (Q511027) (← links)
• Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
• Norms on terms and their use in proving universal termination of a logic program (Q1318707) (← links)
• A declarative approach for first-order built-in's of Prolog (Q1328181) (← links)
• A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
• Generalized metrics and uniquely determined logic programs. (Q1427780) (← links)
• Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
• Some classes of Prolog programs inferable from positive data (Q1575466) (← links)
• Logic programs and connectionist networks (Q1884268) (← links)
• Logic programs, iterated function systems, and recurrent radial basis function networks (Q1884270) (← links)
• First-order theories for pure Prolog programs with negation (Q1892097) (← links)
• Totally correct logic program transformations via well-founded annotations (Q2271905) (← links)
• On Completeness of Logic Programs (Q2949713) (← links)