researchr

explore
calendar
search

You are not signed in
Sign in
Sign up

All Publications

Unidentified publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

BibTeX
Compact BibTeX
RSS
HTML
YAML
Compact YAML

External Links

Homepage

Profile Name

dannydeschreye

Statistics

Publications: 12
Edited: 0

Aliases

De Schreye
Danny De Schreye
D. De Schreye
De Schreye, Danny
De Schreye, D.

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Danny De Schreye's Profile

Publications

Unidentified Publications

Publications with a 'Danny De Schreye' as author, editor, or advisor:

Termination Analysis of CHR RevisitedPaolo Pilozzi, Danny De Schreye. ICLP 2008: 501-515 [doi]
Logic-Based Program Synthesis and Transformation, 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected PapersDanny De Schreye, editor, Volume 6037 of Lecture Notes in Computer Science, Springer, 2010. [doi]
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded MeasuresBern Martens, Danny De Schreye, Maurice Bruynooghe. fgcs 1992: 473-480
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and ExperimentsDanny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen. jlp, 41(2-3):231-277, 1999.
Generation and Compilation of Efficient Computation RulesKristof Verschaetse, Danny De Schreye, Maurice Bruynooghe. ICLP 1990: 700-714
Compositionality of Normal Open Logic ProgramsSofie Verbaeten, Marc Denecker, Danny De Schreye. jlp, 42(3):151-183, 2000.
Combining Situation Calculus and Event CalculusKristof Van Belleghem, Marc Denecker, Danny De Schreye. ICLP 1995: 83-97
A New Approach to Non-termination Analysis of Logic ProgramsDean Voets, Danny De Schreye. ICLP 2009: 220-234 [doi]
A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of AmalgamationDanny De Schreye, Bern Martens. meta 1992: 192-204
Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin NoiseColin J. Nicholson, Danny De Schreye, Jon Sneyers. ICLP 2011: 231-239 [doi]
Non-termination analysis of logic programs with integer arithmeticsDean Voets, Danny De Schreye. tplp, 11(4-5):521-536, 2011. [doi]
Automatic Termination AnalysisKristof Verschaetse, Stefaan Decorte, Danny De Schreye. LOPSTR 1992: 168-183
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic ProgramsDanny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe. JAR, 7(3):337-358, 1991.
On the Duality of Abduction and Model GenerationMarc Denecker, Danny De Schreye. fgcs 1992: 650-657
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call PatternsDanny De Schreye, Kristof Verschaetse, Maurice Bruynooghe. fgcs 1992: 481-488
Compositionality of Normal Open Logic ProgramsSofie Verbaeten, Marc Denecker, Danny De Schreye. SLP 1997: 371-385
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution MechanismSofie Verbaeten, Danny De Schreye. aaecc, 12(1/2):157-196, 2001. [doi]
Assessment of Some Issues in CL-Theory and Program DevelopmentDanny De Schreye, Marc Denecker. In Krzysztof R. Apt, Victor W. Marek, Mirek Truszczynski, David Scott Warren, editors, The Logic Programming Paradigm - A 25-Year Perspective. Artificial Intelligence, pages 195-208, Springer, 1999. [doi]
Probabilistic Termination of CHRiSM ProgramsJon Sneyers, Danny De Schreye. LOPSTR 2012: 221-236 [doi]
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic ProgramsMaurice Bruynooghe, Danny De Schreye, Bern Martens. SLP 1991: 117-131
A Framework for Bottom Up Specialisation of Logic ProgramsWim Vanhoof, Danny De Schreye, Bern Martens. plilp 1998: 54-72 [doi]
Semantic interpretation of temporal information by abductive inferenceSven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde. clin 1999: [doi]
Automatic Inference of Norms: A Missing Link in Automatic Termination AnalysisStefaan Decorte, Danny De Schreye, Massimo Fabris. SLP 1993: 420-436
Constraint-based termination analysis of logic programsStefaan Decorte, Danny De Schreye, Henk Vandecasteele. TOPLAS, 21(6):1137-1195, 1999. [doi]
Tutorial on Program Specialisation (Abstract)Danny De Schreye, Michael Leuschel, Bern Martens. SLP 1995: 615-616
Some Achievements and Prospects in Partial DeductionMichael Leuschel, Bern Martens, Danny De Schreye. ACM Comput. Surv., 30(3es):4, 1998. [doi]
Representing Continuous Change in the Abductive Event CalculusKristof Van Belleghem, Marc Denecker, Danny De Schreye. ICLP 1994: 225-239
Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-InterpretersMichael Leuschel, Danny De Schreye. PEPM 1995: 253-263
Analysing and Compiling Coroutines with Abstract Conjunctive Partial DeductionDanny De Schreye, Vincent Nys, Colin J. Nicholson. LOPSTR 2015: 21-38 [doi]
Abstract conjunctive partial deduction for the analysis and compilation of coroutinesVincent Nys, Danny De Schreye. fac, 29(1):125-153, 2017. [doi]
Compiling ControlMaurice Bruynooghe, Danny De Schreye, Bruno Krekels. jlp, 6(1&2):135-162, 1989.
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. jlp, 43(3):265, 2000.
Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanismDanny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe. ESOP 1990: 106-117
SLDNFA: An Abductive Procedure for Normal Abductive ProgramsMarc Denecker, Danny De Schreye. ICLP 1992: 686-700
Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 - December 4, 1999Danny De Schreye, editor, MIT Press, 1999.
A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol SpecificationMarc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, Danny De Schreye. ICLP 1996: 170-184
Termination of Logic Programs: The Never-Ending StoryDanny De Schreye, Stefaan Decorte. jlp, 19/20:199-260, 1994.
A Strong Correspondence between Description Logics and Open Logic ProgrammingKristof Van Belleghem, Marc Denecker, Danny De Schreye. ICLP 1997: 346-360
Justification Semantics: A Unifiying Framework for the Semantics of Logic ProgramsMarc Denecker, Danny De Schreye. lpnmr 1993: 365-379
Tutorial on Termination of Logic ProgramsDanny De Schreye, Kristof Verschaetse. meta 1992: 70-88
Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based LearningMaurice Bruynooghe, Danny De Schreye. aii 1989: 60-77
Polynomial Interpretations as a Basis for Termination Analysis of Logic ProgramsManh Thang Nguyen, Danny De Schreye. ICLP 2005: 311-325 [doi]
A Perfect Herbrand Semantics for Untyped Vanilla Meta-ProgrammingBern Martens, Danny De Schreye. ICLP 1992: 511-525
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic ProgramsDmitri Boulanger, Maurice Bruynooghe, Danny De Schreye. lpe 1993: 39-51
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded MeasuresBern Martens, Danny De Schreye, Tamás Horváth. TCS, 122(1&2):97-117, 1994.
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal IntegrationMichael Leuschel, Danny De Schreye, D. Andre de Waal. ICLP 1996: 319-332
Compiling ControlMaurice Bruynooghe, Danny De Schreye, Bruno Krekels. SLP 1986: 70-77
Probabilistic legal reasoning in CHRiSMJon Sneyers, Danny De Schreye, Thom W. Frühwirth. tplp, 13(4-5):769-781, 2013. [doi]
Deriving Linear Size Relations for Logic Programs by Abstract InterpretationDanny De Schreye, Kristof Verschaetse. ngc, 13(2):117-154, 1995.
Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational ApproachHenk Vandecasteele, Danny De Schreye. lpar 1994: 84-98
Proving Termination by Invariance RelationsPaolo Pilozzi, Danny De Schreye. ICLP 2009: 499-503 [doi]
Probabilistic-Logical Modeling of MusicJon Sneyers, Joost Vennekens, Danny De Schreye. PADL 2006: 60-72 [doi]
Polytool: Proving Termination Automatically Based on Polynomial InterpretationsManh Thang Nguyen, Danny De Schreye. LOPSTR 2007: 210-218 [doi]
Constrained Partial DeductionMichael Leuschel, Danny De Schreye. wlp 1997:
Termination Analysis of Tabled Logic Programs Using Mode and Type InformationSofie Verbaeten, Danny De Schreye. FLOPS 1999: 163-178
On the Duality of Abduction and Model Generation in a Framework for Model Generation with EqualityMarc Denecker, Danny De Schreye. TCS, 122(1&2):225-262, 1994.
Bottom-up Partial Deduction of Logic ProgramsWim Vanhoof, Danny De Schreye, Bern Martens. jflp, 1999(Special Issue 2), 1999.
Using Event Calculus for Protocol Specification: An ExperimentMarc Denecker, Guy Duchatelet, Frank Piessens, Kristof Van Belleghem, Danny De Schreye. deductive 1995: 187-201
Representing Incomplete Knowledge in Abductive Logic ProgrammingMarc Denecker, Danny De Schreye. slp 1993: 147-163
Termination Analysis of Logic Programs Based on Dependency GraphsManh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye. LOPSTR 2008: 8-22 [doi]
Compiling Control Revisited: A New Approach based upon Abstract InterpretationDmitri Boulanger, Danny De Schreye. ICLP 1994: 699-713
Improved Termination Analysis of CHR Using Self-sustainability AnalysisPaolo Pilozzi, Danny De Schreye. LOPSTR 2012: 189-204 [doi]
Termination prediction for general logic programsYi-Dong Shen, Danny De Schreye, Dean Voets. tplp, 9(6):751-780, 2009. [doi]
Logic Program Specialisation: How To Be More SpecificMichael Leuschel, Danny De Schreye. plilp 1996: 137-151
Compiling Control as Offline Partial DeductionVincent Nys, Danny De Schreye. LOPSTR 2019: 115-131 [doi]
Modular Termination Proofs for Prolog with TablingSofie Verbaeten, Konstantinos F. Sagonas, Danny De Schreye. ppdp 1999: 342-359
Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic ProgramsMichael Leuschel, Bern Martens, Danny De Schreye. TOPLAS, 20(1):208-258, 1998. [doi]
Why Untyped Nonground Metaprogramming Is Not (Much Of) A ProblemBern Martens, Danny De Schreye. jlp, 22(1):47-99, 1995.
The Abductive Event Calculus as a General Framework for Temporal DatabasesKristof Van Belleghem, Marc Denecker, Danny De Schreye. ictl 1994: 301-316
Polytool: Polynomial interpretations as a basis for termination analysis of logic programsManh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp. tplp, 11(1):33-63, 2011. [doi]
On the Relation Between Situation Calculus and Event CalculusKristof Van Belleghem, Marc Denecker, Danny De Schreye. jlp, 31(1-3):3-37, 1997.
Logic Program Specialisation: How to Be More Specific (Abstract)Michael Leuschel, Danny De Schreye. LOPSTR 1997: 58
On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-ClausesDanny De Schreye, Maurice Bruynooghe, Kristof Verschaetse. ai, 41(2):237-248, 1989.
A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamationDanny De Schreye, Bern Martens. cnkbs 1992: 49-51
Non-termination Analysis of Logic Programs Using TypesDean Voets, Danny De Schreye. LOPSTR 2011: 133-148 [doi]
The Compilation of Forward Checking Regimes through Meta-Interpretation and TransformationDanny De Schreye, Maurice Bruynooghe. meta 1988: 217-231
Towards a General Framework for Humor Generation from Rated ExamplesThomas Winters, Vincent Nys, Danny De Schreye. icccrea 2019: 274-281 [doi]
Constrained Partial Deduction and the Preservation of Characteristic TreesMichael Leuschel, Danny De Schreye. ngc, 16(3):283-342, 1998.
Automating Termination Proofs for CHRPaolo Pilozzi, Danny De Schreye. ICLP 2009: 504-508 [doi]
A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted GraphsDanny De Schreye, Kristof Verschaetse, Maurice Bruynooghe. ICLP 1990: 649-663
Explanation Based Program TransformationMaurice Bruynooghe, Luc De Raedt, Danny De Schreye. IJCAI 1989: 407-412
Specialising the Other Way ArondWim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck. ICLP 1998: 279-293
Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012Danny De Schreye, Gerda Janssens, Andy King, editors, ACM, 2012. [doi]
Deriving of Linear Size Relations by Abstract InterpretationKristof Verschaetse, Danny De Schreye. plilp 1992: 296-310
Some Further Issues in Finite Unfolding (Abstract)Bern Martens, Danny De Schreye. LOPSTR 1993: 159-161
Automatic Joke Generation: Learning Humor from ExamplesThomas Winters, Vincent Nys, Danny De Schreye. hci 2018: 360-377 [doi]
On the Transformation of Logic Programs with Instantiation Based Computation RulesDanny De Schreye, Maurice Bruynooghe. JSC, 7(2):125-154, 1989.
Deriving Termination Proofs for Logic Programs, Using Abstract ProceduresKristof Verschaetse, Danny De Schreye. ICLP 1991: 301-315
Automatic Finite Unfolding Using Well-Founded MeasuresBern Martens, Danny De Schreye. jlp, 28(2):89-146, 1996.
Termination proofs for logic programs with tablingSofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas. tocl, 2(1):57-92, 2001. [doi]
SLDNFA: An Abductive Procedure for Abductive Logic ProgramsMarc Denecker, Danny De Schreye. jlp, 34(2):111-167, 1998.
A General Criterion for Avoiding Infinite Unfolding during Partial DeductionMaurice Bruynooghe, Danny De Schreye, Bern Martens. ngc, 11(1):47-79, 1992.
Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic ProgramsStefaan Decorte, Danny De Schreye. ICLP 1997: 78-92
Project Report on LP:::+:::: A Second Generation Logic Programming LanguageDanny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens. aicom, 13(1):13-18, 2000.
Termination Analysis for Tabled Logic ProgrammingStefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos F. Sagonas. LOPSTR 1998: 111-127 [doi]
Creating Specialised Integrity Checks Through Partial Evaluation of Meta-InterpretersMichael Leuschel, Danny De Schreye. jlp, 36(2):149-193, 1998.
Termination Analysis: Some Practical Properties of the Norm and Level Mapping SpaceStefaan Decorte, Danny De Schreye. ICLP 1998: 235-249
An Application of Abstract Interpretation in Source Level Program TransformationDanny De Schreye, Maurice Bruynooghe. plilp 1989: 35-57
Bottom-Up Specialisation of Logic ProgramsWim Vanhoof, Danny De Schreye, Bern Martens. LOPSTR 1990: 325-327 [doi]

About
Contact
Credits
Help
Web Service API
Blog
FAQ
Feedback

runs on WebDSL