Danny De Schreye
Danny De Schreye
Hoogleraar Computerwetenschappen, KU Leuven
Email verificata su cs.kuleuven.be
TitoloCitata daAnno
Termination of logic programs: The never-ending story
D De Schreye, S Decorte
The Journal of Logic Programming 19, 199-260, 1994
3041994
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
1341998
SLDNFA: an abductive procedure for abductive logic programs
M Denecker, D De Schreye
The journal of logic programming 34 (2), 111-167, 1998
1251998
Representing incomplete knowledge in abductive logic programming
M Denecker, D De Schreye
Journal of Logic and Computation 5 (5), 553-577, 1995
1231995
SLDNFA: an abductive procedure for normal abductive programs
M Denecker, D De Schreye
Proc. of the International Joint Conference and Symposium on Logic …, 1992
1231992
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
1191999
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
116*1992
Temporal reasoning with abductive event calculus
M Denecker, L Missiaen, M Bruynooghe
Proceedings of the 10th European Conference on Artificial Intelligence …, 1992
1111992
Compiling control
M Bruynooghe, D De Schreye, B Krekels
The Journal of Logic Programming 6 (1-2), 135-162, 1989
1031989
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration.
M Leuschel, D De Schreye, DA de Waal
JICSLP, 319-332, 1996
881996
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
861992
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
711999
Deriving termination proofs for logic programs, using abstract procedures
C Verschaetse, D De Schreye
Proceedings 8th Int. Conf. on Logic Programming, 301-315, 1991
701991
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
651993
Automatic finite unfolding using well-founded measures
B Martens, D De Schreye
The Journal of Logic Programming 28 (2), 89-146, 1996
571996
Logic program specialisation: How to be more specific
M Leuschel, D De Schreye
International Symposium on Programming Language Implementation and Logic …, 1996
541996
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
531995
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
512007
Advanced techniques for logic program specialisation
M Leuschel
461997
Sound and complete partial deduction with unfolding based on well-founded measures
B Martens, D De Schreye, T Horváth
Theoretical Computer Science 122 (1-2), 97-117, 1994
411994
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20