| Revising hull and box consistency D De Schreye MIT press, 1999 | 456 | 1999 |
| Termination of logic programs-the never-ending story D De Schreye, S Decorte Journal of logic programming 20 (SUPPL. 1), 199-260, 1994 | 305 | 1994 |
| 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 |
| SLDNFA: an abductive procedure for abductive logic programs M Denecker, D De Schreye The journal of logic programming 34 (2), 111-167, 1998 | 130 | 1998 |
| Representing incomplete knowledge in abductive logic programming M Denecker, D De Schreye Journal of Logic and Computation 5 (5), 553-577, 1995 | 124 | 1995 |
| SLDNFA: an abductive procedure for normal abductive programs M Denecker, D De Schreye Proc. of the International Joint Conference and Symposium on Logic …, 1992 | 122 | 1992 |
| 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 | 121 | 1999 |
| 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 |
| Temporal reasoning with abductive event calculus M Denecker, L Missiaen, M Bruynooghe Proceedings of the 10th European Conference on Artificial Intelligence …, 1992 | 111 | 1992 |
| Disjunctive Logic Programs with Inheritance. F Buccafurri, W Faber, N Leone ICLP 99, 79-93, 1999 | 110 | 1999 |
| Compiling control M Bruynooghe, D De Schreye, B Krekels The Journal of Logic Programming 6 (1-2), 135-162, 1989 | 101 | 1989 |
| 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 | 86 | 1992 |
| A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. M Leuschel, D De Schreye, DA de Waal JICSLP, 319-332, 1996 | 85 | 1996 |
| 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 |
| Deriving termination proofs for logic programs, using abstract procedures C Verschaetse, D De Schreye Proceedings 8th Int. Conf. on Logic Programming, 301-315, 1991 | 73 | 1991 |
| Concurrency in Prolog Using Threads and a Shared Database. M Carro, MV Hermenegildo ICLP, 320-334, 1999 | 68 | 1999 |
| 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 | 67 | 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 | 64 | 1993 |
| Automatic finite unfolding using well-founded measures B Martens, D De Schreye The Journal of Logic Programming 28 (2), 89-146, 1996 | 55 | 1996 |
| 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 | 53 | 2007 |
