| Termination of logic programs: The never-ending story D De Schreye, S Decorte The Journal of Logic Programming 19, 199-260, 1994 | 310 | 1994 |
| 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 | 132 | 1999 |
| 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 | 132 | 1998 |
| SLDNFA: an abductive procedure for abductive logic programs M Denecker, D De Schreye The journal of logic programming 34 (2), 111-167, 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 | 128 | 1995 |
| SLDNFA: An Abductive Procedure for Normal Abductive Programs. M Denecker, D De Schreye JICSLP, 686-700, 1992 | 124 | 1992 |
| Temporal Reasoning with Abductive Event Calculus. M Denecker, L Missiaen, M Bruynooghe ECAI, 384-388, 1992 | 120 | 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 | 118* | 1992 |
| Compiling control M Bruynooghe, D De Schreye, B Krekels The Journal of Logic Programming 6 (1-2), 135-162, 1989 | 106 | 1989 |
| A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. M Leuschel, D De Schreye, A de Waal JICSLP, 319-332, 1996 | 87 | 1996 |
| 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 | 85 | 1992 |
| 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 | 76 | 1999 |
| Deriving termination proofs for logic programs, using abstract procedures K Verschaetse, D De Schreye ICLP, 301-315, 1991 | 76 | 1991 |
| 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 | 65 | 1993 |
| Automatic finite unfolding using well-founded measures B Martens, D De Schreye The Journal of Logic Programming 28 (2), 89-146, 1996 | 58 | 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 | 58 | 1995 |
| 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 | 57 | 2008 |
| Logic program specialisation: How to be more specific M Leuschel, D De Schreye International Symposium on Programming Language Implementation and Logic …, 1996 | 54 | 1996 |
| Knowledge representation and reasoning in incomplete logic programming M Denecker Katholieke Universiteit Leuven, 1993 | 53 | 1993 |
| Justification semantics: a unifying framework for the semantics of logic programs M Denecker, D De Schreye | 47 | 1993 |
