Pages that link to "Item:Q1177923"

The following pages link to An analysis of loop checking mechanisms for logic programs (Q1177923):

Displaying 14 items.

• Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
• Generalizing completeness results for loop checks in logic programming (Q1199926) (← links)
• Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
• Explanations as programs in probabilistic logic programming (Q2163172) (← links)
• Deciding the Bisimilarity Relation between Datalog Goals (Q2915060) (← links)
• A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
• Termination prediction for general logic programs (Q3648357) (← links)
• A metalogic programming approach: language, semantics and applications (Q4305334) (← links)
• Knowledge base dynamics, abduction, and database updates (Q4835515) (← links)
• Detecting non-provable goals (Q5210774) (← links)
• A practical analysis of non-termination in large logic programs (Q5398306) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)