| Publication | Date of Publication | Type |
|---|
| On computing probabilistic abductive explanations | 2023-07-18 | Paper |
| Tractability of explaining classifier decisions | 2023-06-19 | Paper |
| On Tackling Explanation Redundancy in Decision Trees | 2022-10-18 | Paper |
| SAT-based rigorous explanations for decision lists | 2022-03-22 | Paper |
| Assessing progress in SAT solvers through the Lens of incremental SAT | 2022-03-22 | Paper |
| RC2: an Efficient MaxSAT Solver | 2021-12-09 | Paper |
| Propositional proof systems based on maximum satisfiability | 2021-11-02 | Paper |
| Reasoning about strong inconsistency in ASP | 2021-04-07 | Paper |
| Optimum stable model search: algorithms and implementation | 2020-08-05 | Paper |
| On computing the union of MUSes | 2020-05-20 | Paper |
| DRMaxSAT with MaxHS: first contact | 2020-05-20 | Paper |
| Assessing heuristic machine learning explanations with model counting | 2020-05-20 | Paper |
| Efficient symmetry breaking for SAT-based minimum DFA inference | 2019-12-04 | Paper |
| Formally verifying the solution to the Boolean Pythagorean triples problem | 2019-09-02 | Paper |
| A SAT-based approach to learn explainable decision sets | 2018-10-18 | Paper |
| Computing with SAT oracles: past, present and future | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583686 | 2018-09-03 | Paper |
| PySAT: a Python toolkit for prototyping with SAT oracles | 2018-08-10 | Paper |
| Propositional SAT Solving | 2018-07-20 | Paper |
| GRASP: a search algorithm for propositional satisfiability | 2018-07-09 | Paper |
| Minimal sets on propositional formulae. Problems and reductions | 2017-11-21 | Paper |
| On tackling the limits of resolution in SAT solving | 2017-11-15 | Paper |
| Improving MCS enumeration via caching | 2017-11-15 | Paper |
| Maximal falsifiability | 2017-11-08 | Paper |
| Algorithms for computing backbones of propositional formulae | 2017-11-07 | Paper |
| MaxSAT-based encodings for Group MaxSAT | 2017-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283008 | 2017-07-18 | Paper |
| Efficient Reasoning for Inconsistent Horn Formulae | 2016-11-30 | Paper |
| MCS Extraction with Sublinear Oracle Queries | 2016-09-05 | Paper |
| BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies | 2016-09-05 | Paper |
| Fast, flexible MUS enumeration | 2016-04-20 | Paper |
| Quantified maximum satisfiability | 2016-04-20 | Paper |
| Solving QBF with counterexample guided refinement | 2016-03-08 | Paper |
| On the query complexity of selecting minimal sets for monotone predicates | 2016-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2786909 | 2016-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2786910 | 2016-02-23 | Paper |
| Computing Maximal Autarkies with Few and Simple Oracle Queries | 2015-11-20 | Paper |
| SAT-Based Formula Simplification | 2015-11-20 | Paper |
| Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing | 2015-11-20 | Paper |
| SAT-Based Horn Least Upper Bounds | 2015-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3194802 | 2015-10-20 | Paper |
| Iterative and core-guided maxsat solving: a survey and assessment | 2015-06-15 | Paper |
| Expansion-based QBF solving versus Q-resolution | 2015-04-01 | Paper |
| Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form | 2015-01-14 | Paper |
| Algorithms for computing minimal equivalent subformulas | 2014-10-13 | Paper |
| MUS Extraction Using Clausal Proofs | 2014-09-26 | Paper |
| On Computing Preferred MUSes and MCSes | 2014-09-26 | Paper |
| On Reducing Maximum Independent Set to Minimum Satisfiability | 2014-09-26 | Paper |
| SAT-Based Preprocessing for MaxSAT | 2014-01-17 | Paper |
| Maximal Falsifiability | 2014-01-17 | Paper |
| On QBF Proofs and Preprocessing | 2014-01-17 | Paper |
| Interpolant Learning and Reuse in SAT-Based Model Checking | 2013-12-06 | Paper |
| Solving QBF with Counterexample Guided Refinement | 2013-08-12 | Paper |
| Improvements to Core-Guided Binary Search for MaxSAT | 2013-08-12 | Paper |
| On Efficient Computation of Variable MUSes | 2013-08-12 | Paper |
| Formula Preprocessing in MUS Extraction | 2013-08-05 | Paper |
| On Propositional QBF Expansions and Q-Resolution | 2013-08-05 | Paper |
| Parallel MUS Extraction | 2013-08-05 | Paper |
| Quantified Maximum Satisfiability: | 2013-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904223 | 2013-01-28 | Paper |
| Towards efficient MUS extraction | 2012-10-25 | Paper |
| Knowledge Compilation with Empowerment | 2012-06-15 | Paper |
| Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information | 2012-06-08 | Paper |
| Boolean lexicographic optimization: algorithms \& applications | 2012-05-23 | Paper |
| Restoring CSP Satisfiability with MaxSAT | 2011-11-22 | Paper |
| Haplotype inference with pseudo-Boolean optimization | 2011-06-22 | Paper |
| Minimally Unsatisfiable Boolean Circuits | 2011-06-17 | Paper |
| On Improving MUS Extraction Algorithms | 2011-06-17 | Paper |
| Abstraction-Based Algorithm for 2QBF | 2011-06-17 | Paper |
| Empirical Study of the Anatomy of Modern Sat Solvers | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005895 | 2011-06-10 | Paper |
| On Computing Backbones of Propositional Theories | 2011-05-11 | Paper |
| Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription | 2010-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574331 | 2010-07-09 | Paper |
| A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas | 2009-11-16 | Paper |
| Progress in Artificial Intelligence | 2009-08-07 | Paper |
| Algorithms for Weighted Boolean Optimization | 2009-07-07 | Paper |
| Symmetry Breaking for Maximum Satisfiability | 2009-01-27 | Paper |
| Model checking with Boolean Satisfiability | 2008-09-29 | Paper |
| Boosting haplotype inference with local search | 2008-09-02 | Paper |
| Towards Robust CNF Encodings of Cardinality Constraints | 2008-09-02 | Paper |
| Improvements to Hybrid Incremental SAT Algorithms | 2008-05-27 | Paper |
| Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms | 2008-05-27 | Paper |
| Efficient Haplotype Inference with Pseudo-boolean Optimization | 2007-11-29 | Paper |
| Counting Models in Integer Domains | 2007-09-04 | Paper |
| Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel | 2007-09-04 | Paper |
| Random backtracking in backtrack search algorithms for satisfiability | 2007-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429164 | 2007-03-30 | Paper |
| Heuristic-based backtracking relaxation for propositional satisfiability | 2007-01-24 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Efficient data structures for backtrack search SAT solvers | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475702 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736486 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473048 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473057 | 2004-08-04 | Paper |
| Satisfiability-based algorithms for Boolean optimization | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424861 | 2003-09-07 | Paper |
| An overview of backtrack search satisfiability algorithms | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741524 | 2001-09-24 | Paper |
