default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanny De Schreye
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[c74]Thomas Winters, Vincent Nys, Danny De Schreye:
Towards a General Framework for Humor Generation from Rated Examples. ICCC 2019: 274-281- 2018
- [c73]Thomas Winters
, Vincent Nys, Danny De Schreye:
Automatic Joke Generation: Learning Humor from Examples. HCI (22) 2018: 360-377 - [c72]Vincent Nys, Danny De Schreye:
Compiling Control as Offline Partial Deduction. LOPSTR 2018: 115-131 - [i13]Vincent Nys, Danny De Schreye:
Compiling Control as Offline Partial Deduction. CoRR abs/1808.05360 (2018) - 2017
- [j34]Vincent Nys, Danny De Schreye:
Abstract conjunctive partial deduction for the analysis and compilation of coroutines. Formal Aspects Comput. 29(1): 125-153 (2017) - [c71]Vincent Nys, Danny De Schreye:
Transforming Coroutining Logic Programs into Equivalent CHR Programs. VPT@ETAPS 2017: 9-35 - 2014
- [c70]Danny De Schreye, Vincent Nys, Colin J. Nicholson:
Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction. LOPSTR 2014: 21-38 - 2013
- [j33]Jon Sneyers, Danny De Schreye, Thom W. Frühwirth:
Probabilistic legal reasoning in CHRiSM. Theory Pract. Log. Program. 13(4-5): 769-781 (2013) - 2012
- [e3]Danny De Schreye, Gerda Janssens, Andy King:
Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012. ACM 2012, ISBN 978-1-4503-1522-7 [contents] - 2011
- [j32]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): 33-63 (2011) - [j31]Dean Voets, Danny De Schreye:
Non-termination analysis of logic programs with integer arithmetics. Theory Pract. Log. Program. 11(4-5): 521-536 (2011) - [c69]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: 231-239 - [c68]Paolo Pilozzi, Danny De Schreye:
Improved Termination Analysis of CHR Using Self-sustainability Analysis. LOPSTR 2011: 189-204 - [c67]Jon Sneyers, Danny De Schreye:
Probabilistic Termination of CHRiSM Programs. LOPSTR 2011: 221-236 - [i12]Dean Voets, Danny De Schreye:
Non-termination Analysis of Logic Programs with Integer arithmetics. CoRR abs/1109.3256 (2011) - 2010
- [c66]Dean Voets, Danny De Schreye:
Non-termination Analysis of Logic Programs Using Types. LOPSTR 2010: 133-148 - [e2]Danny De Schreye:
Logic-Based Program Synthesis and Transformation, 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers. Lecture Notes in Computer Science 6037, Springer 2010, ISBN 978-3-642-12591-1 [contents]
2000 – 2009
- 2009
- [j30]Yi-Dong Shen, Danny De Schreye, Dean Voets:
Termination prediction for general logic programs. Theory Pract. Log. Program. 9(6): 751-780 (2009) - [c65]Dean Voets, Danny De Schreye:
A New Approach to Non-termination Analysis of Logic Programs. ICLP 2009: 220-234 - [c64]Paolo Pilozzi, Danny De Schreye:
Proving Termination by Invariance Relations. ICLP 2009: 499-503 - [c63]Paolo Pilozzi, Danny De Schreye:
Automating Termination Proofs for CHR. ICLP 2009: 504-508 - [i11]Yi-Dong Shen, Danny De Schreye, Dean Voets:
Termination Prediction for General Logic Programs. CoRR abs/0905.2004 (2009) - [i10]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 abs/0912.4360 (2009) - 2008
- [c62]Paolo Pilozzi, Danny De Schreye:
Termination Analysis of CHR Revisited. ICLP 2008: 501-515 - 2007
- [c61]Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye:
Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22 - [i9]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 - 2006
- [c60]Manh Thang Nguyen, Danny De Schreye:
Polytool: Proving Termination Automatically Based on Polynomial Interpretations. LOPSTR 2006: 210-218 - [c59]Jon Sneyers, Joost Vennekens, Danny De Schreye:
Probabilistic-Logical Modeling of Music. PADL 2006: 60-72 - 2005
- [j29]Alexander Serebrenik, Danny De Schreye:
Termination of Floating-Point Computations. J. Autom. Reason. 34(2): 141-177 (2005) - [j28]Alexander Serebrenik, Danny De Schreye:
On termination of meta-programs. Theory Pract. Log. Program. 5(3): 355-390 (2005) - [c58]Manh Thang Nguyen, Danny De Schreye:
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. ICLP 2005: 311-325 - [i8]Yi-Dong Shen, Danny De Schreye:
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach. CoRR abs/cs/0512055 (2005) - 2004
- [j27]Alexander Serebrenik, Danny De Schreye:
Inference of termination conditions for numerical loops in Prolog. Theory Pract. Log. Program. 4(5-6): 719-751 (2004) - 2003
- [c57]Alexander Serebrenik, Danny De Schreye:
Proving Termination with Adornments. LOPSTR 2003: 108-109 - [c56]Alexander Serebrenik, Danny De Schreye:
Hasta-La-Vista: Termination Analyser for Logic Programs. WLPE 2003: 60-74 - 2002
- [c55]Danny De Schreye, Alexander Serebrenik:
Acceptability with General Orderings. Computational Logic: Logic Programming and Beyond 2002: 187-210 - [c54]Alexander Serebrenik, Danny De Schreye:
On Termination of Logic Programs with Floating Point Computations. SAS 2002: 151-164 - 2001
- [j26]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): 157-196 (2001) - [j25]Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas:
Termination proofs for logic programs with tabling. ACM Trans. Comput. Log. 2(1): 57-92 (2001) - [c53]Alexander Serebrenik, Danny De Schreye:
On Termination of Meta-Programs. LPAR 2001: 517-530 - [c52]Alexander Serebrenik, Danny De Schreye:
Inference of Termination Conditions for Numerical Loops in Prolog. LPAR 2001: 654-668 - [i7]Danny De Schreye, Alexander Serebrenik:
Acceptability with general orderings. CoRR cs.PL/0106052 (2001) - [i6]Alexander Serebrenik, Danny De Schreye:
Inference of termination conditions for numerical loops. CoRR cs.PL/0106053 (2001) - [i5]Alexander Serebrenik, Danny De Schreye:
Inference of termination conditions for numerical loops in Prolog. CoRR cs.PL/0110034 (2001) - [i4]Alexander Serebrenik, Danny De Schreye:
On termination of meta-programs. CoRR cs.PL/0110035 (2001) - 2000
- [j24]Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens:
Project Report on LP+: A Second Generation Logic Programming Language. AI Commun. 13(1): 13-18 (2000) - [j23]Sofie Verbaeten, Marc Denecker, Danny De Schreye:
Compositionality of Normal Open Logic Programs. J. Log. Program. 42(3): 151-183 (2000) - [j22]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): 265 (2000) - [c51]Alexander Serebrenik, Danny De Schreye:
Non-tranformational termination analysis of logic programs, based on general term-orderings. LOPSTR 2000 - [c50]Alexander Serebrenik, Danny De Schreye:
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. LOPSTR (LNCS 2042: Selected Papers) 2000: 69-85 - [i3]Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. CoRR cs.CL/0011034 (2000) - [i2]Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas:
Termination Proofs for Logic Programs with Tabling. CoRR cs.LO/0003045 (2000) - [i1]Alexander Serebrenik, Danny De Schreye:
Termination analysis of logic programs using acceptability with general term orders. CoRR cs.PL/0011025 (2000)
1990 – 1999
- 1999
- [j21]Wim Vanhoof, Danny De Schreye, Bern Martens:
Bottom-up Partial Deduction of Logic Programs. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [j20]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): 231-277 (1999) - [j19]Stefaan Decorte, Danny De Schreye, Henk Vandecasteele:
Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21(6): 1137-1195 (1999) - [c49]Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. CLIN 1999 - [c48]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: 163-178 - [c47]Sofie Verbaeten, Konstantinos Sagonas, Danny De Schreye:
Modular Termination Proofs for Prolog with Tabling. PPDP 1999: 342-359 - [p1]Danny De Schreye, Marc Denecker:
Assessment of Some Issues in CL-Theory and Program Development. The Logic Programming Paradigm 1999: 195-208 - [e1]Danny De Schreye:
Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 - December 4, 1999. MIT Press 1999, ISBN 0-262-54104-1 [contents] - 1998
- [j18]Michael Leuschel, Bern Martens, Danny De Schreye:
Some Achievements and Prospects in Partial Deduction. ACM Comput. Surv. 30(3es): 4 (1998) - [j17]Marc Denecker, Danny De Schreye:
SLDNFA: An Abductive Procedure for Abductive Logic Programs. J. Log. Program. 34(2): 111-167 (1998) - [j16]Michael Leuschel, Danny De Schreye:
Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. J. Log. Program. 36(2): 149-193 (1998) - [j15]Michael Leuschel, Danny De Schreye:
Constrained Partial Deduction and the Preservation of Characteristic Trees. New Gener. Comput. 16(3): 283-342 (1998) - [j14]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): 208-258 (1998) - [c46]Stefaan Decorte, Danny De Schreye:
Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. IJCSLP 1998: 235-249 - [c45]Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck:
Specialising the Other Way Arond. IJCSLP 1998: 279-293 - [c44]Wim Vanhoof, Danny De Schreye, Bern Martens:
Bottom-Up Specialisation of Logic Programs. LOPSTR 1998: 325-327 - [c43]Wim Vanhoof, Danny De Schreye, Bern Martens:
A Framework for Bottom Up Specialisation of Logic Programs. PLILP/ALP 1998: 54-72 - 1997
- [j13]Kristof Van Belleghem, Marc Denecker, Danny De Schreye:
On the Relation Between Situation Calculus and Event Calculus. J. Log. Program. 31(1-3): 3-37 (1997) - [c42]Stefaan Decorte, Danny De Schreye:
Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. ICLP 1997: 78-92 - [c41]Kristof Van Belleghem, Marc Denecker, Danny De Schreye:
A Strong Correspondence between Description Logics and Open Logic Programming. ICLP 1997: 346-360 - [c40]Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas:
Termination Analysis for Tabled Logic Programming. LOPSTR 1997: 111-127 - [c39]Sofie Verbaeten, Marc Denecker, Danny De Schreye:
Compositionality of Normal Open Logic Programs. ILPS 1997: 371-385 - [c38]Michael Leuschel, Danny De Schreye:
Constrained Partial Deduction. WLP 1997 - 1996
- [j12]Bern Martens, Danny De Schreye:
Automatic Finite Unfolding Using Well-Founded Measures. J. Log. Program. 28(2): 89-146 (1996) - [c37]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: 170-184 - [c36]Michael Leuschel, Danny De Schreye, D. Andre de Waal:
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. JICSLP 1996: 319-332 - [c35]Michael Leuschel, Danny De Schreye:
Logic Program Specialisation: How to Be More Specific (Abstract). LOPSTR 1996: 58 - [c34]Michael Leuschel, Danny De Schreye:
Logic Program Specialisation: How To Be More Specific. PLILP 1996: 137-151 - 1995
- [j11]Bern Martens, Danny De Schreye:
Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. J. Log. Program. 22(1): 47-99 (1995) - [j10]Marc Denecker, Danny De Schreye:
Representing Incomplete Knowledge in Abductive Logic Programming. J. Log. Comput. 5(5): 553-577 (1995) - [j9]Danny De Schreye, Kristof Verschaetse:
Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. New Gener. Comput. 13(2): 117-154 (1995) - [c33]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: 187-201 - [c32]Kristof Van Belleghem, Marc Denecker, Danny De Schreye:
Combining Situation Calculus and Event Calculus. ICLP 1995: 83-97 - [c31]Michael Leuschel, Danny De Schreye:
Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. PEPM 1995: 253-263 - [c30]Danny De Schreye, Michael Leuschel, Bern Martens:
Tutorial on Program Specialisation (Abstract). ILPS 1995: 615-616 - 1994
- [j8]Danny De Schreye, Stefaan Decorte:
Termination of Logic Programs: The Never-Ending Story. J. Log. Program. 19/20: 199-260 (1994) - [j7]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): 97-117 (1994) - [j6]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): 225-262 (1994) - [c29]Kristof Van Belleghem, Marc Denecker, Danny De Schreye:
Representing Continuous Change in the Abductive Event Calculus. ICLP 1994: 225-239 - [c28]Dmitri Boulanger, Danny De Schreye:
Compiling Control Revisited: A New Approach based upon Abstract Interpretation. ICLP 1994: 699-713 - [c27]Kristof Van Belleghem, Marc Denecker, Danny De Schreye:
The Abductive Event Calculus as a General Framework for Temporal Databases. ICTL 1994: 301-316 - [c26]Henk Vandecasteele, Danny De Schreye:
Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. LPAR 1994: 84-98 - 1993
- [c25]Bern Martens, Danny De Schreye:
Some Further Issues in Finite Unfolding (Abstract). LOPSTR 1993: 159-161 - [c24]Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye:
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE 1993: 39-51 - [c23]Marc Denecker, Danny De Schreye:
Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. LPNMR 1993: 365-379 - [c22]Marc Denecker, Danny De Schreye:
Representing Incomplete Knowledge in Abductive Logic Programming. ILPS 1993: 147-163 - [c21]Stefaan Decorte, Danny De Schreye, Massimo Fabris:
Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. ILPS 1993: 420-436 - 1992
- [j5]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. New Gener. Comput. 11(1): 47-79 (1992) - [c20]Danny De Schreye, Bern Martens:
A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. CNKBS 1992: 49-51 - [c19]Bern Martens, Danny De Schreye, Maurice Bruynooghe:
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS 1992: 473-480 - [c18]Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe:
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. FGCS 1992: 481-488 - [c17]Marc Denecker, Danny De Schreye:
On the Duality of Abduction and Model Generation. FGCS 1992: 650-657 - [c16]Bern Martens, Danny De Schreye:
A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. JICSLP 1992: 511-525 - [c15]Marc Denecker, Danny De Schreye:
SLDNFA: An Abductive Procedure for Normal Abductive Programs. JICSLP 1992: 686-700 - [c14]Kristof Verschaetse, Stefaan Decorte, Danny De Schreye:
Automatic Termination Analysis. LOPSTR 1992: 168-183 - [c13]Danny De Schreye, Kristof Verschaetse:
Tutorial on Termination of Logic Programs. META 1992: 70-88 - [c12]Danny De Schreye, Bern Martens:
A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation. META 1992: 192-204 - [c11]Kristof Verschaetse, Danny De Schreye:
Deriving of Linear Size Relations by Abstract Interpretation. PLILP 1992: 296-310 - 1991
- [j4]Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe:
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. J. Autom. Reason. 7(3): 337-358 (1991) - [c10]Kristof Verschaetse, Danny De Schreye:
Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. ICLP 1991: 301-315 - [c9]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. ISLP 1991: 117-131 - 1990
- [c8]Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe:
Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. ESOP 1990: 106-117 - [c7]Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe:
A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. ICLP 1990: 649-663 - [c6]Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe:
Generation and Compilation of Efficient Computation Rules. ICLP 1990: 700-714
1980 – 1989
- 1989
- [j3]Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse:
On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artif. Intell. 41(2): 237-248 (1989) - [j2]Maurice Bruynooghe, Danny De Schreye, Bruno Krekels:
Compiling Control. J. Log. Program. 6(1&2): 135-162 (1989) - [j1]Danny De Schreye, Maurice Bruynooghe:
On the Transformation of Logic Programs with Instantiation Based Computation Rules. J. Symb. Comput. 7(2): 125-154 (1989) - [c5]Maurice Bruynooghe, Danny De Schreye:
Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. AII 1989: 60-77 - [c4]Maurice Bruynooghe, Luc De Raedt, Danny De Schreye:
Explanation Based Program Transformation. IJCAI 1989: 407-412 - 1988
- [c3]Danny De Schreye, Maurice Bruynooghe:
The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. META 1988: 217-231 - [c2]Danny De Schreye, Maurice Bruynooghe:
An Application of Abstract Interpretation in Source Level Program Transformation. PLILP 1988: 35-57 - 1986
- [c1]Maurice Bruynooghe, Danny De Schreye, Bruno Krekels:
Compiling Control. SLP 1986: 70-77
Coauthor Index