The following pages link to Danny De Schreye (Q199253):
Displaying 19 items.
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
- (Q582147) (redirect page) (← links)
- On the existence of nonterminating queries for a restricted class of PROLOG-clauses (Q582150) (← links)
- Compiling bottom-up and mixed derivations into top-down executable logic programs (Q809591) (← links)
- Termination of floating-point computations (Q850498) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- On the duality of abduction and model generation in a framework for model generation with equality (Q1314425) (← links)
- (Q2766778) (← links)
- Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (Q2949697) (← links)
- On Termination of Meta-programs (Q2996191) (← links)
- Inference of Termination Conditions for Numerical Loops in Prolog (Q2996199) (← links)
- Non-termination Analysis of Logic Programs Using Types (Q3003491) (← links)
- Non-termination analysis of logic programs with integer arithmetics (Q3087440) (← links)
- <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs (Q3087808) (← links)
- Automatic finite unfolding using well-founded measures (Q3129508) (← links)
- On termination of meta-programs (Q3370573) (← links)
- Representing Incomplete Knowledge in Abductive Logic Programming (Q4849644) (← links)
