Danny De Schreye

125 papers A* 1A 1B 19C 20Journal 46Unranked 37

Year	Rank	Type	Title / Venue / Authors
2019	C	`conf`	Towards a General Framework for Humor Generation from Rated Examples. ICCC Thomas Winters, Vincent Nys, Danny De Schreye
2018	—	`conf`	Automatic Joke Generation: Learning Humor from Examples. HCI (22) Thomas Winters, Vincent Nys, Danny De Schreye
2018	C	`conf`	Compiling Control as Offline Partial Deduction. LOPSTR Vincent Nys, Danny De Schreye
2018	J	`jnl`	Compiling Control as Offline Partial Deduction. CoRR Vincent Nys, Danny De Schreye
2017	J	`jnl`	Abstract conjunctive partial deduction for the analysis and compilation of coroutines. Formal Aspects Comput. Vincent Nys, Danny De Schreye
2017	—	`conf`	Transforming Coroutining Logic Programs into Equivalent CHR Programs. VPT@ETAPS Vincent Nys, Danny De Schreye
2014	C	`conf`	Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction. LOPSTR Danny De Schreye, Vincent Nys, Colin J. Nicholson
2013	J	`jnl`	Probabilistic legal reasoning in CHRiSM. Theory Pract. Log. Program. Jon Sneyers, Danny De Schreye, Thom W. Frühwirth
2012	C	`ed.`	Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012 PPDP Danny De Schreye, Gerda Janssens, Andy King
2011	C	`conf`	Improved Termination Analysis of CHR Using Self-sustainability Analysis. LOPSTR Paolo Pilozzi, Danny De Schreye
2011	—	`conf`	Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise. ICLP (Technical Communications) Colin J. Nicholson, Danny De Schreye, Jon Sneyers
2011	J	`jnl`	Non-termination Analysis of Logic Programs with Integer arithmetics CoRR Dean Voets, Danny De Schreye
2011	J	`jnl`	Non-termination analysis of logic programs with integer arithmetics. Theory Pract. Log. Program. Dean Voets, Danny De Schreye
2011	J	`jnl`	Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. Theory Pract. Log. Program. Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
2011	C	`conf`	Probabilistic Termination of CHRiSM Programs. LOPSTR Jon Sneyers, Danny De Schreye
2010	C	`ed.`	Logic-Based Program Synthesis and Transformation, 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers LOPSTR Danny De Schreye
2010	C	`conf`	Non-termination Analysis of Logic Programs Using Types. LOPSTR Dean Voets, Danny De Schreye
2009	B	`conf`	A New Approach to Non-termination Analysis of Logic Programs. ICLP Dean Voets, Danny De Schreye
2009	B	`conf`	Automating Termination Proofs for CHR. ICLP Paolo Pilozzi, Danny De Schreye
2009	J	`jnl`	Polytool: polynomial interpretations as a basis for termination analysis of Logic programs CoRR Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
2009	B	`conf`	Proving Termination by Invariance Relations. ICLP Paolo Pilozzi, Danny De Schreye
2009	J	`jnl`	Termination Prediction for General Logic Programs CoRR Yi-Dong Shen, Danny De Schreye, Dean Voets
2009	J	`jnl`	Termination prediction for general logic programs. Theory Pract. Log. Program. Yi-Dong Shen, Danny De Schreye, Dean Voets
2008	B	`conf`	Termination Analysis of CHR Revisited. ICLP Paolo Pilozzi, Danny De Schreye
2007	C	`conf`	Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye
2007	—	`conf`	Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik
2006	C	`conf`	Polytool: Proving Termination Automatically Based on Polynomial Interpretations. LOPSTR Manh Thang Nguyen, Danny De Schreye
2006	C	`conf`	Probabilistic-Logical Modeling of Music. PADL Jon Sneyers, Joost Vennekens, Danny De Schreye
2005	J	`jnl`	On termination of meta-programs. Theory Pract. Log. Program. Alexander Serebrenik, Danny De Schreye
2005	B	`conf`	Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. ICLP Manh Thang Nguyen, Danny De Schreye
2005	J	`jnl`	Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach CoRR Yi-Dong Shen, Danny De Schreye
2005	J	`jnl`	Termination of Floating-Point Computations. J. Autom. Reason. Alexander Serebrenik, Danny De Schreye
2004	J	`jnl`	Inference of termination conditions for numerical loops in Prolog. Theory Pract. Log. Program. Alexander Serebrenik, Danny De Schreye
2003	—	`conf`	Hasta-La-Vista: Termination Analyser for Logic Programs. WLPE Alexander Serebrenik, Danny De Schreye
2003	C	`conf`	Proving Termination with Adornments. LOPSTR Alexander Serebrenik, Danny De Schreye
2002	—	`conf`	Acceptability with General Orderings. Computational Logic: Logic Programming and Beyond Danny De Schreye, Alexander Serebrenik
2002	B	`conf`	On Termination of Logic Programs with Floating Point Computations. SAS Alexander Serebrenik, Danny De Schreye
2001	J	`jnl`	Acceptability with general orderings CoRR Danny De Schreye, Alexander Serebrenik
2001	B	`conf`	Inference of Termination Conditions for Numerical Loops in Prolog. LPAR Alexander Serebrenik, Danny De Schreye
2001	J	`jnl`	Inference of termination conditions for numerical loops CoRR Alexander Serebrenik, Danny De Schreye
2001	J	`jnl`	Inference of termination conditions for numerical loops in Prolog CoRR Alexander Serebrenik, Danny De Schreye
2001	B	`conf`	On Termination of Meta-Programs. LPAR Alexander Serebrenik, Danny De Schreye
2001	J	`jnl`	On termination of meta-programs CoRR Alexander Serebrenik, Danny De Schreye
2001	J	`jnl`	Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. Appl. Algebra Eng. Commun. Comput. Sofie Verbaeten, Danny De Schreye
2001	J	`jnl`	Termination proofs for logic programs with tabling. ACM Trans. Comput. Log. Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
2000	J	`jnl`	Compositionality of Normal Open Logic Programs. J. Log. Program. Sofie Verbaeten, Marc Denecker, Danny De Schreye
2000	J	`jnl`	Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". J. Log. Program. Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
2000	C	`conf`	Non-tranformational termination analysis of logic programs, based on general term-orderings. LOPSTR Alexander Serebrenik, Danny De Schreye
2000	—	`conf`	Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. LOPSTR (LNCS 2042: Selected Papers) Alexander Serebrenik, Danny De Schreye
2000	J	`jnl`	Project Report on LP AI Commun. Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens
2000	J	`jnl`	Semantic interpretation of temporal information by abductive inference CoRR Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
2000	J	`jnl`	Termination Proofs for Logic Programs with Tabling CoRR Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
2000	J	`jnl`	Termination analysis of logic programs using acceptability with general term orders CoRR Alexander Serebrenik, Danny De Schreye
1999	—	`ch.`	Assessment of Some Issues in CL-Theory and Program Development. The Logic Programming Paradigm Danny De Schreye, Marc Denecker
1999	J	`jnl`	Bottom-up Partial Deduction of Logic Programs J. Funct. Log. Program. Wim Vanhoof, Danny De Schreye, Bern Martens
1999	J	`jnl`	Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. J. Log. Program. Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
1999	J	`jnl`	Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. Stefaan Decorte, Danny De Schreye, Henk Vandecasteele
1999	B	`ed.`	Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 - December 4, 1999 ICLP Danny De Schreye
1999	C	`conf`	Modular Termination Proofs for Prolog with Tabling. PPDP Sofie Verbaeten, Konstantinos Sagonas, Danny De Schreye
1999	—	`conf`	Semantic interpretation of temporal information by abductive inference. CLIN Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
1999	—	`conf`	Termination Analysis of Tabled Logic Programs Using Mode and Type Information. Fuji International Symposium on Functional and Logic Programming Sofie Verbaeten, Danny De Schreye
1998	—	`conf`	A Framework for Bottom Up Specialisation of Logic Programs. PLILP/ALP Wim Vanhoof, Danny De Schreye, Bern Martens
1998	C	`conf`	Bottom-Up Specialisation of Logic Programs. LOPSTR Wim Vanhoof, Danny De Schreye, Bern Martens
1998	J	`jnl`	Constrained Partial Deduction and the Preservation of Characteristic Trees. New Gener. Comput. Michael Leuschel, Danny De Schreye
1998	J	`jnl`	Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. ACM Trans. Program. Lang. Syst. Michael Leuschel, Bern Martens, Danny De Schreye
1998	J	`jnl`	Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. J. Log. Program. Michael Leuschel, Danny De Schreye
1998	J	`jnl`	SLDNFA: An Abductive Procedure for Abductive Logic Programs. J. Log. Program. Marc Denecker, Danny De Schreye
1998	J	`jnl`	Some Achievements and Prospects in Partial Deduction. ACM Comput. Surv. Michael Leuschel, Bern Martens, Danny De Schreye
1998	—	`conf`	Specialising the Other Way Arond. IJCSLP Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck
1998	—	`conf`	Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. IJCSLP Stefaan Decorte, Danny De Schreye
1997	B	`conf`	A Strong Correspondence between Description Logics and Open Logic Programming. ICLP Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1997	—	`conf`	Compositionality of Normal Open Logic Programs. ILPS Sofie Verbaeten, Marc Denecker, Danny De Schreye
1997	—	`conf`	Constrained Partial Deduction. WLP Michael Leuschel, Danny De Schreye
1997	B	`conf`	Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. ICLP Stefaan Decorte, Danny De Schreye
1997	J	`jnl`	On the Relation Between Situation Calculus and Event Calculus. J. Log. Program. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1997	C	`conf`	Termination Analysis for Tabled Logic Programming. LOPSTR Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas
1996	—	`conf`	A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. JICSLP Michael Leuschel, Danny De Schreye, D. Andre de Waal
1996	—	`conf`	A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. JICSLP Marc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, Danny De Schreye
1996	J	`jnl`	Automatic Finite Unfolding Using Well-Founded Measures. J. Log. Program. Bern Martens, Danny De Schreye
1996	—	`conf`	Logic Program Specialisation: How To Be More Specific. PLILP Michael Leuschel, Danny De Schreye
1996	C	`conf`	Logic Program Specialisation: How to Be More Specific (Abstract). LOPSTR Michael Leuschel, Danny De Schreye
1995	B	`conf`	Combining Situation Calculus and Event Calculus. ICLP Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1995	J	`jnl`	Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. New Gener. Comput. Danny De Schreye, Kristof Verschaetse
1995	J	`jnl`	Representing Incomplete Knowledge in Abductive Logic Programming. J. Log. Comput. Marc Denecker, Danny De Schreye
1995	C	`conf`	Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. PEPM Michael Leuschel, Danny De Schreye
1995	—	`conf`	Tutorial on Program Specialisation (Abstract). ILPS Danny De Schreye, Michael Leuschel, Bern Martens
1995	—	`conf`	Using Event Calculus for Protocol Specification: An Experiment. Deductive Databases / Abduction in Deductive Databases Marc Denecker, Guy Duchatelet, Frank Piessens, Kristof Van Belleghem, Danny De Schreye
1995	J	`jnl`	Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. J. Log. Program. Bern Martens, Danny De Schreye
1994	B	`conf`	Compiling Control Revisited: A New Approach based upon Abstract Interpretation. ICLP Dmitri Boulanger, Danny De Schreye
1994	B	`conf`	Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. LPAR Henk Vandecasteele, Danny De Schreye
1994	J	`jnl`	On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. Theor. Comput. Sci. Marc Denecker, Danny De Schreye
1994	B	`conf`	Representing Continuous Change in the Abductive Event Calculus. ICLP Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1994	J	`jnl`	Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Theor. Comput. Sci. Bern Martens, Danny De Schreye, Tamás Horváth
1994	J	`jnl`	Termination of Logic Programs: The Never-Ending Story. J. Log. Program. Danny De Schreye, Stefaan Decorte
1994	—	`conf`	The Abductive Event Calculus as a General Framework for Temporal Databases. ICTL Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1993	—	`conf`	Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. ILPS Stefaan Decorte, Danny De Schreye, Massimo Fabris
1993	—	`conf`	Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye
1993	B	`conf`	Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. LPNMR Marc Denecker, Danny De Schreye
1993	—	`conf`	Representing Incomplete Knowledge in Abductive Logic Programming. ILPS Marc Denecker, Danny De Schreye
1993	C	`conf`	Some Further Issues in Finite Unfolding (Abstract). LOPSTR Bern Martens, Danny De Schreye
1992	—	`conf`	A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. FGCS Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
1992	J	`jnl`	A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. New Gener. Comput. Maurice Bruynooghe, Danny De Schreye, Bern Martens
1992	—	`conf`	A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. JICSLP Bern Martens, Danny De Schreye
1992	—	`conf`	A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation. META Danny De Schreye, Bern Martens
1992	—	`conf`	A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. CNKBS Danny De Schreye, Bern Martens
1992	C	`conf`	Automatic Termination Analysis. LOPSTR Kristof Verschaetse, Stefaan Decorte, Danny De Schreye
1992	—	`conf`	Deriving of Linear Size Relations by Abstract Interpretation. PLILP Kristof Verschaetse, Danny De Schreye
1992	—	`conf`	On the Duality of Abduction and Model Generation. FGCS Marc Denecker, Danny De Schreye
1992	—	`conf`	SLDNFA: An Abductive Procedure for Normal Abductive Programs. JICSLP Marc Denecker, Danny De Schreye
1992	—	`conf`	Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS Bern Martens, Danny De Schreye, Maurice Bruynooghe
1992	—	`conf`	Tutorial on Termination of Logic Programs. META Danny De Schreye, Kristof Verschaetse
1991	—	`conf`	A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. ISLP Maurice Bruynooghe, Danny De Schreye, Bern Martens
1991	J	`jnl`	Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. J. Autom. Reason. Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe
1991	B	`conf`	Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. ICLP Kristof Verschaetse, Danny De Schreye
1990	B	`conf`	A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. ICLP Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
1990	B	`conf`	Generation and Compilation of Efficient Computation Rules. ICLP Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe
1990	A	`conf`	Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. ESOP Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe
1989	J	`jnl`	Compiling Control. J. Log. Program. Maurice Bruynooghe, Danny De Schreye, Bruno Krekels
1989	A*	`conf`	Explanation Based Program Transformation. IJCAI Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
1989	J	`jnl`	On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artif. Intell. Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse
1989	J	`jnl`	On the Transformation of Logic Programs with Instantiation Based Computation Rules. J. Symb. Comput. Danny De Schreye, Maurice Bruynooghe
1989	—	`conf`	Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. AII Maurice Bruynooghe, Danny De Schreye
1988	—	`conf`	An Application of Abstract Interpretation in Source Level Program Transformation. PLILP Danny De Schreye, Maurice Bruynooghe
1988	—	`conf`	The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. META Danny De Schreye, Maurice Bruynooghe
1986	—	`conf`	Compiling Control. SLP Maurice Bruynooghe, Danny De Schreye, Bruno Krekels