| Publication | Date of Publication | Type |
|---|
| Towards a compact SAT-based encoding of itemset mining tasks | 2022-03-21 | Paper |
| A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games | 2021-04-20 | Paper |
| SAT-based models for overlapping community detection in networks | 2020-07-30 | Paper |
| Efficient SAT-Based Encodings of Conditional Cardinality Constraints | 2019-07-04 | Paper |
| From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4576231 | 2018-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4576226 | 2018-07-12 | Paper |
| Quantifying conflicts in propositional logic through prime implicates | 2017-11-16 | Paper |
| About some UP-based polynomial fragments of SAT | 2017-03-06 | Paper |
| Mining top-\(k\) motifs with a SAT-based framework | 2017-02-22 | Paper |
| What we can learn from conflicts in propositional satisfiability | 2016-07-22 | Paper |
| Deterministic parallel DPLL | 2016-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457225 | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457246 | 2015-12-11 | Paper |
| Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form | 2015-01-14 | Paper |
| Learning from conflicts in propositional satisfiability | 2012-06-13 | Paper |
| On Freezing and Reactivating Learnt Clauses | 2011-06-17 | Paper |
| Boosting Local Search Thanks to cdcl | 2010-10-12 | Paper |
| Efficient combination of decision procedures for MUS computation | 2010-01-07 | Paper |
| Reasoning from last conflict(s) in constraint programming | 2009-12-21 | Paper |
| ManySAT: a parallel SAT solver | 2009-10-26 | Paper |
| Eliminating Redundant Clauses in SAT Instances | 2009-03-10 | Paper |
| Circuit Based Encoding of CNF Formula | 2009-03-10 | Paper |
| SAT graph-based representation: A new perspective | 2008-09-29 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Using Boolean Constraint Propagation for Sub-clauses Deduction | 2008-09-09 | Paper |
| Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance | 2008-09-02 | Paper |
| A Generalized Framework for Conflict Analysis | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457274 | 2008-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457275 | 2008-04-14 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475662 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4546713 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409859 | 2003-07-01 | Paper |
| Checking depth-limited consistency and inconsistency in knowledge-based systems | 2002-05-07 | Paper |
| PRACTICAL INCONSISTENCY MANAGEMENT FOR CRITICAL-TASKS DECISION-SUPPORT SYSTEMS | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942636 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264722 | 1999-10-10 | Paper |
| Boosting complete techniques thanks to local search methods | 1998-11-25 | Paper |
| Tractability through symmetries in propositional calculus | 1994-08-31 | Paper |
