Search the dblp DataBase
Danny De Schreye :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Danny De Schreye , Maurice Bruynooghe The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. [Citation Graph (1, 0)][DBLP ] META, 1988, pp:217-231 [Conf ] Maurice Bruynooghe , Danny De Schreye Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. [Citation Graph (0, 0)][DBLP ] AII, 1989, pp:60-77 [Conf ] Danny De Schreye , Alexander Serebrenik Acceptability with General Orderings. [Citation Graph (0, 0)][DBLP ] Computational Logic: Logic Programming and Beyond, 2002, pp:187-210 [Conf ] Danny De Schreye , Bern Martens A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. [Citation Graph (0, 0)][DBLP ] CNKBS, 1992, pp:49-51 [Conf ] Marc Denecker , Guy Duchatelet , Frank Piessens , Kristof Van Belleghem , Danny De Schreye Using Event Calculus for Protocol Specification: An Experiment. [Citation Graph (0, 0)][DBLP ] Deductive Databases / Abduction in Deductive Databases, 1995, pp:187-201 [Conf ] Danny De Schreye , Dirk Pollet , Johan Ronsyn , Maurice Bruynooghe Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. [Citation Graph (0, 0)][DBLP ] ESOP, 1990, pp:106-117 [Conf ] Marc Denecker , Danny De Schreye On the Duality of Abduction and Model Generation. [Citation Graph (0, 0)][DBLP ] FGCS, 1992, pp:650-657 [Conf ] Bern Martens , Danny De Schreye , Maurice Bruynooghe Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. [Citation Graph (0, 0)][DBLP ] FGCS, 1992, pp:473-480 [Conf ] Danny De Schreye , Kristof Verschaetse , Maurice Bruynooghe A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. [Citation Graph (0, 0)][DBLP ] FGCS, 1992, pp:481-488 [Conf ] Sofie Verbaeten , Danny De Schreye Termination Analysis of Tabled Logic Programs Using Mode and Type Information. [Citation Graph (0, 0)][DBLP ] Fuji International Symposium on Functional and Logic Programming, 1999, pp:163-178 [Conf ] Dmitri Boulanger , Danny De Schreye Compiling Control Revisited: A New Approach based upon Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] ICLP, 1994, pp:699-713 [Conf ] Kristof Van Belleghem , Marc Denecker , Danny De Schreye Representing Continuous Change in the Abductive Event Calculus. [Citation Graph (0, 0)][DBLP ] ICLP, 1994, pp:225-239 [Conf ] Kristof Van Belleghem , Marc Denecker , Danny De Schreye Combining Situation Calculus and Event Calculus. [Citation Graph (0, 0)][DBLP ] ICLP, 1995, pp:83-97 [Conf ] Kristof Van Belleghem , Marc Denecker , Danny De Schreye A Strong Correspondence between Description Logics and Open Logic Programming. [Citation Graph (0, 0)][DBLP ] ICLP, 1997, pp:346-360 [Conf ] Marc Denecker , Kristof Van Belleghem , Guy Duchatelet , Frank Piessens , Danny De Schreye A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. [Citation Graph (0, 0)][DBLP ] JICSLP, 1996, pp:170-184 [Conf ] Stefaan Decorte , Danny De Schreye Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP ] ICLP, 1997, pp:78-92 [Conf ] Stefaan Decorte , Danny De Schreye Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. [Citation Graph (0, 0)][DBLP ] IJCSLP, 1998, pp:235-249 [Conf ] Marc Denecker , Danny De Schreye SLDNFA: An Abductive Procedure for Normal Abductive Programs. [Citation Graph (0, 0)][DBLP ] JICSLP, 1992, pp:686-700 [Conf ] Michael Leuschel , Danny De Schreye , D. Andre de Waal A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. [Citation Graph (0, 0)][DBLP ] JICSLP, 1996, pp:319-332 [Conf ] Bern Martens , Danny De Schreye A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. [Citation Graph (0, 0)][DBLP ] JICSLP, 1992, pp:511-525 [Conf ] Manh Thang Nguyen , Danny De Schreye Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP ] ICLP, 2005, pp:311-325 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] ICLP, 1990, pp:649-663 [Conf ] Kristof Verschaetse , Danny De Schreye Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. [Citation Graph (0, 0)][DBLP ] ICLP, 1991, pp:301-315 [Conf ] Wim Vanhoof , Bern Martens , Danny De Schreye , Karel De Vlaminck Specialising the Other Way Arond. [Citation Graph (0, 0)][DBLP ] IJCSLP, 1998, pp:279-293 [Conf ] Kristof Verschaetse , Danny De Schreye , Maurice Bruynooghe Generation and Compilation of Efficient Computation Rules. [Citation Graph (0, 0)][DBLP ] ICLP, 1990, pp:700-714 [Conf ] Kristof Van Belleghem , Marc Denecker , Danny De Schreye The Abductive Event Calculus as a General Framework for Temporal Databases. [Citation Graph (0, 0)][DBLP ] ICTL, 1994, pp:301-316 [Conf ] Maurice Bruynooghe , Luc De Raedt , Danny De Schreye Explanation Based Program Transformation. [Citation Graph (0, 0)][DBLP ] IJCAI, 1989, pp:407-412 [Conf ] Stefaan Decorte , Danny De Schreye , Michael Leuschel , Bern Martens , Konstantinos F. Sagonas Termination Analysis for Tabled Logic Programming. [Citation Graph (0, 0)][DBLP ] LOPSTR, 1997, pp:111-127 [Conf ] Michael Leuschel , Danny De Schreye Logic Program Specialisation: How to Be More Specific (Abstract). [Citation Graph (0, 0)][DBLP ] LOPSTR, 1996, pp:58- [Conf ] Bern Martens , Danny De Schreye Some Further Issues in Finite Unfolding (Abstract). [Citation Graph (0, 0)][DBLP ] LOPSTR, 1993, pp:159-161 [Conf ] Alexander Serebrenik , Danny De Schreye Non-tranformational termination analysis of logic programs, based on general term-orderings. [Citation Graph (0, 0)][DBLP ] LOPSTR, 2000, pp:- [Conf ] Alexander Serebrenik , Danny De Schreye Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. [Citation Graph (0, 0)][DBLP ] LOPSTR (LNCS 2042: Selected Papers), 2000, pp:69-85 [Conf ] Alexander Serebrenik , Danny De Schreye Proving Termination with Adornments. [Citation Graph (0, 0)][DBLP ] LOPSTR, 2003, pp:108-109 [Conf ] Wim Vanhoof , Danny De Schreye , Bern Martens Bottom-Up Specialisation of Logic Programs. [Citation Graph (0, 0)][DBLP ] LOPSTR, 1998, pp:325-327 [Conf ] Kristof Verschaetse , Stefaan Decorte , Danny De Schreye Automatic Termination Analysis. [Citation Graph (0, 0)][DBLP ] LOPSTR, 1992, pp:168-183 [Conf ] Manh Thang Nguyen , Danny De Schreye Polytool: Proving Termination Automatically Based on Polynomial Interpretations. [Citation Graph (0, 0)][DBLP ] LOPSTR, 2006, pp:210-218 [Conf ] Alexander Serebrenik , Danny De Schreye On Termination of Meta-Programs. [Citation Graph (0, 0)][DBLP ] LPAR, 2001, pp:517-530 [Conf ] Alexander Serebrenik , Danny De Schreye Inference of Termination Conditions for Numerical Loops in Prolog. [Citation Graph (0, 0)][DBLP ] LPAR, 2001, pp:654-668 [Conf ] Henk Vandecasteele , Danny De Schreye Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. [Citation Graph (0, 0)][DBLP ] LPAR, 1994, pp:84-98 [Conf ] Alexander Serebrenik , Danny De Schreye Hasta-La-Vista: Termination Analyser for Logic Programs. [Citation Graph (0, 0)][DBLP ] WLPE, 2003, pp:60-74 [Conf ] Dmitri Boulanger , Maurice Bruynooghe , Danny De Schreye Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] LPE, 1993, pp:39-51 [Conf ] Marc Denecker , Danny De Schreye Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP ] LPNMR, 1993, pp:365-379 [Conf ] Danny De Schreye , Bern Martens A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation. [Citation Graph (0, 0)][DBLP ] META, 1992, pp:192-204 [Conf ] Danny De Schreye , Kristof Verschaetse Tutorial on Termination of Logic Programs. [Citation Graph (0, 0)][DBLP ] META, 1992, pp:70-88 [Conf ] Jon Sneyers , Joost Vennekens , Danny De Schreye Probabilistic-Logical Modeling of Music. [Citation Graph (0, 0)][DBLP ] PADL, 2006, pp:60-72 [Conf ] Michael Leuschel , Danny De Schreye Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. [Citation Graph (0, 0)][DBLP ] PEPM, 1995, pp:253-263 [Conf ] Michael Leuschel , Danny De Schreye Logic Program Specialisation: How To Be More Specific. [Citation Graph (0, 0)][DBLP ] PLILP, 1996, pp:137-151 [Conf ] Kristof Verschaetse , Danny De Schreye Deriving of Linear Size Relations by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] PLILP, 1992, pp:296-310 [Conf ] Danny De Schreye , Maurice Bruynooghe An Application of Abstract Interpretation in Source Level Program Transformation. [Citation Graph (0, 0)][DBLP ] PLILP, 1988, pp:35-57 [Conf ] Wim Vanhoof , Danny De Schreye , Bern Martens A Framework for Bottom Up Specialisation of Logic Programs. [Citation Graph (0, 0)][DBLP ] PLILP/ALP, 1998, pp:54-72 [Conf ] Sofie Verbaeten , Konstantinos F. Sagonas , Danny De Schreye Modular Termination Proofs for Prolog with Tabling. [Citation Graph (0, 0)][DBLP ] PPDP, 1999, pp:342-359 [Conf ] Alexander Serebrenik , Danny De Schreye On Termination of Logic Programs with Floating Point Computations. [Citation Graph (0, 0)][DBLP ] SAS, 2002, pp:151-164 [Conf ] Maurice Bruynooghe , Danny De Schreye , Bruno Krekels Compiling Control. [Citation Graph (0, 0)][DBLP ] SLP, 1986, pp:70-77 [Conf ] Maurice Bruynooghe , Danny De Schreye , Bern Martens A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. [Citation Graph (0, 0)][DBLP ] ISLP, 1991, pp:117-131 [Conf ] Stefaan Decorte , Danny De Schreye , Massimo Fabris Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. [Citation Graph (0, 0)][DBLP ] ILPS, 1993, pp:420-436 [Conf ] Marc Denecker , Danny De Schreye Representing Incomplete Knowledge in Abductive Logic Programming. [Citation Graph (0, 0)][DBLP ] ILPS, 1993, pp:147-163 [Conf ] Danny De Schreye , Michael Leuschel , Bern Martens Tutorial on Program Specialisation (Abstract). [Citation Graph (0, 0)][DBLP ] ILPS, 1995, pp:615-616 [Conf ] Sofie Verbaeten , Marc Denecker , Danny De Schreye Compositionality of Normal Open Logic Programs. [Citation Graph (0, 0)][DBLP ] ILPS, 1997, pp:371-385 [Conf ] Michael Leuschel , Danny De Schreye Constrained Partial Deduction. [Citation Graph (0, 0)][DBLP ] WLP, 1997, pp:0-0 [Conf ] Sven Verdoolaege , Marc Denecker , Ness Schelkens , Danny De Schreye , Frank Van Eynde Semantic interpretation of temporal information by abductive inference. [Citation Graph (0, 0)][DBLP ] CLIN, 1999, pp:- [Conf ] Sofie Verbaeten , Danny De Schreye Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:1/2, pp:157-196 [Journal ] Danny De Schreye , Maurice Bruynooghe , Kristof Verschaetse On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1989, v:41, n:2, pp:237-248 [Journal ] Danny De Schreye , Maurice Bruynooghe , Bart Demoen , Marc Denecker , Gerda Janssens , Bern Martens Project Report on LP+ : A Second Generation Logic Programming Language. [Citation Graph (0, 0)][DBLP ] AI Commun., 2000, v:13, n:1, pp:13-18 [Journal ] Sven Verdoolaege , Marc Denecker , Ness Schelkens , Danny De Schreye , Frank Van Eynde Semantic interpretation of temporal information by abductive inference [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Sofie Verbaeten , Danny De Schreye , Konstantinos F. Sagonas Termination Proofs for Logic Programs with Tabling [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Alexander Serebrenik , Danny De Schreye Termination analysis of logic programs using acceptability with general term orders [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Danny De Schreye , Alexander Serebrenik Acceptability with general orderings [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Alexander Serebrenik , Danny De Schreye Inference of termination conditions for numerical loops [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Alexander Serebrenik , Danny De Schreye Inference of termination conditions for numerical loops in Prolog [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Alexander Serebrenik , Danny De Schreye On termination of meta-programs [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Michael Leuschel , Bern Martens , Danny De Schreye Some Achievements and Prospects in Partial Deduction. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1998, v:30, n:3es, pp:4- [Journal ] Danny De Schreye , Bern Martens , Gunther Sablon , Maurice Bruynooghe Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 1991, v:7, n:3, pp:337-358 [Journal ] Alexander Serebrenik , Danny De Schreye Termination of Floating-Point Computations. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2005, v:34, n:2, pp:141-177 [Journal ] Wim Vanhoof , Danny De Schreye , Bern Martens Bottom-up Partial Deduction of Logic Programs [Citation Graph (0, 0)][DBLP ] Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 2, pp:- [Journal ] Maurice Bruynooghe , Danny De Schreye , Bruno Krekels Compiling Control. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1989, v:6, n:1&2, pp:135-162 [Journal ] Kristof Van Belleghem , Marc Denecker , Danny De Schreye On the Relation Between Situation Calculus and Event Calculus. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1997, v:31, n:1-3, pp:3-37 [Journal ] Marc Denecker , Danny De Schreye SLDNFA: An Abductive Procedure for Abductive Logic Programs. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1998, v:34, n:2, pp:111-167 [Journal ] Michael Leuschel , Danny De Schreye Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1998, v:36, n:2, pp:149-193 [Journal ] Bern Martens , Danny De Schreye Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1995, v:22, n:1, pp:47-99 [Journal ] Bern Martens , Danny De Schreye Automatic Finite Unfolding Using Well-Founded Measures. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1996, v:28, n:2, pp:89-146 [Journal ] Danny De Schreye , Stefaan Decorte Termination of Logic Programs: The Never-Ending Story. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1994, v:19, n:, pp:199-260 [Journal ] 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". [Citation Graph (0, 0)][DBLP ] J. Log. Program., 2000, v:43, n:3, pp:265- [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1999, v:41, n:2-3, pp:231-277 [Journal ] Sofie Verbaeten , Marc Denecker , Danny De Schreye Compositionality of Normal Open Logic Programs. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 2000, v:42, n:3, pp:151-183 [Journal ] Danny De Schreye , Maurice Bruynooghe On the Transformation of Logic Programs with Instantiation Based Computation Rules. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1989, v:7, n:2, pp:125-154 [Journal ] Marc Denecker , Danny De Schreye Representing Incomplete Knowledge in Abductive Logic Programming. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 1995, v:5, n:5, pp:553-577 [Journal ] Maurice Bruynooghe , Danny De Schreye , Bern Martens A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1992, v:11, n:1, pp:47-79 [Journal ] Michael Leuschel , Danny De Schreye Constrained Partial Deduction and the Preservation of Characteristic Trees. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1998, v:16, n:3, pp:283-342 [Journal ] Danny De Schreye , Kristof Verschaetse Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1995, v:13, n:2, pp:117-154 [Journal ] Marc Denecker , Danny De Schreye On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:122, n:1&2, pp:225-262 [Journal ] Bern Martens , Danny De Schreye , Tamás Horváth Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:122, n:1&2, pp:97-117 [Journal ] Sofie Verbaeten , Danny De Schreye , Konstantinos F. Sagonas Termination proofs for logic programs with tabling. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2001, v:2, n:1, pp:57-92 [Journal ] Stefaan Decorte , Danny De Schreye , Henk Vandecasteele Constraint-based termination analysis of logic programs. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1999, v:21, n:6, pp:1137-1195 [Journal ] Michael Leuschel , Bern Martens , Danny De Schreye Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1998, v:20, n:1, pp:208-258 [Journal ] Alexander Serebrenik , Danny De Schreye Inference of termination conditions for numerical loops in Prolog. [Citation Graph (0, 0)][DBLP ] TPLP, 2004, v:4, n:5-6, pp:719-751 [Journal ] Alexander Serebrenik , Danny De Schreye On termination of meta-programs. [Citation Graph (0, 0)][DBLP ] TPLP, 2005, v:5, n:3, pp:355-390 [Journal ] Termination of Programs using Term Rewriting and SAT Solving. [Citation Graph (, )][DBLP ] Termination Analysis of CHR Revisited. [Citation Graph (, )][DBLP ] Automating Termination Proofs for CHR. [Citation Graph (, )][DBLP ] A New Approach to Non-termination Analysis of Logic Programs. [Citation Graph (, )][DBLP ] Proving Termination by Invariance Relations. [Citation Graph (, )][DBLP ] Termination Analysis of Logic Programs Based on Dependency Graphs. [Citation Graph (, )][DBLP ] Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach [Citation Graph (, )][DBLP ] Termination Prediction for General Logic Programs [Citation Graph (, )][DBLP ] Polytool: polynomial interpretations as a basis for termination analysis of Logic programs [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.608secs