| Publication | Date of Publication | Type |
|---|
| IntSat: integer linear programming by conflict-driven constraint learning | 2024-08-12 | Paper |
| Clausal rewriting | 2023-03-09 | Paper |
| A precedence-based total AC-compatible ordering | 2022-12-09 | Paper |
| On narrowing, refutation proofs and constraints | 2022-12-09 | Paper |
| AC-superposition with constraints: No AC-unifiers needed | 2020-01-21 | Paper |
| Dedam: A kernel of data structures and algorithms for automated deduction with equality clauses | 2019-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224684 | 2019-07-24 | Paper |
| Improving IntSat by expressing disjunctions of bounds as linear constraints | 2017-11-07 | Paper |
| Classes of term rewrite systems with polynomial confluence problems | 2017-07-12 | Paper |
| Deciding the confluence of ordered term rewrite systems | 2017-06-13 | Paper |
| Solving SAT and SAT Modulo Theories | 2015-12-04 | Paper |
| Curriculum-based course timetabling with SAT and MaxSAT | 2014-11-26 | Paper |
| A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints | 2014-05-12 | Paper |
| Harald Ganzinger’s Legacy: Contributions to Logics and Programming | 2013-04-19 | Paper |
| A New Look at BDDs for Pseudo-Boolean Constraints | 2012-12-03 | Paper |
| SAT and SMT Are Still Resolution: Questions and Challenges | 2012-09-05 | Paper |
| Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One | 2011-06-17 | Paper |
| BDDs for Pseudo-Boolean Constraints – Revisited | 2011-06-17 | Paper |
| Cardinality networks: a theoretical and empirical study | 2011-05-25 | Paper |
| A framework for certified Boolean branch-and-bound optimization | 2011-04-05 | Paper |
| Hard problems in max-algebra, control theory, hypergraphs and other areas | 2010-09-02 | Paper |
| Practical algorithms for unsatisfiability proof and core generation in SAT solvers | 2010-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3408132 | 2010-02-24 | Paper |
| Cardinality Networks and Their Applications | 2009-07-07 | Paper |
| Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates | 2009-07-07 | Paper |
| Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra | 2009-03-04 | Paper |
| The Max-Atom Problem and Its Relevance | 2009-01-27 | Paper |
| Efficient Generation of Unsatisfiability Proofs and Cores in SAT | 2009-01-27 | Paper |
| Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools | 2008-05-27 | Paper |
| Splitting on Demand in SAT Modulo Theories | 2008-05-27 | Paper |
| SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers | 2008-05-27 | Paper |
| Challenges in Satisfiability Modulo Theories | 2008-01-02 | Paper |
| On SAT Modulo Theories and Optimization Problems | 2007-09-04 | Paper |
| Fast congruence closure and extensions | 2007-04-16 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Constraint solving for term orderings compatible with abelian semigroups, monoids and groups | 2005-03-15 | Paper |
| Fast term indexing with coded context trees | 2004-08-16 | Paper |
| Superposition with completely built-in abelian groups | 2004-06-22 | Paper |
| Practical algorithms for deciding path ordering constraint satisfaction. | 2003-11-02 | Paper |
| Stratified resolution | 2003-08-25 | Paper |
| Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings | 2003-06-09 | Paper |
| Induction = I-axiomatization + first-order consistency. | 2003-01-14 | Paper |
| Paramodulation-based theorem proving | 2002-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539610 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539609 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762631 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518870 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938596 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936127 | 2000-01-24 | Paper |
| Decidability and complexity analysis by basic paramodulation | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264721 | 1999-10-10 | Paper |
| Paramodulation with built-in AC-theories and symbolic constraints | 1997-05-28 | Paper |
| A total AC-compatible ordering based on RPO | 1997-02-28 | Paper |
| Theorem proving with ordering and equality constrained clauses | 1995-09-04 | Paper |
| Simple LPO constraint solving methods | 1993-10-17 | Paper |
| Efficient deduction in equality Horn logic by Horn-completion | 1992-06-27 | Paper |
