The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. - Danny De Schreye; Maurice Bruynooghe (META, 1988)

An Application of Abstract Interpretation in Source Level Program Transformation. - Danny De Schreye; Maurice Bruynooghe (PLILP, 1988)

Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. - Maurice Bruynooghe; Danny De Schreye (AII, 1989)

Explanation Based Program Transformation. - Maurice Bruynooghe; Luc De Raedt; Danny De Schreye (IJCAI, 1989)

On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. - Danny De Schreye; Maurice Bruynooghe; Kristof Verschaetse (Artif. Intell., 1989)

Compiling Control. - Maurice Bruynooghe; Danny De Schreye; Bruno Krekels (J. Log. Program., 1989)

On the Transformation of Logic Programs with Instantiation Based Computation Rules. - Danny De Schreye; Maurice Bruynooghe (J. Symb. Comput., 1989)

Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. - Danny De Schreye; Dirk Pollet; Johan Ronsyn; Maurice Bruynooghe (ESOP, 1990)

A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. - Danny De Schreye; Kristof Verschaetse; Maurice Bruynooghe (ICLP, 1990)

Generation and Compilation of Efficient Computation Rules. - Kristof Verschaetse; Danny De Schreye; Maurice Bruynooghe (ICLP, 1990)

Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. - Kristof Verschaetse; Danny De Schreye (ICLP, 1991)

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. - Maurice Bruynooghe; Danny De Schreye; Bern Martens (ISLP, 1991)

Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. - Danny De Schreye; Bern Martens; Gunther Sablon; Maurice Bruynooghe (J. Autom. Reason., 1991)

A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. - Danny De Schreye; Bern Martens (CNKBS, 1992)

On the Duality of Abduction and Model Generation. - Marc Denecker; Danny De Schreye (FGCS, 1992)

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. - Bern Martens; Danny De Schreye; Maurice Bruynooghe (FGCS, 1992)

A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. - Danny De Schreye; Kristof Verschaetse; Maurice Bruynooghe (FGCS, 1992)

SLDNFA: An Abductive Procedure for Normal Abductive Programs. - Marc Denecker; Danny De Schreye (JICSLP, 1992)

A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. - Bern Martens; Danny De Schreye (JICSLP, 1992)

Automatic Termination Analysis. - Kristof Verschaetse; Stefaan Decorte; Danny De Schreye (LOPSTR, 1992)

Tutorial on Termination of Logic Programs. - Danny De Schreye; Kristof Verschaetse (META, 1992)

Deriving of Linear Size Relations by Abstract Interpretation. - Kristof Verschaetse; Danny De Schreye (PLILP, 1992)

A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. - Maurice Bruynooghe; Danny De Schreye; Bern Martens (New Gener. Comput., 1992)

Some Further Issues in Finite Unfolding (Abstract). - Bern Martens; Danny De Schreye (LOPSTR, 1993)

Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. - Dmitri Boulanger; Maurice Bruynooghe; Danny De Schreye (LPE, 1993)

Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. - Marc Denecker; Danny De Schreye (LPNMR, 1993)

Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. - Stefaan Decorte; Danny De Schreye; Massimo Fabris (ILPS, 1993)

Representing Continuous Change in the Abductive Event Calculus. - Kristof Van Belleghem; Marc Denecker; Danny De Schreye (ICLP, 1994)

Compiling Control Revisited: A New Approach based upon Abstract Interpretation. - Dmitri Boulanger; Danny De Schreye (ICLP, 1994)

The Abductive Event Calculus as a General Framework for Temporal Databases. - Kristof Van Belleghem; Marc Denecker; Danny De Schreye (ICTL, 1994)

Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. - Henk Vandecasteele; Danny De Schreye (LPAR, 1994)

Termination of Logic Programs: The Never-Ending Story. - Danny De Schreye; Stefaan Decorte (J. Log. Program., 1994)

On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. - Marc Denecker; Danny De Schreye (Theor. Comput. Sci., 1994)

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. - Bern Martens; Danny De Schreye; Tamás Horváth 001 (Theor. Comput. Sci., 1994)

Using Event Calculus for Protocol Specification: An Experiment. - Marc Denecker; Guy Duchatelet; Frank Piessens; Kristof Van Belleghem; Danny De Schreye (Deductive Databases / Abduction in Deductive Databases, 1995)

Combining Situation Calculus and Event Calculus. - Kristof Van Belleghem; Marc Denecker; Danny De Schreye (ICLP, 1995)

Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. - Michael Leuschel; Danny De Schreye (PEPM, 1995)

Tutorial on Program Specialisation (Abstract). - Danny De Schreye; Michael Leuschel; Bern Martens (ILPS, 1995)

Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. - Bern Martens; Danny De Schreye (J. Log. Program., 1995)

