| Termination of logic programs: The never-ending story D De Schreye, S Decorte The Journal of Logic Programming 19, 199-260, 1994 | 306 | 1994 |
| SLDNFA: an abductive procedure for abductive logic programs M Denecker, D De Schreye The journal of logic programming 34 (2), 111-167, 1998 | 135 | 1998 |
| 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 | 131 | 1998 |
| Representing incomplete knowledge in abductive logic programming M Denecker, D De Schreye Journal of Logic and Computation 5 (5), 553-577, 1995 | 131 | 1995 |
| 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 | 130 | 1999 |
| SLDNFA: an abductive procedure for normal abductive programs M Denecker, D De Schreye Proc. of the International Joint Conference and Symposium on Logic …, 1992 | 118 | 1992 |
| A general criterion for avoiding infinite unfolding during partial deduction M Bruynooghe, D De Schreye, B Martens New Generation Computing 11, 47-79, 1992 | 117* | 1992 |
| Temporal reasoning with abductive event calculus M Denecker, L Missiaen, M Bruynooghe Proceedings of the 10th European Conference on Artificial Intelligence …, 1992 | 113 | 1992 |
| Compiling control M Bruynooghe, D De Schreye, B Krekels The Journal of Logic Programming 6 (1-2), 135-162, 1989 | 101 | 1989 |
| A conceptual embedding of folding into partial deduction: Towards a maximal integration M Leuschel, D De Schreye, DA de Waal the Joint International Conference and Symposium on Logic Programming …, 1996 | 86 | 1996 |
| 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 | 81 | 1992 |
| Deriving termination proofs for logic programs, using abstract procedures C Verschaetse, D De Schreye Proceedings 8th Int. Conf. on Logic Programming, 301-315, 1991 | 78 | 1991 |
| 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 | 74 | 1999 |
| Solving tsp with time windows with constraints D De Schreye MIT Press, 1999 | 68 | 1999 |
| 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 | 65 | 1993 |
| Automatic finite unfolding using well-founded measures B Martens, D De Schreye The Journal of Logic Programming 28 (2), 89-146, 1996 | 57 | 1996 |
| 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 | 56 | 1995 |
| Logic program specialisation: How to be more specific M Leuschel, D De Schreye Programming Languages: Implementations, Logics, and Programs: 8th …, 1996 | 55 | 1996 |
| 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 | 54 | 2008 |
| Knowledge representation and reasoning in incomplete logic programming M Denecker, D De Schreye, J Denef | 47 | 1993 |
