Danny De Schreye
Danny De Schreye
Hoogleraar Computerwetenschappen, KU Leuven
Verified email at cs.kuleuven.be
Title
Cited by
Cited by
Year
Revising hull and box consistency
D De Schreye
MIT press, 1999
4781999
Termination of logic programs: The never-ending story
D De Schreye, S Decorte
The Journal of Logic Programming 19, 199-260, 1994
2991994
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
1281998
Representing incomplete knowledge in abductive logic programming
M Denecker, D De Schreye
Journal of Logic and Computation 5 (5), 553-577, 1995
1261995
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
1241999
SLDNFA: an abductive procedure for normal abductive programs
M Denecker, D De Schreye
Proc. of the International Joint Conference and Symposium on Logic …, 1992
1221992
A general criterion for avoiding infinite unfolding during partial deduction
M Bruynooghe, D De Schreye, B Martens
New Generation Computing 11 (1), 47-79, 1992
115*1992
Disjunctive logic programs with inheritance
F Buccafurri, W Faber, N Leone
Theory and Practice of Logic Programming 2 (3), 293-321, 2002
1132002
Temporal reasoning with abductive event calculus
M Denecker, L Missiaen, M Bruynooghe
Proceedings of the 10th European Conference on Artificial Intelligence …, 1992
1101992
Compiling control
M Bruynooghe, D De Schreye, B Krekels
The Journal of Logic Programming 6 (1-2), 135-162, 1989
971989
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration.
M Leuschel, D De Schreye, DA de Waal
JICSLP, 319-332, 1996
851996
A framework for analysing the termination of definite logic programs with respect to call patterns
D De Schreye, C Verschaetse, M Bruynooghe
Fifth Generation Computer Systems' 92: Proceedings of the International …, 1992
811992
Deriving termination proofs for logic programs, using abstract procedures
C Verschaetse, D De Schreye
Proceedings 8th Int. Conf. on Logic Programming, 301-315, 1991
741991
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
701999
Concurrency in Prolog Using Threads and a Shared Database.
M Carro, MV Hermenegildo
ICLP, 320-334, 1999
681999
Solving tsp with time windows with constraints
D De Schreye
MIT Press, 1999
671999
Automatic inference of norms: a missing link in automatic termination analysis
S Decorte, D De Schreye, M Fabris
Proceedings International Logic Programming Symposium 1993, 420-436, 1993
661993
Program Analysis, Debugging, and Optimization Using the Ciao System Preprocessor.
MV Hermenegildo, F Bueno, G Puebla, P López-García
ICLP, 52-66, 1999
651999
Termination analysis of logic programs based on dependency graphs
MT Nguyen, J Giesl, P Schneider-Kamp, D De Schreye
International Symposium on Logic-based Program Synthesis and Transformation …, 2007
572007
The system can't perform the operation now. Try again later.
Articles 1–20