Follow
Danny De Schreye
Danny De Schreye
Hoogleraar Computerwetenschappen, KU Leuven
Verified email at cs.kuleuven.be
Title
Cited by
Cited by
Year
Termination of logic programs: The never-ending story
D De Schreye, S Decorte
The Journal of Logic Programming 19, 199-260, 1994
3101994
Conjunctive partial deduction: Foundations, control, algorithms, and experiments
D De Schreye, R Glück, J Jĝrgensen, M Leuschel, B Martens, ...
The Journal of Logic Programming 41 (2-3), 231-277, 1999
1321999
Controlling generalization and polyvariance in partial deduction of normal logic programs
M Leuschel, B Martens, D De Schreye
ACM Transactions on Programming Languages and Systems (TOPLAS) 20 (1), 208-258, 1998
1321998
SLDNFA: an abductive procedure for abductive logic programs
M Denecker, D De Schreye
The journal of logic programming 34 (2), 111-167, 1998
1311998
Representing incomplete knowledge in abductive logic programming
M Denecker, D De Schreye
Journal of Logic and Computation 5 (5), 553-577, 1995
1281995
SLDNFA: An Abductive Procedure for Normal Abductive Programs.
M Denecker, D De Schreye
JICSLP, 686-700, 1992
1241992
Temporal Reasoning with Abductive Event Calculus.
M Denecker, L Missiaen, M Bruynooghe
ECAI, 384-388, 1992
1201992
A general criterion for avoiding infinite unfolding during partial deduction
M Bruynooghe, D De Schreye, B Martens
New Generation Computing 11, 47-79, 1992
118*1992
Compiling control
M Bruynooghe, D De Schreye, B Krekels
The Journal of Logic Programming 6 (1-2), 135-162, 1989
1061989
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration.
M Leuschel, D De Schreye, A de Waal
JICSLP, 319-332, 1996
871996
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns.
D De Schreye, K Verschaetse, M Bruynooghe
FGCS 92, 481-488, 1992
851992
Constraint-based termination analysis of logic programs
S Decorte, D De Schreye, H Vandecasteele
ACM Transactions on Programming Languages and Systems (TOPLAS) 21 (6), 1137-1195, 1999
761999
Deriving termination proofs for logic programs, using abstract procedures
K Verschaetse, D De Schreye
ICLP, 301-315, 1991
761991
Automatic inference of norms: a missing link in automatic termination analysis
S Decorte, D De Schreye, M Fabris
Proceedings of the 1993 international symposium on Logic programming, 420-436, 1993
651993
Automatic finite unfolding using well-founded measures
B Martens, D De Schreye
The Journal of Logic Programming 28 (2), 89-146, 1996
581996
Why untyped nonground metaprogramming is not (much of) a problem
B Martens, D De Schreye
The Journal of Logic Programming 22 (1), 47-99, 1995
581995
Termination analysis of logic programs based on dependency graphs
MT Nguyen, J Giesl, P Schneider-Kamp, D De Schreye
Logic-Based Program Synthesis and Transformation: 17th International …, 2008
572008
Logic program specialisation: How to be more specific
M Leuschel, D De Schreye
International Symposium on Programming Language Implementation and Logic …, 1996
541996
Knowledge representation and reasoning in incomplete logic programming
M Denecker
Katholieke Universiteit Leuven, 1993
531993
Justification semantics: a unifying framework for the semantics of logic programs
M Denecker, D De Schreye
471993
The system can't perform the operation now. Try again later.
Articles 1–20