Citation: M. Leuschel et D. Deschreye, CREATING SPECIALIZED INTEGRITY CHECKS THROUGH PARTIAL EVALUATION OF META-INTERPRETERS, The journal of logic programming, 36(2), 1998, pp. 149-193
Citation: M. Denecker et D. Deschreye, SLDNFA - AN ABDUCTIVE PROCEDURE FOR ABDUCTIVE LOGIC PROGRAMS, The journal of logic programming, 34(2), 1998, pp. 111-167
Citation: M. Leuschel et D. Deschreye, CONSTRAINED PARTIAL DEDUCTION AND THE PRESERVATION OF CHARACTERISTIC TREES, New generation computing, 16(3), 1998, pp. 283-342
Citation: M. Leuschel et al., CONTROLLING GENERALIZATION AND POLYVARIANCE IN PARTIAL DEDUCTION OF NORMAL LOGIC PROGRAMS, ACM transactions on programming languages and systems, 20(1), 1998, pp. 208-258
Citation: K. Vanbelleghem et al., ON THE RELATION BETWEEN SITUATION CALCULUS AND EVENT CALCULUS, The journal of logic programming, 31(1-3), 1997, pp. 3-37
Citation: B. Martens et D. Deschreye, AUTOMATIC FINITE UNFOLDING USING WELL-FOUNDED MEASURES, The journal of logic programming, 28(2), 1996, pp. 89-146
Citation: B. Martens et D. Deschreye, WHY UNTYPED NONGROUND METAPROGRAMMING IS NOT (MUCH OF) A PROBLEM, The journal of logic programming, 22(1), 1995, pp. 47-99
Citation: D. Deschreye et K. Verschaetse, DERIVING LINEAR SIZE RELATIONS FOR LOGIC PROGRAMS BY ABSTRACT INTERPRETATION, New generation computing, 13(2), 1995, pp. 117-154
Citation: B. Martens et al., SOUND AND COMPLETE PARTIAL DEDUCTION WITH UNFOLDING BASED ON WELL-FOUNDED MEASURES, Theoretical computer science, 122(1-2), 1994, pp. 97-117
Citation: M. Denecker et D. Deschreye, ON THE DUALITY OF ABDUCTION AND MODEL GENERATION IN A FRAMEWORK FOR MODEL GENERATION WITH EQUALITY, Theoretical computer science, 122(1-2), 1994, pp. 225-262
Citation: M. Bruynooghe et al., A GENERAL CRITERION FOR AVOIDING INFINITE UNFOLDING DURING PARTIAL DEDUCTION, New generation computing, 11(1), 1992, pp. 47-79