Pages that link to "Item:Q4305628"
From MaRDI portal
The following pages link to Termination of logic programs: the never-ending story (Q4305628):
Displayed 23 items.
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Non-termination Analysis of Logic Programs Using Types (Q3003491) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- Non-termination analysis of logic programs with integer arithmetics (Q3087440) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- Termination of constraint logic programs (Q4572011) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- Precise complexity guarantees for pointer analysis via Datalog with extensions (Q4593068) (← links)
- Termination analysis for partial functions (Q5030190) (← links)
- Verification of logic programs with delay declarations (Q5096380) (← links)
- Localized Operational Termination in General Logics (Q5256340) (← links)
- Proving Termination by Invariance Relations (Q5325774) (← links)
- Computable Functions in ASP: Theory and Implementation (Q5504670) (← links)
- Termination Analysis of CHR Revisited (Q5504676) (← links)
- \(\exists\)-Universal termination of logic programs (Q5940923) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)