| Publication | Date of Publication | Type |
|---|
| A freeness and sharing analysis of logic programs based on a pre-interpretation | 2022-02-16 | Paper |
| Graphs with coloring redundant edges | 2021-08-16 | Paper |
| Redundant disequalities in the Latin square problem | 2015-06-15 | Paper |
| Lightweight dynamic symmetry breaking | 2015-04-29 | Paper |
| A method for detecting symmetries in constraint models and its generalisation | 2015-04-29 | Paper |
| Redundant Sudoku rules | 2014-05-30 | Paper |
| \textsc{Tor}: modular search with hookable disjunction | 2014-03-25 | Paper |
| Delimited continuations for Prolog | 2014-02-27 | Paper |
| Automatic implication checking for CHR constraints | 2013-12-04 | Paper |
| Representation sharing for Prolog | 2013-08-22 | Paper |
| On the implementation of the probabilistic logic programming language ProbLog | 2011-06-15 | Paper |
| Guard Reasoning in the Refined Operational Semantics of CHR | 2009-03-26 | Paper |
| A Flexible Search Framework for CHR | 2009-03-26 | Paper |
| CHR for Imperative Host Languages | 2009-03-26 | Paper |
| The Correspondence Between the Logical Algorithms Language and CHR | 2009-03-05 | Paper |
| On the Efficient Execution of ProbLog Programs | 2009-01-22 | Paper |
| Towards Typed Prolog | 2009-01-22 | Paper |
| Aggregates for CHR through Program Transformation | 2009-01-22 | Paper |
| Two WAM Implementations of Action Rules | 2009-01-22 | Paper |
| TCHR: a framework for tabled CLP | 2008-07-23 | Paper |
| A Novel Approach For Detecting Symmetries in CSP Models | 2008-05-27 | Paper |
| Improving Prolog programs: Refactoring for Prolog | 2008-03-27 | Paper |
| Memory Reuse for CHR | 2008-03-11 | Paper |
| Incremental copying garbage collection for WAM-based Prolog systems | 2007-10-09 | Paper |
| Fast Frequent Querying with Lazy Control Flow Compilation | 2007-07-12 | Paper |
| Improving PARMA trailing | 2007-02-13 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| Checking modes of HAL programs | 2006-01-03 | Paper |
| Program Development in Computational Logic | 2005-12-23 | Paper |
| 10.1162/153244304773936027 | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809164 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809154 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809166 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413059 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409151 | 2003-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537964 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533346 | 2002-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767143 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495068 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506394 | 2000-09-18 | Paper |
| On Delphi lemmas and other memoing techniques for deterministic logic programs | 1998-03-17 | Paper |
| Semantics-based program analysis for logic-based languages using XSB | 1998-01-01 | Paper |
| Partial translation: towards a portable and efficient prolog implementation technology | 1997-07-28 | Paper |
| Analyzing logic programs using “prop”-ositional logic programs and a magic wand | 1997-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281603 | 1994-07-28 | Paper |
| A fine-grained parallel memory compaction algorithm | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721645 | 1987-01-01 | Paper |
| The Purification of Completely Positive Maps | 1982-01-01 | Paper |
| Implementable positive maps on standard forms | 1980-01-01 | Paper |
| Completely positive quasi-free maps of the CCR-algebra | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3873015 | 1979-01-01 | Paper |
| Homogeneous perturbed classical states and equilibrium conditions | 1978-01-01 | Paper |
| Completely positive maps on the CCR-algebra | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4148394 | 1977-01-01 | Paper |
