
Search the dblp DataBase
D. Andre de Waal:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 D. Andre de Waal, John P. Gallagher
The Applicability of Logic Program Analysis and Transformation to Theorem Proving. [Citation Graph (0, 0)][DBLP] CADE, 1994, pp:207221 [Conf]
 John P. Gallagher, D. Andre de Waal
Fast and Precise Regular Approximations of Logic Programs. [Citation Graph (0, 0)][DBLP] ICLP, 1994, pp:599613 [Conf]
 Michael Leuschel, Danny De Schreye, D. Andre de Waal
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. [Citation Graph (0, 0)][DBLP] JICSLP, 1996, pp:319332 [Conf]
 John P. Gallagher, D. Andre de Waal
Deletion of Redundant Unary Type Predicates from Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1992, pp:151167 [Conf]
 D. Andre de Waal
The Power of Partial Evaluation. [Citation Graph (0, 0)][DBLP] LOPSTR, 1993, pp:113123 [Conf]
 D. Andre de Waal, John P. Gallagher
Specialisation of a Unification Algorithm. [Citation Graph (0, 0)][DBLP] LOPSTR, 1991, pp:205220 [Conf]
 D. Andre de Waal, Michael Thielscher
Solving Deductive Planning Problems Using Program Analysis and Transformation. [Citation Graph (0, 0)][DBLP] LOPSTR, 1995, pp:189203 [Conf]
 Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
Detecting Unsolvable Queries for Definite Logic Programs. [Citation Graph (0, 0)][DBLP] PLILP/ALP, 1998, pp:118133 [Conf]
 D. Andre de Waal, John P. Gallagher
Logic Program Specialisation With Deletion of Useless Clauses. [Citation Graph (0, 0)][DBLP] ILPS, 1993, pp:632 [Conf]
 Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
Detecting Unsolvable Queries for Definite Logic Programs [Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp: [Journal]
 Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
Detecting Unsolvable Queries for Definite Logic Programs [Citation Graph (0, 0)][DBLP] Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 2, pp: [Journal]
Search in 0.002secs, Finished in 0.003secs
