Termination of logic programs: The never-ending story. Zbl 0820.68029
De Schreye, Danny; Decorte, Stefaan |
|
1994
|
Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Zbl 0944.68025
De Schreye, Danny; Glück, Robert; Jørgensen, Jesper; Leuschel, Michael; Martens, Bern; Sørensen, Morten Heine |
|
1999
|
SLDNFA: An abductive procedure for abductive logic programs. Zbl 0905.68025
Denecker, Marc; De Schreye, Danny |
|
1998
|
Representing incomplete knowledge in abductive logic programming. Zbl 0832.68023
Denecker, Marc; De Schreye, Danny |
|
1995
|
Compiling control. Zbl 0668.68025
Bruynooghe, Maurice; de Schreye, Danny; Krekels, Bruno |
|
1989
|
A general criterion for avoiding infinite unfolding during partial deduction. Zbl 0782.68024
Bruynooghe, Maurice; De Schreye, Danny; Martens, Bern |
|
1992
|
Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064
Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter |
|
2011
|
Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040
Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny |
|
2008
|
Polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1165.68337
Nguyen, Manh Thang; De Schreye, Danny |
|
2005
|
Termination analysis of CHR revisited. Zbl 1185.68176
Pilozzi, Paolo; De Schreye, Danny |
|
2008
|
Termination proofs for logic programs with tabling. Zbl 1365.68153
Verbaeten, Sofie; De Schreye, Danny; Sagonas, Konstantinos |
|
2001
|
A framework for analysing the termination of definite logic programs with respect to call patterns. Zbl 0862.68016
De Schreye, Danny; Verschaetse, Kristof; Bruynooghe, Maurice |
|
1992
|
On the relation between situation calculus and event calculus. Zbl 0883.68023
Van Belleghem, Kristof; Denecker, Marc; De Schreye, Danny |
|
1997
|
On termination of meta-programs. Zbl 1092.68020
Serebrenik, Alexander; De Schreye, Danny |
|
2005
|
Automatic finite unfolding using well-founded measures. Zbl 0867.68023
Martens, Bern; De Schreye, Danny |
|
1996
|
On the existence of nonterminating queries for a restricted class of PROLOG-clauses. Zbl 0689.68114
de Schreye, Danny; Bruynooghe, Maurice; Verschaetse, Kristof |
|
1989
|
Termination prediction for general logic programs. Zbl 1184.68162
Shen, Yi-Dong; de Schreye, Danny; Voets, Dean |
|
2009
|
Non-termination analysis of logic programs with integer arithmetics. Zbl 1222.68068
Voets, Dean; De Schreye, Danny |
|
2011
|
Probabilistic termination of CHRiSM programs. Zbl 1377.68067
Sneyers, Jon; De Schreye, Danny |
|
2012
|
Sound and complete partial deduction with unfolding based on well-founded measures. Zbl 0801.68026
Martens, Bern; De Schreye, Danny; Horváth, Tamás |
|
1994
|
Inference of termination conditions for numerical loops in Prolog. Zbl 1088.68029
Serebrenik, Alexander; De Schreye, Danny |
|
2004
|
Inference of termination conditions for numerical loops in Prolog. Zbl 1275.68051
Serebrenik, Alexander; De Schreye, Danny |
|
2001
|
On the transformation of logic programs with instantiation based computation rules. Zbl 0669.68058
de Schreye, Danny; Bruynooghe, Maurice |
|
1989
|
On the duality of abduction and model generation in a framework for model generation with equality. Zbl 0801.68024
Denecker, Marc; De Schreye, Danny |
|
1994
|
Sound and complete partial deduction with unfolding based on well-founded measures. Zbl 0862.68015
Martens, Bern; De Schreye, Danny; Bruynooghe, Maurice |
|
1992
|
Explanation based program transformation. Zbl 0708.68011
Bruynooghe, Maurice; De Raedt, Luc; De Schreye, Danny |
|
1989
|
Non-termination analysis of logic programs using types. Zbl 1326.68065
Voets, Dean; De Schreye, Danny |
|
2011
|
Improved termination analysis of CHR using self-sustainability analysis. Zbl 1377.68065
Pilozzi, Paolo; De Schreye, Danny |
|
2012
|
Acceptability with general orderings. Zbl 1012.68037
De Schreye, Danny; Serebrenik, Alexander |
|
2002
|
Termination analysis: Some practical properties of the norm and level mapping space. Zbl 0949.68028
Decorte, Stefaan; De Schreye, Danny |
|
1998
|
Bottom-up partial deduction of logic programs. Zbl 0946.68012
Vanhoof, Wim; De Schreye, Danny; Martens, Bern |
|
1999
|
Non-transformational termination analysis of logic programs, based on general term-orderings. Zbl 1017.68033
Serebrenik, Alexander; De Schreye, Danny |
|
2001
|
Creating specialised integrity checks through partial evaluation of meta-interpreters. Zbl 0911.68028
Leuschel, Michael; De Schreye, Danny |
|
1998
|
On the duality of abduction and model generation. Zbl 0862.68019
Denecker, Marc; De Schreye, Danny |
|
1992
|
Why untyped nonground metaprogramming is not (much of) a problem. Zbl 0829.68024
Martens, Bern; De Schreye, Danny |
|
1995
|
Logic-based program synthesis and transformation. 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009. Revised selected papers. Zbl 1186.68005
|
|
2010
|
Integrable-ergodic \(C^ *\)-dynamical systems on Abelian groups. Zbl 0608.46039
De Schreye, D. |
|
1985
|
Analysing and compiling coroutines with abstract conjunctive partial deduction. Zbl 1353.68033
De Schreye, Danny; Nys, Vincent; Nicholson, Colin |
|
2015
|
Compiling bottom-up and mixed derivations into top-down executable logic programs. Zbl 0733.68013
de Schreye, Danny; Martens, Bern; Sablon, Gunther; Bruynooghe, Maurice |
|
1991
|
Termination of floating-point computations. Zbl 1102.65054
Serebrenik, Alexander; De Schreye, Danny |
|
2005
|
A new approach to non-termination analysis of logic programs. Zbl 1251.68070
Voets, Dean; De Schreye, Danny |
|
2009
|
Probabilistic legal reasoning in CHRiSM. Zbl 1286.68058
Sneyers, Jon; De Schreye, Danny; Frühwirth, Thom |
|
2013
|
Analysing and compiling coroutines with abstract conjunctive partial deduction. Zbl 1353.68033
De Schreye, Danny; Nys, Vincent; Nicholson, Colin |
|
2015
|
Probabilistic legal reasoning in CHRiSM. Zbl 1286.68058
Sneyers, Jon; De Schreye, Danny; Frühwirth, Thom |
|
2013
|
Probabilistic termination of CHRiSM programs. Zbl 1377.68067
Sneyers, Jon; De Schreye, Danny |
|
2012
|
Improved termination analysis of CHR using self-sustainability analysis. Zbl 1377.68065
Pilozzi, Paolo; De Schreye, Danny |
|
2012
|
Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064
Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter |
|
2011
|
Non-termination analysis of logic programs with integer arithmetics. Zbl 1222.68068
Voets, Dean; De Schreye, Danny |
|
2011
|
Non-termination analysis of logic programs using types. Zbl 1326.68065
Voets, Dean; De Schreye, Danny |
|
2011
|
Logic-based program synthesis and transformation. 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009. Revised selected papers. Zbl 1186.68005
|
|
2010
|
Termination prediction for general logic programs. Zbl 1184.68162
Shen, Yi-Dong; de Schreye, Danny; Voets, Dean |
|
2009
|
A new approach to non-termination analysis of logic programs. Zbl 1251.68070
Voets, Dean; De Schreye, Danny |
|
2009
|
Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040
Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny |
|
2008
|
Termination analysis of CHR revisited. Zbl 1185.68176
Pilozzi, Paolo; De Schreye, Danny |
|
2008
|
Polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1165.68337
Nguyen, Manh Thang; De Schreye, Danny |
|
2005
|
On termination of meta-programs. Zbl 1092.68020
Serebrenik, Alexander; De Schreye, Danny |
|
2005
|
Termination of floating-point computations. Zbl 1102.65054
Serebrenik, Alexander; De Schreye, Danny |
|
2005
|
Inference of termination conditions for numerical loops in Prolog. Zbl 1088.68029
Serebrenik, Alexander; De Schreye, Danny |
|
2004
|
Acceptability with general orderings. Zbl 1012.68037
De Schreye, Danny; Serebrenik, Alexander |
|
2002
|
Termination proofs for logic programs with tabling. Zbl 1365.68153
Verbaeten, Sofie; De Schreye, Danny; Sagonas, Konstantinos |
|
2001
|
Inference of termination conditions for numerical loops in Prolog. Zbl 1275.68051
Serebrenik, Alexander; De Schreye, Danny |
|
2001
|
Non-transformational termination analysis of logic programs, based on general term-orderings. Zbl 1017.68033
Serebrenik, Alexander; De Schreye, Danny |
|
2001
|
Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Zbl 0944.68025
De Schreye, Danny; Glück, Robert; Jørgensen, Jesper; Leuschel, Michael; Martens, Bern; Sørensen, Morten Heine |
|
1999
|
Bottom-up partial deduction of logic programs. Zbl 0946.68012
Vanhoof, Wim; De Schreye, Danny; Martens, Bern |
|
1999
|
SLDNFA: An abductive procedure for abductive logic programs. Zbl 0905.68025
Denecker, Marc; De Schreye, Danny |
|
1998
|
Termination analysis: Some practical properties of the norm and level mapping space. Zbl 0949.68028
Decorte, Stefaan; De Schreye, Danny |
|
1998
|
Creating specialised integrity checks through partial evaluation of meta-interpreters. Zbl 0911.68028
Leuschel, Michael; De Schreye, Danny |
|
1998
|
On the relation between situation calculus and event calculus. Zbl 0883.68023
Van Belleghem, Kristof; Denecker, Marc; De Schreye, Danny |
|
1997
|
Automatic finite unfolding using well-founded measures. Zbl 0867.68023
Martens, Bern; De Schreye, Danny |
|
1996
|
Representing incomplete knowledge in abductive logic programming. Zbl 0832.68023
Denecker, Marc; De Schreye, Danny |
|
1995
|
Why untyped nonground metaprogramming is not (much of) a problem. Zbl 0829.68024
Martens, Bern; De Schreye, Danny |
|
1995
|
Termination of logic programs: The never-ending story. Zbl 0820.68029
De Schreye, Danny; Decorte, Stefaan |
|
1994
|
Sound and complete partial deduction with unfolding based on well-founded measures. Zbl 0801.68026
Martens, Bern; De Schreye, Danny; Horváth, Tamás |
|
1994
|
On the duality of abduction and model generation in a framework for model generation with equality. Zbl 0801.68024
Denecker, Marc; De Schreye, Danny |
|
1994
|
A general criterion for avoiding infinite unfolding during partial deduction. Zbl 0782.68024
Bruynooghe, Maurice; De Schreye, Danny; Martens, Bern |
|
1992
|
A framework for analysing the termination of definite logic programs with respect to call patterns. Zbl 0862.68016
De Schreye, Danny; Verschaetse, Kristof; Bruynooghe, Maurice |
|
1992
|
Sound and complete partial deduction with unfolding based on well-founded measures. Zbl 0862.68015
Martens, Bern; De Schreye, Danny; Bruynooghe, Maurice |
|
1992
|
On the duality of abduction and model generation. Zbl 0862.68019
Denecker, Marc; De Schreye, Danny |
|
1992
|
Compiling bottom-up and mixed derivations into top-down executable logic programs. Zbl 0733.68013
de Schreye, Danny; Martens, Bern; Sablon, Gunther; Bruynooghe, Maurice |
|
1991
|
Compiling control. Zbl 0668.68025
Bruynooghe, Maurice; de Schreye, Danny; Krekels, Bruno |
|
1989
|
On the existence of nonterminating queries for a restricted class of PROLOG-clauses. Zbl 0689.68114
de Schreye, Danny; Bruynooghe, Maurice; Verschaetse, Kristof |
|
1989
|
On the transformation of logic programs with instantiation based computation rules. Zbl 0669.68058
de Schreye, Danny; Bruynooghe, Maurice |
|
1989
|
Explanation based program transformation. Zbl 0708.68011
Bruynooghe, Maurice; De Raedt, Luc; De Schreye, Danny |
|
1989
|
Integrable-ergodic \(C^ *\)-dynamical systems on Abelian groups. Zbl 0608.46039
De Schreye, D. |
|
1985
|