| Publication | Date of Publication | Type |
|---|
Feature necessity and relevancy in machine learning explanations
Journal of Automated Reasoning | 2026-03-31 | Paper |
On the failings of Shapley values for explainability
International Journal of Approximate Reasoning | 2024-07-24 | Paper |
Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
International Journal of Approximate Reasoning | 2024-07-24 | Paper |
| Feature necessity \& relevancy in ML classifier explanations | 2023-12-13 | Paper |
| Certified logic-based explainable AI -- the case of monotonic classifiers | 2023-12-12 | Paper |
On computing probabilistic abductive explanations
International Journal of Approximate Reasoning | 2023-07-18 | Paper |
Tractability of explaining classifier decisions
Artificial Intelligence | 2023-06-19 | Paper |
On Tackling Explanation Redundancy in Decision Trees
Journal of Artificial Intelligence Research | 2022-10-18 | Paper |
| Assessing progress in SAT solvers through the Lens of incremental SAT | 2022-03-22 | Paper |
SAT-based rigorous explanations for decision lists
(available as arXiv preprint) | 2022-03-22 | Paper |
RC2: an efficient MaxSAT solver
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
Propositional proof systems based on maximum satisfiability
Artificial Intelligence | 2021-11-02 | Paper |
| Reasoning about strong inconsistency in ASP | 2021-04-07 | Paper |
Optimum stable model search: algorithms and implementation
Journal Of Logic And Computation | 2020-08-05 | Paper |
| On computing the union of MUSes | 2020-05-20 | Paper |
| Assessing heuristic machine learning explanations with model counting | 2020-05-20 | Paper |
| DRMaxSAT with MaxHS: first contact | 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
Journal of Automated Reasoning | 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 |
| Computing minimally unsatisfiable subformulas: state of the art and future directions | 2018-09-03 | Paper |
| PySAT: a Python toolkit for prototyping with SAT oracles | 2018-08-10 | Paper |
Propositional SAT solving
Handbook of Model Checking | 2018-07-20 | Paper |
GRASP: a search algorithm for propositional satisfiability
IEEE Transactions on Computers | 2018-07-09 | Paper |
Minimal sets on propositional formulae. Problems and reductions
Artificial Intelligence | 2017-11-21 | Paper |
| Improving MCS enumeration via caching | 2017-11-15 | Paper |
On tackling the limits of resolution in SAT solving
(available as arXiv preprint) | 2017-11-15 | Paper |
Maximal falsifiability. Definitions, algorithms and applications
AI Communications | 2017-11-08 | Paper |
Algorithms for computing backbones of propositional formulae
AI Communications | 2017-11-07 | Paper |
MaxSAT-based encodings for Group MaxSAT
AI Communications | 2017-11-07 | Paper |
| Progression in maximum satisfiability | 2017-07-18 | Paper |
Efficient reasoning for inconsistent Horn formulae
Logics in Artificial Intelligence | 2016-11-30 | Paper |
BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
MCS Extraction with Sublinear Oracle Queries
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Fast, flexible MUS enumeration
Constraints | 2016-04-20 | Paper |
Quantified maximum satisfiability
Constraints | 2016-04-20 | Paper |
Solving QBF with counterexample guided refinement
Artificial Intelligence | 2016-03-08 | Paper |
On the query complexity of selecting minimal sets for monotone predicates
Artificial Intelligence | 2016-03-08 | Paper |
PackUp: tools for package upgradability solving
Journal of Satisfiability, Boolean Modeling and Computation | 2016-02-23 | Paper |
TG-Pro: A SAT-based ATPG system
Journal of Satisfiability, Boolean Modeling and Computation | 2016-02-23 | Paper |
Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Computing maximal autarkies with few and simple oracle queries
Lecture Notes in Computer Science | 2015-11-20 | Paper |
SAT-Based Horn Least Upper Bounds
Lecture Notes in Computer Science | 2015-11-20 | Paper |
SAT-Based Formula Simplification
Lecture Notes in Computer Science | 2015-11-20 | Paper |
| MUSer2: an efficient MUS extractor | 2015-10-20 | Paper |
Iterative and core-guided maxsat solving: a survey and assessment
Constraints | 2015-06-15 | Paper |
Expansion-based QBF solving versus Q-resolution
Theoretical Computer Science | 2015-04-01 | Paper |
Enumerating prime implicants of propositional formulae in conjunctive normal form
Logics in Artificial Intelligence | 2015-01-14 | Paper |
Algorithms for computing minimal equivalent subformulas
Artificial Intelligence | 2014-10-13 | Paper |
On computing preferred MUSes and MCSes
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On reducing maximum independent set to minimum satisfiability
Lecture Notes in Computer Science | 2014-09-26 | Paper |
MUS Extraction Using Clausal Proofs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
SAT-based preprocessing for MaxSAT
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
On QBF Proofs and Preprocessing
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Maximal falsifiability. Definitions, algorithms, and applications
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Interpolant learning and reuse in SAT-based model checking
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Solving QBF with counterexample guided refinement
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Improvements to core-guided binary search for MaxSAT
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
On efficient computation of variable MUSes
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Parallel MUS extraction
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
On propositional QBF expansions and Q-resolution
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Quantified maximum satisfiability: a core-guided approach
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Formula preprocessing in MUS extraction
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
| Anatomy and empirical evaluation of modern SAT solvers | 2013-01-28 | Paper |
Towards efficient MUS extraction
AI Communications | 2012-10-25 | Paper |
Knowledge compilation with empowerment
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Efficient and accurate haplotype inference by combining parsimony and pedigree information
Algebraic and Numeric Biology | 2012-06-08 | Paper |
Boolean lexicographic optimization: algorithms \& applications
Annals of Mathematics and Artificial Intelligence | 2012-05-23 | Paper |
Restoring CSP satisfiability with MaxSAT
Fundamenta Informaticae | 2011-11-22 | Paper |
Haplotype inference with pseudo-Boolean optimization
Annals of Operations Research | 2011-06-22 | Paper |
Abstraction-based algorithm for 2QBF
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Minimally unsatisfiable Boolean circuits
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
On improving MUS extraction algorithms
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Empirical study of the anatomy of modern SAT solvers
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| Combinatorial optimization solutions for the maximum quartet consistency problem | 2011-06-10 | Paper |
| On computing backbones of propositional theories | 2011-05-11 | Paper |
Counterexample guided abstraction refinement algorithm for propositional circumscription
Logics in Artificial Intelligence | 2010-10-01 | Paper |
| Boolean satisfiability and EDA applications | 2010-07-09 | Paper |
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
Constraints | 2009-11-16 | Paper |
Progress in Artificial Intelligence
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms for Weighted Boolean Optimization
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Symmetry Breaking for Maximum Satisfiability
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Model checking with Boolean Satisfiability
Journal of Algorithms | 2008-09-29 | Paper |
Towards Robust CNF Encodings of Cardinality Constraints
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Boosting haplotype inference with local search
Constraints | 2008-09-02 | Paper |
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Improvements to Hybrid Incremental SAT Algorithms
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Efficient Haplotype Inference with Pseudo-boolean Optimization
Algebraic Biology | 2007-11-29 | Paper |
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Counting Models in Integer Domains
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics | 2007-08-23 | Paper |
| On using cutting planes in pseudo-Boolean optimization | 2007-03-30 | Paper |
Heuristic-based backtracking relaxation for propositional satisfiability
Journal of Automated Reasoning | 2007-01-24 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Efficient data structures for backtrack search SAT solvers
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2084763 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2085252 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2080328 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080337 (Why is no real title available?) | 2004-08-04 | Paper |
Satisfiability-based algorithms for Boolean optimization
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 1975619 (Why is no real title available?) | 2003-09-07 | Paper |
An overview of backtrack search satisfiability algorithms
Annals of Mathematics and Artificial Intelligence | 2003-03-10 | Paper |
| Stochastic systematic search algorithms for satisfiability | 2001-09-24 | Paper |
