| Publication | Date of Publication | Type |
|---|
| Breaking symmetries with high dimensional graph invariants and their combination | 2023-10-04 | Paper |
| Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs | 2022-07-07 | Paper |
| Constraints for symmetry breaking in graph representation | 2019-10-25 | Paper |
| Sorting networks: to the end and back again | 2019-06-25 | Paper |
| Efficient analysis of concurrent constraint logic programs | 2019-03-29 | Paper |
| Breaking symmetries with lex implications | 2018-07-09 | Paper |
| Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) | 2017-11-09 | Paper |
| Graphs with girth at least 5 with orders between 20 and 32 | 2017-08-22 | Paper |
| Breaking symmetries in graph search with canonizing sets | 2017-08-16 | Paper |
| Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking | 2017-08-16 | Paper |
| Optimal-depth sorting networks | 2016-11-14 | Paper |
| Sorting Networks: The End Game | 2016-04-08 | Paper |
| Sorting nine inputs requires twenty-five comparisons | 2015-12-30 | Paper |
| A Novel SAT-Based Approach to Model Based Diagnosis | 2014-11-13 | Paper |
| Simplifying Pseudo-Boolean Constraints in Residual Number Systems | 2014-09-26 | Paper |
| SAT solving for termination proofs with recursive path orders and dependency pairs | 2013-08-01 | Paper |
| Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems | 2013-04-09 | Paper |
| Compiling finite domain constraints to SAT withBEE | 2013-03-13 | Paper |
| SAT-based termination analysis using monotonicity constraints over the integers | 2011-08-16 | Paper |
| Optimal Base Encodings for Pseudo-Boolean Constraints | 2011-05-19 | Paper |
| Inferring Termination Conditions for Logic Programs Using Backwards Analysis | 2011-05-06 | Paper |
| Pairwise Cardinality Networks | 2011-01-07 | Paper |
| Lazy Abstraction for Size-Change Termination | 2010-10-12 | Paper |
| Propagation via lazy clause generation | 2009-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3620437 | 2009-04-14 | Paper |
| Proving Termination with (Boolean) Satisfaction | 2009-01-22 | Paper |
| Solving Partial Order Constraints for LPO Termination | 2008-09-25 | Paper |
| Proving Termination Using Recursive Path Orders and SAT Solving | 2008-09-16 | Paper |
| Propagation = Lazy Clause Generation | 2008-09-02 | Paper |
| SAT Solving for Argument Filterings | 2008-05-27 | Paper |
| A SAT-Based Approach to Size Change Termination with Global Ranking Functions | 2008-04-11 | Paper |
| Logic programming with satisfiability | 2008-01-21 | Paper |
| Programming Languages and Systems | 2007-05-02 | Paper |
| Oracle semantics for Prolog | 2006-10-10 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| Inferring termination conditions for logic programs using backwards analysis | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736992 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736509 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475099 | 2004-08-06 | Paper |
| Worst-case groundness analysis using definite Boolean functions | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414727 | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411979 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537504 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763688 | 2002-01-21 | Paper |
| A semantic basis for the termination analysis of logic programs | 2000-11-22 | Paper |
| A simple polynomial groundness analysis for logic programs | 2000-10-10 | Paper |
| Type dependencies for logic programs using ACI-unification | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495072 | 2000-08-10 | Paper |
| Improving program analyses, by structure untupling | 2000-05-07 | Paper |
| An algebraic approach to sharing analysis of logic programs | 2000-02-06 | Paper |
| Efficient goal directed bottom-up evaluation of logic programs | 2000-01-04 | Paper |
| Worst-case groundness analysis using positive Boolean functions | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217938 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364368 | 1998-06-11 | Paper |
| A confluent semantic basis for the analysis of concurrent constraint logic programs | 1998-03-17 | Paper |
| Exploiting goal independence in the analysis of logic programs | 1998-03-16 | Paper |
| Semantics-based program analysis for logic-based languages using XSB | 1998-01-01 | Paper |
| On the design of a correct freeness analysis for logic programs | 1997-04-27 | Paper |
| Analyzing logic programs using “prop”-ositional logic programs and a magic wand | 1997-04-17 | Paper |
| Proving implications by algebraic approximation | 1997-02-27 | Paper |
| Bottom-up abstract interpretation of logic programs | 1994-04-05 | Paper |
| Modelling Prolog Control | 1994-03-27 | Paper |
| Specialisation of Prolog and FCP programs using abstract interpretation | 1988-01-01 | Paper |
| Compiling OR-parallelism into AND-parallelism | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727368 | 1986-01-01 | Paper |
