| Publication | Date of Publication | Type |
|---|
| Compiling control as offline partial deduction | 2023-11-09 | Paper |
| Termination proofs for logic programs with tabling | 2017-06-13 | Paper |
| Abstract conjunctive partial deduction for the analysis and compilation of coroutines | 2017-02-14 | Paper |
| Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction | 2015-10-02 | Paper |
| Probabilistic legal reasoning in CHRiSM | 2014-02-27 | Paper |
| Improved Termination Analysis of CHR Using Self-sustainability Analysis | 2013-03-13 | Paper |
| Probabilistic Termination of CHRiSM Programs | 2013-03-13 | Paper |
| A New Approach to Non-termination Analysis of Logic Programs | 2012-11-13 | Paper |
| Polytool: Polynomial interpretations as a basis for termination analysis of logic programs | 2011-08-17 | Paper |
| Non-termination analysis of logic programs with integer arithmetics | 2011-08-16 | Paper |
| Non-termination Analysis of Logic Programs Using Types | 2011-05-27 | Paper |
| On Termination of Meta-programs | 2011-05-06 | Paper |
| Inference of Termination Conditions for Numerical Loops in Prolog | 2011-05-06 | Paper |
| Termination prediction for general logic programs | 2009-11-25 | Paper |
| Proving Termination by Invariance Relations | 2009-07-24 | Paper |
| Automating Termination Proofs for CHR | 2009-07-24 | Paper |
| Termination Analysis of Logic Programs Based on Dependency Graphs | 2009-01-22 | Paper |
| Termination Analysis of CHR Revisited | 2009-01-22 | Paper |
| Termination of floating-point computations | 2006-11-03 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| On termination of meta-programs | 2006-02-08 | Paper |
| Logic Based Program Synthesis and Transformation | 2005-12-27 | Paper |
| Inference of termination conditions for numerical loops in Prolog | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4421872 | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411956 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707739 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766778 | 2002-07-22 | Paper |
| Termination of simply-moded well-typed logic programs under a tabled execution mechanism | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494370 | 2001-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944879 | 2000-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518430 | 2000-11-28 | Paper |
| Conjunctive partial deduction: foundations, control, algorithms, and experiments | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506395 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944882 | 2000-03-22 | Paper |
| Compositionality of normal open logic programs | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940939 | 2000-02-28 | Paper |
| Creating specialised integrity checks through partial evaluation of meta-interpreters | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217937 | 1998-11-11 | Paper |
| SLDNFA: An abductive procedure for abductive logic programs | 1998-10-06 | Paper |
| On the relation between situation calculus and event calculus | 1997-10-23 | Paper |
| Automatic finite unfolding using well-founded measures | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688889 | 1997-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688890 | 1997-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688908 | 1997-05-25 | Paper |
| Representing Incomplete Knowledge in Abductive Logic Programming | 1996-02-20 | Paper |
| Why untyped nonground metaprogramming is not (much of) a problem | 1995-04-06 | Paper |
| Sound and complete partial deduction with unfolding based on well-founded measures | 1994-12-08 | Paper |
| On the duality of abduction and model generation in a framework for model generation with equality | 1994-11-29 | Paper |
| Termination of logic programs: the never-ending story | 1994-10-13 | Paper |
| A general criterion for avoiding infinite unfolding during partial deduction | 1993-04-01 | Paper |
| Compiling bottom-up and mixed derivations into top-down executable logic programs | 1991-01-01 | Paper |
| On the existence of nonterminating queries for a restricted class of PROLOG-clauses | 1989-01-01 | Paper |
| On the transformation of logic programs with instantiation based computation rules | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490929 | 1989-01-01 | Paper |
| Compiling control | 1989-01-01 | Paper |
