The following pages link to Danny De Schreye (Q199253):
Displaying 50 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)
- (Q3490929) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- Compiling control (Q3821563) (← links)
- SLDNFA: An abductive procedure for abductive logic programs (Q3841101) (← links)
- (Q4217937) (← links)
- Creating specialised integrity checks through partial evaluation of meta-interpreters (Q4223470) (← links)
- Termination of logic programs: the never-ending story (Q4305628) (← links)
- Why untyped nonground metaprogramming is not (much of) a problem (Q4327412) (← links)
- On the relation between situation calculus and event calculus (Q4352527) (← links)
- (Q4411956) (← links)
- (Q4421872) (← links)
- (Q4494370) (← links)
- (Q4506395) (← links)
- (Q4518430) (← links)
- A New Approach to Non-termination Analysis of Logic Programs (Q4649732) (← links)
- Inference of termination conditions for numerical loops in Prolog (Q4669655) (← links)
- (Q4707739) (← links)
- Representing Incomplete Knowledge in Abductive Logic Programming (Q4849644) (← links)
- Improved Termination Analysis of CHR Using Self-sustainability Analysis (Q4909324) (← links)
- Probabilistic Termination of CHRiSM Programs (Q4909326) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- (Q4940939) (← links)
- Compositionality of normal open logic programs (Q4943434) (← links)
- (Q4944879) (← links)
- (Q4944882) (← links)
- Proving Termination by Invariance Relations (Q5325774) (← links)
- Automating Termination Proofs for CHR (Q5325775) (← links)
- Probabilistic legal reasoning in CHRiSM (Q5398310) (← links)
- Logic Programming (Q5475786) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Termination Analysis of CHR Revisited (Q5504676) (← links)
- (Q5688889) (← links)