Representing Incomplete Knowledge in Abductive Logic Programming. - Marc Denecker; Danny De Schreye (J. Log. Comput., 1995)

Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. - Danny De Schreye; Kristof Verschaetse (New Gener. Comput., 1995)

A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. - Marc Denecker; Kristof Van Belleghem; Guy Duchatelet; Frank Piessens; Danny De Schreye (JICSLP, 1996)

A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. - Michael Leuschel; Danny De Schreye; D. Andre de Waal (JICSLP, 1996)

Logic Program Specialisation: How to Be More Specific (Abstract). - Michael Leuschel; Danny De Schreye (LOPSTR, 1996)

Logic Program Specialisation: How To Be More Specific. - Michael Leuschel; Danny De Schreye (PLILP, 1996)

Automatic Finite Unfolding Using Well-Founded Measures. - Bern Martens; Danny De Schreye (J. Log. Program., 1996)

A Strong Correspondence between Description Logics and Open Logic Programming. - Kristof Van Belleghem; Marc Denecker; Danny De Schreye (ICLP, 1997)

Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. - Stefaan Decorte; Danny De Schreye (ICLP, 1997)

Termination Analysis for Tabled Logic Programming. - Stefaan Decorte; Danny De Schreye; Michael Leuschel; Bern Martens; Konstantinos Sagonas (LOPSTR, 1997)

Constrained Partial Deduction. - Michael Leuschel; Danny De Schreye (WLP, 1997)

On the Relation Between Situation Calculus and Event Calculus. - Kristof Van Belleghem; Marc Denecker; Danny De Schreye (J. Log. Program., 1997)

Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. - Stefaan Decorte; Danny De Schreye (IJCSLP, 1998)

Specialising the Other Way Arond. - Wim Vanhoof; Bern Martens; Danny De Schreye; Karel De Vlaminck (IJCSLP, 1998)

Bottom-Up Specialisation of Logic Programs. - Wim Vanhoof; Danny De Schreye; Bern Martens (LOPSTR, 1998)

A Framework for Bottom Up Specialisation of Logic Programs. - Wim Vanhoof; Danny De Schreye; Bern Martens (PLILP/ALP, 1998)

Some Achievements and Prospects in Partial Deduction. - Michael Leuschel; Bern Martens; Danny De Schreye (ACM Comput. Surv., 1998)

SLDNFA: An Abductive Procedure for Abductive Logic Programs. - Marc Denecker; Danny De Schreye (J. Log. Program., 1998)

Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. - Michael Leuschel; Danny De Schreye (J. Log. Program., 1998)

Constrained Partial Deduction and the Preservation of Characteristic Trees. - Michael Leuschel; Danny De Schreye (New Gener. Comput., 1998)

Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. - Michael Leuschel; Bern Martens; Danny De Schreye (ACM Trans. Program. Lang. Syst., 1998)

Assessment of Some Issues in CL-Theory and Program Development. - Danny De Schreye; Marc Denecker (The Logic Programming Paradigm, 1999)

Semantic interpretation of temporal information by abductive inference. - Sven Verdoolaege; Marc Denecker; Ness Schelkens; Danny De Schreye; Frank Van Eynde (CLIN, 1999)

Termination Analysis of Tabled Logic Programs Using Mode and Type Information. - Sofie Verbaeten; Danny De Schreye (Fuji International Symposium on Functional and Logic Programming, 1999)

Modular Termination Proofs for Prolog with Tabling. - Sofie Verbaeten; Konstantinos Sagonas; Danny De Schreye (PPDP, 1999)

Bottom-up Partial Deduction of Logic Programs - Wim Vanhoof; Danny De Schreye; Bern Martens (J. Funct. Log. Program., 1999)

Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. - Danny De Schreye; Robert Glück; Jesper Jørgensen; Michael Leuschel; Bern Martens; Morten Heine Sørensen (J. Log. Program., 1999)

Constraint-based termination analysis of logic programs. - Stefaan Decorte; Danny De Schreye; Henk Vandecasteele (ACM Trans. Program. Lang. Syst., 1999)

Non-tranformational termination analysis of logic programs, based on general term-orderings. - Alexander Serebrenik; Danny De Schreye (LOPSTR, 2000)

Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. - Alexander Serebrenik; Danny De Schreye (LOPSTR (LNCS 2042: Selected Papers), 2000)

Project Report on LP+: A Second Generation Logic Programming Language. - Danny De Schreye; Maurice Bruynooghe; Bart Demoen; Marc Denecker; Gerda Janssens; Bern Martens (AI Commun., 2000)

Termination analysis of logic programs using acceptability with general term orders - Alexander Serebrenik; Danny De Schreye (CoRR, 2000)

Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". - Danny De Schreye; Robert Glück; Jesper Jørgensen; Michael Leuschel; Bern Martens; Morten Heine Sørensen (J. Log. Program., 2000)

