Danny De Schreye

ORCID

Publication Activity (10 Years)

Years Active: 1986-2019
Publications (10 Years): 6

Top Venues

LOPSTR

CoRR

Formal Aspects Comput.

VPT@ETAPS

Publications

Thomas Winters, Vincent Nys, Danny De Schreye
Towards a General Framework for Humor Generation from Rated Examples. ICCC (2019)
Thomas Winters, Vincent Nys, Danny De Schreye
Automatic Joke Generation: Learning Humor from Examples. HCI (22) (2018)
Vincent Nys, Danny De Schreye
Compiling Control as Offline Partial Deduction. LOPSTR (2018)
Vincent Nys, Danny De Schreye
Compiling Control as Offline Partial Deduction. CoRR (2018)
Vincent Nys, Danny De Schreye
Transforming Coroutining Logic Programs into Equivalent CHR Programs. VPT@ETAPS (2017)
Vincent Nys, Danny De Schreye
Abstract conjunctive partial deduction for the analysis and compilation of coroutines. Formal Aspects Comput. 29 (1) (2017)
Danny De Schreye, Vincent Nys, Colin J. Nicholson
Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction. LOPSTR (2014)
Jon Sneyers, Danny De Schreye, Thom W. Frühwirth
Probabilistic legal reasoning in CHRiSM. Theory Pract. Log. Program. 13 (4-5) (2013)
Dean Voets, Danny De Schreye
Non-termination Analysis of Logic Programs with Integer arithmetics CoRR (2011)
Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. Theory Pract. Log. Program. 11 (1) (2011)
Paolo Pilozzi, Danny De Schreye
Improved Termination Analysis of CHR Using Self-sustainability Analysis. LOPSTR (2011)
Jon Sneyers, Danny De Schreye
Probabilistic Termination of CHRiSM Programs. LOPSTR (2011)
Dean Voets, Danny De Schreye
Non-termination analysis of logic programs with integer arithmetics. Theory Pract. Log. Program. 11 (4-5) (2011)
Colin J. Nicholson, Danny De Schreye, Jon Sneyers
Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise. ICLP (Technical Communications) (2011)
Dean Voets, Danny De Schreye
Non-termination Analysis of Logic Programs Using Types. LOPSTR (2010)
Yi-Dong Shen, Danny De Schreye, Dean Voets
Termination prediction for general logic programs. Theory Pract. Log. Program. 9 (6) (2009)
Paolo Pilozzi, Danny De Schreye
Proving Termination by Invariance Relations. ICLP (2009)
Yi-Dong Shen, Danny De Schreye, Dean Voets
Termination Prediction for General Logic Programs CoRR (2009)
Paolo Pilozzi, Danny De Schreye
Automating Termination Proofs for CHR. ICLP (2009)
Dean Voets, Danny De Schreye
A New Approach to Non-termination Analysis of Logic Programs. ICLP (2009)
Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
Polytool: polynomial interpretations as a basis for termination analysis of Logic programs CoRR (2009)
Paolo Pilozzi, Danny De Schreye
Termination Analysis of CHR Revisited. ICLP (2008)
Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye
Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR (2007)
Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik
Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures (2007)
Manh Thang Nguyen, Danny De Schreye
Polytool: Proving Termination Automatically Based on Polynomial Interpretations. LOPSTR (2006)
Jon Sneyers, Joost Vennekens, Danny De Schreye
Probabilistic-Logical Modeling of Music. PADL (2006)
Alexander Serebrenik, Danny De Schreye
Termination of Floating-Point Computations. J. Autom. Reason. 34 (2) (2005)
Yi-Dong Shen, Danny De Schreye
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach CoRR (2005)
Manh Thang Nguyen, Danny De Schreye
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. ICLP (2005)
Alexander Serebrenik, Danny De Schreye
On termination of meta-programs. Theory Pract. Log. Program. 5 (3) (2005)
Alexander Serebrenik, Danny De Schreye
Inference of termination conditions for numerical loops in Prolog. Theory Pract. Log. Program. 4 (5-6) (2004)
Alexander Serebrenik, Danny De Schreye
Hasta-La-Vista: Termination Analyser for Logic Programs. WLPE (2003)
Alexander Serebrenik, Danny De Schreye
Proving Termination with Adornments. LOPSTR (2003)
Alexander Serebrenik, Danny De Schreye
On Termination of Logic Programs with Floating Point Computations. SAS (2002)
Danny De Schreye, Alexander Serebrenik
Acceptability with General Orderings. Computational Logic: Logic Programming and Beyond (2002)
Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
Termination proofs for logic programs with tabling. ACM Trans. Comput. Log. 2 (1) (2001)
Alexander Serebrenik, Danny De Schreye
On Termination of Meta-Programs. LPAR (2001)
Alexander Serebrenik, Danny De Schreye
Inference of Termination Conditions for Numerical Loops in Prolog. LPAR (2001)
Alexander Serebrenik, Danny De Schreye
On termination of meta-programs CoRR (2001)
Sofie Verbaeten, Danny De Schreye
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. Appl. Algebra Eng. Commun. Comput. 12 (1/2) (2001)
Danny De Schreye, Alexander Serebrenik
Acceptability with general orderings CoRR (2001)
Alexander Serebrenik, Danny De Schreye
Inference of termination conditions for numerical loops CoRR (2001)
Alexander Serebrenik, Danny De Schreye
Inference of termination conditions for numerical loops in Prolog CoRR (2001)
Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
Termination Proofs for Logic Programs with Tabling CoRR (2000)
Sofie Verbaeten, Marc Denecker, Danny De Schreye
Compositionality of Normal Open Logic Programs. J. Log. Program. 42 (3) (2000)
Alexander Serebrenik, Danny De Schreye
Non-tranformational termination analysis of logic programs, based on general term-orderings. LOPSTR (2000)
Alexander Serebrenik, Danny De Schreye
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. LOPSTR (LNCS 2042: Selected Papers) (2000)
Alexander Serebrenik, Danny De Schreye
Termination analysis of logic programs using acceptability with general term orders CoRR (2000)
Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". J. Log. Program. 43 (3) (2000)
Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
Semantic interpretation of temporal information by abductive inference CoRR (2000)
Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens
: A Second Generation Logic Programming Language. AI Commun. 13 (1) (2000)
Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. J. Log. Program. 41 (2-3) (1999)
Stefaan Decorte, Danny De Schreye, Henk Vandecasteele
Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21 (6) (1999)
Sofie Verbaeten, Danny De Schreye
Termination Analysis of Tabled Logic Programs Using Mode and Type Information. Fuji International Symposium on Functional and Logic Programming (1999)
Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
Semantic interpretation of temporal information by abductive inference. CLIN (1999)
Wim Vanhoof, Danny De Schreye, Bern Martens
Bottom-up Partial Deduction of Logic Programs J. Funct. Log. Program. 1999 (Special Issue 2) (1999)
Sofie Verbaeten, Konstantinos Sagonas, Danny De Schreye
Modular Termination Proofs for Prolog with Tabling. PPDP (1999)
Michael Leuschel, Bern Martens, Danny De Schreye
Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. ACM Trans. Program. Lang. Syst. 20 (1) (1998)
Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck
Specialising the Other Way Arond. IJCSLP (1998)
Marc Denecker, Danny De Schreye
SLDNFA: An Abductive Procedure for Abductive Logic Programs. J. Log. Program. 34 (2) (1998)
Stefaan Decorte, Danny De Schreye
Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. IJCSLP (1998)
Michael Leuschel, Bern Martens, Danny De Schreye
Some Achievements and Prospects in Partial Deduction. ACM Comput. Surv. 30 (3es) (1998)
Michael Leuschel, Danny De Schreye
Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. J. Log. Program. 36 (2) (1998)
Wim Vanhoof, Danny De Schreye, Bern Martens
Bottom-Up Specialisation of Logic Programs. LOPSTR (1998)
Wim Vanhoof, Danny De Schreye, Bern Martens
A Framework for Bottom Up Specialisation of Logic Programs. PLILP/ALP (1998)
Michael Leuschel, Danny De Schreye
Constrained Partial Deduction and the Preservation of Characteristic Trees. New Gener. Comput. 16 (3) (1998)
Michael Leuschel, Danny De Schreye
Constrained Partial Deduction. WLP (1997)
Kristof Van Belleghem, Marc Denecker, Danny De Schreye
A Strong Correspondence between Description Logics and Open Logic Programming. ICLP (1997)
Stefaan Decorte, Danny De Schreye
Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. ICLP (1997)
Sofie Verbaeten, Marc Denecker, Danny De Schreye
Compositionality of Normal Open Logic Programs. ILPS (1997)
Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas
Termination Analysis for Tabled Logic Programming. LOPSTR (1997)
Kristof Van Belleghem, Marc Denecker, Danny De Schreye
On the Relation Between Situation Calculus and Event Calculus. J. Log. Program. 31 (1-3) (1997)
Michael Leuschel, Danny De Schreye
Logic Program Specialisation: How to Be More Specific (Abstract). LOPSTR (1996)
Michael Leuschel, Danny De Schreye
Logic Program Specialisation: How To Be More Specific. PLILP (1996)
Michael Leuschel, Danny De Schreye, D. Andre de Waal
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. JICSLP (1996)
Marc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, Danny De Schreye
A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. JICSLP (1996)
Bern Martens, Danny De Schreye
Automatic Finite Unfolding Using Well-Founded Measures. J. Log. Program. 28 (2) (1996)
Bern Martens, Danny De Schreye
Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. J. Log. Program. 22 (1) (1995)
Danny De Schreye, Michael Leuschel, Bern Martens
Tutorial on Program Specialisation (Abstract). ILPS (1995)
Marc Denecker, Guy Duchatelet, Frank Piessens, Kristof Van Belleghem, Danny De Schreye
Using Event Calculus for Protocol Specification: An Experiment. Deductive Databases / Abduction in Deductive Databases (1995)
Michael Leuschel, Danny De Schreye
Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. PEPM (1995)
Danny De Schreye, Kristof Verschaetse
Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. New Gener. Comput. 13 (2) (1995)
Kristof Van Belleghem, Marc Denecker, Danny De Schreye
Combining Situation Calculus and Event Calculus. ICLP (1995)
Marc Denecker, Danny De Schreye
Representing Incomplete Knowledge in Abductive Logic Programming. J. Log. Comput. 5 (5) (1995)
Henk Vandecasteele, Danny De Schreye
Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. LPAR (1994)
Danny De Schreye, Stefaan Decorte
Termination of Logic Programs: The Never-Ending Story. J. Log. Program. (1994)
Bern Martens, Danny De Schreye, Tamás Horváth
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Theor. Comput. Sci. 122 (1&2) (1994)
Kristof Van Belleghem, Marc Denecker, Danny De Schreye
Representing Continuous Change in the Abductive Event Calculus. ICLP (1994)
Kristof Van Belleghem, Marc Denecker, Danny De Schreye
The Abductive Event Calculus as a General Framework for Temporal Databases. ICTL (1994)
Marc Denecker, Danny De Schreye
On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. Theor. Comput. Sci. 122 (1&2) (1994)
Dmitri Boulanger, Danny De Schreye
Compiling Control Revisited: A New Approach based upon Abstract Interpretation. ICLP (1994)
Stefaan Decorte, Danny De Schreye, Massimo Fabris
Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. ILPS (1993)
Marc Denecker, Danny De Schreye
Representing Incomplete Knowledge in Abductive Logic Programming. ILPS (1993)
Marc Denecker, Danny De Schreye
Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. LPNMR (1993)
Bern Martens, Danny De Schreye
Some Further Issues in Finite Unfolding (Abstract). LOPSTR (1993)
Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE (1993)
Marc Denecker, Danny De Schreye
SLDNFA: An Abductive Procedure for Normal Abductive Programs. JICSLP (1992)
Kristof Verschaetse, Stefaan Decorte, Danny De Schreye
Automatic Termination Analysis. LOPSTR (1992)
Bern Martens, Danny De Schreye, Maurice Bruynooghe
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS (1992)
Danny De Schreye, Kristof Verschaetse
Tutorial on Termination of Logic Programs. META (1992)

Danny De Schreye.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Danny De Schreye