| Publication | Date of Publication | Type |
|---|
| Justifications and a reconstruction of parity game solving algorithms | 2023-08-17 | Paper |
| Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory | 2022-09-30 | Paper |
| A freeness and sharing analysis of logic programs based on a pre-interpretation | 2022-02-16 | Paper |
| Improving parity game solvers with justifications | 2020-08-05 | Paper |
| Mining rooted ordered trees under subtree homeomorphism | 2019-05-03 | Paper |
| Symmetric explanation learning: effective dynamic symmetry handling for SAT | 2017-11-15 | Paper |
| Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3 | 2017-11-09 | Paper |
| On local domain symmetry for model expansion | 2017-11-09 | Paper |
| Logic programming revisited | 2017-06-13 | Paper |
| Improved Static Symmetry Breaking for SAT | 2016-09-05 | Paper |
| Constraint Propagation for First-Order Logic and Inductive Definitions | 2015-09-17 | Paper |
| Lazy Model Expansion: Interleaving Grounding with Search | 2015-03-04 | Paper |
| Simulating Dynamic Systems Using Linear Time Calculus Theories | 2014-11-25 | Paper |
| A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics | 2014-06-26 | Paper |
| Detection and exploitation of functional dependencies for model generation | 2014-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5398039 | 2014-02-25 | Paper |
| An approximative inference method for solving ∃∀SO satisfiability problems | 2012-12-03 | Paper |
| Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs | 2012-07-23 | Paper |
| The magic of logical inference in probabilistic programming | 2011-08-16 | Paper |
| Answer Set Programming’s Contributions to Classical Logic | 2011-05-19 | Paper |
| ProbLog Technology for Inference in a Probabilistic First Order Logic | 2011-05-11 | Paper |
| Coherent Composition of Distributed Knowledge-Bases through Abduction | 2011-05-06 | Paper |
| Binding-Time Annotations without Binding-Time Analysis | 2011-05-06 | Paper |
| A Fixed Point Semantics for Logic Programs Extended with Cuts | 2011-03-04 | Paper |
| FO(ID) as an extension of DL with rules | 2010-11-12 | Paper |
| A comparison of pruning criteria for probability trees | 2010-10-07 | Paper |
| Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic | 2010-10-01 | Paper |
| An Approximative Inference Method for Solving ∃ ∀SO Satisfiability Problems | 2010-10-01 | Paper |
| A Transformational Approach for Proving Properties of the CHR Constraint Store | 2010-05-04 | Paper |
| Learning directed probabilistic logical models: Ordering-search versus structure-search | 2009-09-18 | Paper |
| CP-logic: A language of causal probabilistic events and its relation to logic programming | 2009-08-19 | Paper |
| Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences | 2009-06-30 | Paper |
| Foundations of Information and Knowledge Systems | 2009-05-14 | Paper |
| Generalized ordering-search for learning directed probabilistic logical models | 2009-03-31 | Paper |
| Learning \((k,l)\)-contextual tree languages for information extraction from web pages | 2009-03-31 | Paper |
| From Monomorphic to Polymorphic Well-Typings and Beyond | 2009-03-24 | Paper |
| Distance-Based Repairs of Databases | 2008-10-30 | Paper |
| Representing Causal Information About a Probabilistic Process | 2008-10-30 | Paper |
| SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions | 2008-05-27 | Paper |
| Satisfiability Checking for PC(ID) | 2008-05-27 | Paper |
| Representation of Partial Knowledge and Query Answering in Locally Complete Databases | 2008-05-27 | Paper |
| Learning Directed Probabilistic Logical Models Using Ordering-Search | 2008-03-28 | Paper |
| Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning | 2008-03-28 | Paper |
| Predicate Introduction Under Stable and Well-Founded Semantics | 2008-03-11 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2007-11-07 | Paper |
| Distance semantics for database repair | 2007-10-23 | Paper |
| Counting integer points in parametric polytopes using Barvinok's rational functions | 2007-07-19 | Paper |
| Well-founded and stable semantics of logic programs with aggregates | 2007-04-19 | Paper |
| Inductive Logic Programming | 2006-11-01 | Paper |
| Static Analysis | 2006-10-31 | Paper |
| Programming Languages and Systems | 2006-10-20 | Paper |
| Computational methods for database repair by signed formulae | 2006-09-12 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2006-06-23 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2006-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715664 | 2006-01-04 | Paper |
| Program Development in Computational Logic | 2005-12-23 | Paper |
| Program Development in Computational Logic | 2005-12-23 | Paper |
| Logic Programming | 2005-08-26 | Paper |
| PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking | 2005-04-15 | Paper |
| Compact representation of knowledge bases in inductive logic programming | 2005-01-17 | Paper |
| Offline specialisation in Prolog using a hand-written compiler generator | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808812 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736995 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736507 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736514 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475099 | 2004-08-06 | Paper |
| Logic program specialisation through partial deduction: Control issues | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411979 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406033 | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707731 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767145 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499248 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506391 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312459 | 1999-07-29 | Paper |
| Exploiting goal independence in the analysis of logic programs | 1998-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688889 | 1997-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688890 | 1997-05-25 | Paper |
| On the design of a correct freeness analysis for logic programs | 1997-04-27 | Paper |
| Iterative versionspaces | 1996-02-26 | Paper |
| CHICA, An Abductive Planning System Based on Event Calculus | 1996-02-20 | Paper |
| Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation | 1994-05-09 | Paper |
| A general criterion for avoiding infinite unfolding during partial deduction | 1993-04-01 | Paper |
| Acquiring object-knowledge | 1993-01-16 | Paper |
| Interactive concept-learning and constructive induction by analogy | 1992-09-27 | Paper |
| Deriving descriptions of possible values of program variables by means of abstract interpretation | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983041 | 1992-06-26 | Paper |
| Compiling bottom-up and mixed derivations into top-down executable logic programs | 1991-01-01 | Paper |
| A practical framework for theabstract interpretation of 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/Q3201766 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490929 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493255 | 1989-01-01 | Paper |
| Compiling control | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880318 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911228 | 1980-01-01 | Paper |
