| On Preferred Abductive Explanations for Decision Trees and Random Forests | 0 | 0.34 | 2022 |
| A New Exact Solver for (Weighted) Max#SAT | 0 | 0.34 | 2022 |
| On Preferred Abductive Explanations for Decision Trees and Random Forests. | 0 | 0.34 | 2022 |
| On the explanatory power of Boolean decision trees. | 0 | 0.34 | 2022 |
| Trading Complexity for Sparsity in Random Forest Explanations. | 0 | 0.34 | 2022 |
| A hybrid CP/MOLS approach for multi-objective imbalanced classification | 0 | 0.34 | 2021 |
| SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers | 0 | 0.34 | 2020 |
| On Tractable XAI Queries based on Compiled Representations. | 0 | 0.34 | 2020 |
| On The Glucose Sat Solver | 2 | 0.37 | 2018 |
| A Distributed Version of Syrup. | 0 | 0.34 | 2017 |
| An Adaptive Parallel Sat Solver | 3 | 0.39 | 2016 |
| Extreme Cases in SAT Problems. | 3 | 0.47 | 2016 |
| Lazy Clause Exchange Policy for Parallel SAT Solvers. | 19 | 0.79 | 2014 |
| Impact of Community Structure on SAT Solver Performance. | 20 | 0.82 | 2014 |
| Améliorer SAT dans le cadre incrémental. | 0 | 0.34 | 2014 |
| Dolius: A Distributed Parallel SAT Solving Framework. | 2 | 0.38 | 2014 |
| Just-in-time compilation of knowledge bases | 3 | 0.39 | 2013 |
| Improving glucose for incremental SAT solving with assumptions: application to MUS extraction | 37 | 0.98 | 2013 |
| Refining restarts strategies for SAT and UNSAT | 21 | 0.75 | 2012 |
| Revisiting clause exchange in parallel SAT solving | 14 | 0.60 | 2012 |
| On freezing and reactivating learnt clauses | 21 | 0.86 | 2011 |
| Boosting local search thanks to CDCL | 10 | 0.56 | 2010 |
| Integrating Conflict Driven Clause Learning To Local Search | 2 | 0.37 | 2009 |
| Learning in Local Search | 5 | 0.42 | 2009 |
| Predicting learnt clauses quality in modern SAT solvers | 174 | 5.27 | 2009 |
| A Generalized Framework for Conflict Analysis | 24 | 1.72 | 2008 |
| Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms | 1 | 0.39 | 2008 |
| SAT graph-based representation: A new perspective | 1 | 0.38 | 2008 |
| GUNSAT: a greedy local search algorithm for unsatisfiability | 13 | 0.57 | 2007 |
| Circuit based encoding of CNF formula | 1 | 0.36 | 2007 |
| Symmetry breaking in quantified boolean formulae | 2 | 0.37 | 2007 |
| Predicting and Detecting Symmetries in FOL Finite Model Search | 4 | 0.45 | 2006 |
| Verifying Industrial Hybrid Systems with MathSAT | 59 | 2.50 | 2005 |
| A symbolic search based approach for quantified boolean formulas | 5 | 0.49 | 2005 |
| Dealing with Symmetries in Quantified Boolean Formulas | 4 | 0.44 | 2004 |
| SAT Based BDD Solver for Quantified Boolean Formulas | 8 | 0.48 | 2004 |
| Bounded Model Checking for Timed Systems | 65 | 2.73 | 2002 |
| Reasoning by Symmetry and Function Ordering in Finite Model Generation | 5 | 0.45 | 2002 |
| A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions | 92 | 6.73 | 2002 |
| Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements | 6 | 0.86 | 2002 |
| Etude des symétries dans les modèles finis | 0 | 0.34 | 2001 |
| The eXtended Least Number Heuristic | 9 | 0.69 | 2001 |
| Two Techniques to Improve Finite Model Search | 2 | 0.49 | 2000 |
| AVAL: An Enumerative Method for SAT | 3 | 0.44 | 2000 |
