| 1995 | ||
|---|---|---|
| j2 | Danny De Schreye, Kristof Verschaetse: Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. New Generation Comput. 13(2): 117-154 (1995) | |
| 1992 | ||
| c7 | Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe: A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. FGCS 1992: 481-488 | |
| c6 | Kristof Verschaetse, Stefaan Decorte, Danny De Schreye: Automatic Termination Analysis. LOPSTR 1992: 168-183 | |
| c5 | ||
| c4 | Kristof Verschaetse, Danny De Schreye: Deriving of Linear Size Relations by Abstract Interpretation. PLILP 1992: 296-310 | |
| 1991 | ||
| c3 | Kristof Verschaetse, Danny De Schreye: Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. ICLP 1991: 301-315 | |
| 1990 | ||
| c2 | Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe: A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. ICLP 1990: 649-663 | |
| c1 | Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe: Generation and Compilation of Efficient Computation Rules. ICLP 1990: 700-714 | |
| 1989 | ||
| j1 | Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse: On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artif. Intell. 41(2): 237-248 (1989) | |
| 1 | Maurice Bruynooghe | |
| 2 | Stefaan Decorte | |
| 3 | Danny De Schreye |
Data released under the ODC-BY 1.0 license — See also our legal information page