Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. - Thierry Castell; Claudette Cayrol; Michel Cayrol; Daniel Le Berre (ECAI, 1996)

Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. - Leila Amgoud; Claudette Cayrol; Daniel Le Berre (ICTAI, 1996)

Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. - Didier Dubois; Daniel Le Berre; Henri Prade; Régis Sabbadin (AAAI/IAAI, 1998)

Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. - Didier Dubois; Daniel Le Berre; Henri Prade; Régis Sabbadin (Fundam. Informaticae, 1999)

Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications). - Daniel Le Berre (2000)

Weakening Conflicting Information for Iterated Revision and Knowledge Integration. - Salem Benferhat; Souhila Kaci; Daniel Le Berre; Mary-Anne Williams (IJCAI, 2001)

Exploiting the real power of unit propagation lookahead. - Daniel Le Berre (Electron. Notes Discret. Math., 2001)

Qualitative Choice Logic. - Gerhard Brewka; Salem Benferhat; Daniel Le Berre (KR, 2002)

The Essentials of the SAT 2003 Competition. - Daniel Le Berre; Laurent Simon 001 (SAT, 2003)

Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. - Daniel Le Berre; Laurent Simon 001; Armando Tacchella (SAT, 2003)

The Second QBF Solvers Comparative Evaluation. - Daniel Le Berre; Massimo Narizzano; Laurent Simon 001; Armando Tacchella (SAT (Selected Papers, 2004)

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. - Daniel Le Berre; Laurent Simon 001 (SAT (Selected Papers, 2004)

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe; Pierre Marquis (AAAI, 2005)

A Branching Heuristics for Quantified Renamable Horn Formulas. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe (SAT, 2005)

A parsimony tree for the SAT2002 competition. - Paul W. Purdom; Daniel Le Berre; Laurent Simon 001 (Ann. Math. Artif. Intell., 2005)

The SAT2002 competition. - Laurent Simon 001; Daniel Le Berre; Edward A. Hirsch (Ann. Math. Artif. Intell., 2005)

An Alternative Inference for Qualitative Choice Logic. - Salem Benferhat; Daniel Le Berre; Karima Sedki (ECAI, 2006)

Representing Policies for Quantified Boolean Formulae. - Sylvie Coste-Marquis; Hélène Fargier; Jérôme Lang; Daniel Le Berre; Pierre Marquis (KR, 2006)

Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. - Daniel Le Berre; Laurent Simon 001 (J. Satisf. Boolean Model. Comput., 2006)

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe; Pierre Marquis (J. Satisf. Boolean Model. Comput., 2006)

Handling Qualitative Preferences Using Normal Form Functions. - Salem Benferhat; Daniel Le Berre; Karima Sedki (FLAIRS, 2007)

On SAT Technologies for Dependency Management and Beyond. - Daniel Le Berre; Anne Parrain (SPLC (2), 2008)

Aggregating Interval Orders by Propositional Optimization. - Daniel Le Berre; Pierre Marquis; Meltem Öztürk (ADT, 2009)

Sat4j, un moteur libre de raisonnement en logique propositionnelle. (Sat4j, an open reasoning platform for propositional reasoning). - Daniel Le Berre (2010)

Solving Linux Upgradeability Problems Using Boolean Optimization - Josep Argelich; Daniel Le Berre; Inês Lynce; João Marques-Silva 001; Pascal Rapicault (LoCoCo, 2010)

The Sat4j library, release 2.2. - Daniel Le Berre; Anne Parrain (J. Satisf. Boolean Model. Comput., 2010)

The International SAT Solver Competitions. - Matti Järvisalo; Daniel Le Berre; Olivier Roussel; Laurent Simon 001 (AI Mag., 2012)

Planning Personalised Museum Visits. - Daniel Le Berre; Pierre Marquis; Stéphanie Roussel 001 (ICAPS, 2013)

Computing prime implicants. - David Déharbe; Pascal Fontaine; Daniel Le Berre; Bertrand Mazure (FMCAD, 2013)

Automatic repair of buggy if conditions and missing preconditions with SMT. - Favio Demarco; Jifeng Xuan; Daniel Le Berre; Martin Monperrus (CSTVA, 2014)

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. - Takehide Soh; Daniel Le Berre; Stéphanie Roussel 001; Mutsunori Banbara; Naoyuki Tamura (JELIA, 2014)

Detecting Cardinality Constraints in CNF. - Armin Biere; Daniel Le Berre; Emmanuel Lonca; Norbert Manthey (SAT, 2014)

Consistency checking for the evolution of cardinality-based feature models. - Clément Quinton; Andreas Pleuss; Daniel Le Berre; Laurence Duchien; Goetz Botterweck (SPLC, 2014)

Some thoughts about benchmarks for NMR. - Daniel Le Berre (CoRR, 2014)

On the Complexity of Optimization Problems based on Compiled NNF Representations. - Daniel Le Berre; Emmanuel Lonca; Pierre Marquis (CoRR, 2014)

Sat4j 2.3.2: on the fly solver configuration System Description. - Daniel Le Berre; Stéphanie Roussel 001 (J. Satisf. Boolean Model. Comput., 2014)

Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne. - Daniel Le Berre; Emmanuel Lonca (Rev. d'Intelligence Artif., 2014)

Automated metamorphic testing of variability analysis tools. - Sergio Segura; Amador Durán 001; Ana Belén Sánchez; Daniel Le Berre; Emmanuel Lonca; Antonio Ruiz Cortés (Softw. Test. Verification Reliab., 2015)

On Checking Kripke Models for Modal Logic K. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (PAAR@IJCAR, 2016)

Fixed-Parameter Tractable Optimization Under DNNF Constraints. - Frédéric Koriche; Daniel Le Berre; Emmanuel Lonca; Pierre Marquis (ECAI, 2016)

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. - Thomas Caridroit; Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (AAAI, 2017)

Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. - Takehide Soh; Mutsunori Banbara; Naoyuki Tamura; Daniel Le Berre (CP, 2017)

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAI, 2017)

Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. - Jifeng Xuan; Matias Martinez; Favio Demarco; Maxime Clement; Sebastian R. Lamelas Marcote; Thomas Durieux; Daniel Le Berre; Martin Monperrus (IEEE Trans. Software Eng., 2017)

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAR, 2018)

Pseudo-Boolean Constraints from a Knowledge Representation Perspective. - Daniel Le Berre; Pierre Marquis; Stefan Mengel; Romain Wallon (IJCAI, 2018)

A SAT-Based Approach For PSPACE Modal Logics. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (KR, 2018)

Boolean-Based Dependency Management for the Eclipse Ecosystem. - Daniel Le Berre; Pascal Rapicault (Int. J. Artif. Intell. Tools, 2018)

On Irrelevant Literals in Pseudo-Boolean Constraint Learning. - Daniel Le Berre; Pierre Marquis; Stefan Mengel; Romain Wallon (IJCAI, 2020)

On Weakening Strategies for PB Solvers. - Daniel Le Berre; Pierre Marquis; Romain Wallon (SAT, 2020)

On Dedicated CDCL Strategies for PB Solvers. - Daniel Le Berre; Romain Wallon (SAT, 2021)

Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach. - Xhevahire Tërnava; Johann Mortara; Philippe Collet; Daniel Le Berre (Autom. Softw. Eng., 2022)

SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. - Takehide Soh; Morgan Magnin; Daniel Le Berre; Mutsunori Banbara; Naoyuki Tamura (BIOINFORMATICS, 2023)

SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. - Takehide Soh; Morgan Magnin; Daniel Le Berre; Mutsunori Banbara; Naoyuki Tamura (CMSB, 2023)

Compressing UNSAT Search Trees with Caching. - Anthony Blomme; Daniel Le Berre; Anne Parrain; Olivier Roussel (ICAART (3), 2023)

The Silent (R)evolution of SAT. - Johannes Klaus Fichte; Daniel Le Berre; Markus Hecher; Stefan Szeider (Commun. ACM, 2023)

Compressing UNSAT CDCL Trees with Caching. - Anthony Blomme; Daniel Le Berre; Anne Parrain; Olivier Roussel (ICAART (3), 2024)

Stereoisomers Are Not Machine Learning's Best Friends. - Gökhan Tahil; Fabien Delorme; Daniel Le Berre; Éric Monflier; Adlane Sayede; Sébastien Tilloy (J. Chem. Inf. Model., 2024)

Practically Feasible Proof Logging for Pseudo-Boolean Optimization. - Wietze Koops; Daniel Le Berre; Magnus O. Myreen; Jakob Nordström; Andy Oertel; Yong Kiam Tan; Marc Vinyals (CP, 2025)

A SAT-based Method for Counting All Singleton Attractors in Boolean Networks. - Rei Higuchi; Takehide Soh; Daniel Le Berre; Morgan Magnin; Mutsunori Banbara; Naoyuki Tamura (IJCAI, 2025)

SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. - Ryoga Ohashi; Takehide Soh; Daniel Le Berre; Hidetomo Nabeshima; Mutsunori Banbara; Katsumi Inoue; Naoyuki Tamura (SAT, 2025)