Pages that link to "Item:Q4719375"

The following pages link to A semantic basis for the termination analysis of logic programs (Q4719375):

Displaying 21 items.

• Proving termination of nonlinear command sequences (Q470005) (← links)
• A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
• Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
• Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
• Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
• Termination of narrowing via termination of rewriting (Q969619) (← links)
• A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
• Fast offline partial evaluation of logic programs (Q2437798) (← links)
• (Q2766778) (← links)
• A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
• Automated termination analysis for logic programs with cut (Q3585154) (← links)
• Analysis of Linear Hybrid Systems in CLP (Q3617430) (← links)
• Fast Offline Partial Evaluation of Large Logic Programs (Q3617434) (← links)
• All-Termination(T) (Q3617771) (← links)
• A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
• (Q4779112) (← links)
• Localized Operational Termination in General Logics (Q5256340) (← links)
• Correctness and Completeness of Logic Programs (Q5277919) (← links)
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)