Compositionality of Normal Open Logic Programs. - Sofie Verbaeten; Marc Denecker; Danny De Schreye (J. Log. Program., 2000)

Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. - Sofie Verbaeten; Danny De Schreye (Appl. Algebra Eng. Commun. Comput., 2001)

Inference of termination conditions for numerical loops - Alexander Serebrenik; Danny De Schreye (CoRR, 2001)

Termination proofs for logic programs with tabling. - Sofie Verbaeten; Danny De Schreye; Konstantinos Sagonas (ACM Trans. Comput. Log., 2001)

Acceptability with General Orderings. - Danny De Schreye; Alexander Serebrenik (Computational Logic: Logic Programming and Beyond, 2002)

On Termination of Logic Programs with Floating Point Computations. - Alexander Serebrenik; Danny De Schreye (SAS, 2002)

Proving Termination with Adornments. - Alexander Serebrenik; Danny De Schreye (LOPSTR, 2003)

Hasta-La-Vista: Termination Analyser for Logic Programs. - Alexander Serebrenik; Danny De Schreye (WLPE, 2003)

Inference of termination conditions for numerical loops in Prolog. - Alexander Serebrenik; Danny De Schreye (Theory Pract. Log. Program., 2004)

Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. - Manh Thang Nguyen; Danny De Schreye (ICLP, 2005)

Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach - Yi-Dong Shen; Danny De Schreye (CoRR, 2005)

Termination of Floating-Point Computations. - Alexander Serebrenik; Danny De Schreye (J. Autom. Reason., 2005)

On termination of meta-programs. - Alexander Serebrenik; Danny De Schreye (Theory Pract. Log. Program., 2005)

Polytool: Proving Termination Automatically Based on Polynomial Interpretations. - Manh Thang Nguyen; Danny De Schreye (LOPSTR, 2006)

Probabilistic-Logical Modeling of Music. - Jon Sneyers; Joost Vennekens; Danny De Schreye (PADL, 2006)

Termination of Programs using Term Rewriting and SAT Solving. - Jürgen Giesl; Peter Schneider-Kamp; René Thiemann; Stephan Swiderski; Manh Thang Nguyen; Danny De Schreye; Alexander Serebrenik (Deduction and Decision Procedures, 2007)

Termination Analysis of Logic Programs Based on Dependency Graphs. - Manh Thang Nguyen; Jürgen Giesl; Peter Schneider-Kamp; Danny De Schreye (LOPSTR, 2007)

Termination Analysis of CHR Revisited. - Paolo Pilozzi; Danny De Schreye (ICLP, 2008)

Proving Termination by Invariance Relations. - Paolo Pilozzi; Danny De Schreye (ICLP, 2009)

Automating Termination Proofs for CHR. - Paolo Pilozzi; Danny De Schreye (ICLP, 2009)

A New Approach to Non-termination Analysis of Logic Programs. - Dean Voets; Danny De Schreye (ICLP, 2009)

Termination prediction for general logic programs. - Yi-Dong Shen; Danny De Schreye; Dean Voets (Theory Pract. Log. Program., 2009)

Non-termination Analysis of Logic Programs Using Types. - Dean Voets; Danny De Schreye (LOPSTR, 2010)

Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise. - Colin J. Nicholson; Danny De Schreye; Jon Sneyers (ICLP (Technical Communications), 2011)

Improved Termination Analysis of CHR Using Self-sustainability Analysis. - Paolo Pilozzi; Danny De Schreye (LOPSTR, 2011)

Probabilistic Termination of CHRiSM Programs. - Jon Sneyers; Danny De Schreye (LOPSTR, 2011)

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. - Manh Thang Nguyen; Danny De Schreye; Jürgen Giesl; Peter Schneider-Kamp (Theory Pract. Log. Program., 2011)

Non-termination analysis of logic programs with integer arithmetics. - Dean Voets; Danny De Schreye (Theory Pract. Log. Program., 2011)

Probabilistic legal reasoning in CHRiSM. - Jon Sneyers; Danny De Schreye; Thom W. Frühwirth (Theory Pract. Log. Program., 2013)

Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction. - Danny De Schreye; Vincent Nys; Colin J. Nicholson (LOPSTR, 2014)

Transforming Coroutining Logic Programs into Equivalent CHR Programs. - Vincent Nys; Danny De Schreye (VPT@ETAPS, 2017)

Abstract conjunctive partial deduction for the analysis and compilation of coroutines. - Vincent Nys; Danny De Schreye (Formal Aspects Comput., 2017)

Automatic Joke Generation: Learning Humor from Examples. - Thomas Winters; Vincent Nys; Danny De Schreye (HCI (22), 2018)

Compiling Control as Offline Partial Deduction. - Vincent Nys; Danny De Schreye (LOPSTR, 2018)

Towards a General Framework for Humor Generation from Rated Examples. - Thomas Winters; Vincent Nys; Danny De Schreye (ICCC, 2019)