Daniel Le Berre
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
38
Venues
14
Active years
1996–2026
Best venue rank
A*
Where they publish
Papers
38 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICAART | Not All Countermodels Are Equal. | Daniel Crowley, Daniel Le Berre, Yakoub Salhi |
| 2025 | CP | Practically Feasible Proof Logging for Pseudo-Boolean Optimization. | Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordstrm, Andy Oertel, Yong Kiam Tan, Marc Vinyals |
| 2025 | IJCAI | 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 |
| 2025 | ICTAI | A Framework for Hybrid Set-Theoretic and Numerical Problem Solving. | Daniel Crowley, Daniel Le Berre, Olivier Roussel, Yakoub Salhi |
| 2025 | SAT | 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 |
| 2024 | ICAART | Compressing UNSAT CDCL Trees with Caching. | Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel |
| 2023 | ICAART | Compressing UNSAT Search Trees with Caching. | Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel |
| 2021 | SAT | On Dedicated CDCL Strategies for PB Solvers. | Daniel Le Berre, Romain Wallon |
| 2020 | IJCAI | On Irrelevant Literals in Pseudo-Boolean Constraint Learning. | Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon |
| 2020 | SAT | On Weakening Strategies for PB Solvers. | Daniel Le Berre, Pierre Marquis, Romain Wallon |
| 2018 | CADE | An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. | Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail |
| 2018 | IJCAI | Pseudo-Boolean Constraints from a Knowledge Representation Perspective. | Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon |
| 2018 | KR | A SAT-Based Approach For PSPACE Modal Logics. | Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail |
| 2017 | AAAI | 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 |
| 2017 | CP | Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. | Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre |
| 2017 | IJCAI | A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. | Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail |
| 2016 | CADE | On Checking Kripke Models for Modal Logic K. | Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail |
| 2016 | ECAI | Fixed-Parameter Tractable Optimization Under DNNF Constraints. | Frdric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis |
| 2014 | ICSE | Automatic repair of buggy if conditions and missing preconditions with SMT. | Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus |
| 2014 | JELIA | Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. | Takehide Soh, Daniel Le Berre, Stphanie Roussel, Mutsunori Banbara, Naoyuki Tamura |
| 2014 | SAT | Detecting Cardinality Constraints in CNF. | Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey |
| 2014 | SPLC | Consistency checking for the evolution of cardinality-based feature models. | Clment Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck |
| 2013 | FMCAD | Computing prime implicants. | David Dharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure |
| 2008 | SPLC | On SAT Technologies for Dependency Management and Beyond. | Daniel Le Berre, Anne Parrain |
| 2007 | FlAIRS | Handling Qualitative Preferences Using Normal Form Functions. | Salem Benferhat, Daniel Le Berre, Karima Sedki |
| 2006 | ECAI | An Alternative Inference for Qualitative Choice Logic. | Salem Benferhat, Daniel Le Berre, Karima Sedki |
| 2006 | KR | Representing Policies for Quantified Boolean Formulae. | Sylvie Coste-Marquis, Hlne Fargier, Jrme Lang, Daniel Le Berre, Pierre Marquis |
| 2005 | AAAI | Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. | Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis |
| 2005 | SAT | A Branching Heuristics for Quantified Renamable Horn Formulas. | Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe |
| 2004 | SAT | The Second QBF Solvers Comparative Evaluation. | Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella |
| 2004 | SAT | Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. | Daniel Le Berre, Laurent Simon |
| 2003 | SAT | The Essentials of the SAT 2003 Competition. | Daniel Le Berre, Laurent Simon |
| 2003 | SAT | Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. | Daniel Le Berre, Laurent Simon, Armando Tacchella |
| 2002 | KR | Qualitative Choice Logic. | Gerhard Brewka, Salem Benferhat, Daniel Le Berre |
| 2001 | IJCAI | Weakening Conflicting Information for Iterated Revision and Knowledge Integration. | Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams |
| 1998 | AAAI | Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. | Didier Dubois, Daniel Le Berre, Henri Prade, Rgis Sabbadin |
| 1996 | ECAI | Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. | Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre |
| 1996 | ICTAI | Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. | Leila Amgoud, Claudette Cayrol, Daniel Le Berre |