Daniel Le Berre

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 24

Top Topics

Satisfiability Problem

Davis Putnam Logemann Loveland

Optimization Problems

Top Venues

Publications

Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel
Compressing UNSAT CDCL Trees with Caching. ICAART (3) (2024)
Gökhan Tahil, Fabien Delorme, Daniel Le Berre, Éric Monflier, Adlane Sayede, Sébastien Tilloy
Stereoisomers Are Not Machine Learning's Best Friends. J. Chem. Inf. Model. 64 (14) (2024)
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB (2023)
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
The Silent (R)evolution of SAT. Commun. ACM 66 (6) (2023)
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS (2023)
Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel
Compressing UNSAT Search Trees with Caching. ICAART (3) (2023)
Xhevahire Tërnava, Johann Mortara, Philippe Collet, Daniel Le Berre
Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach. Autom. Softw. Eng. 29 (1) (2022)
Daniel Le Berre, Romain Wallon
On Dedicated CDCL Strategies for PB Solvers. CoRR (2021)
Daniel Le Berre, Romain Wallon
On Dedicated CDCL Strategies for PB Solvers. SAT (2021)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. CoRR (2020)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. IJCAI (2020)
Daniel Le Berre, Pierre Marquis, Romain Wallon
On Weakening Strategies for PB Solvers. SAT (2020)
Daniel Le Berre, Pierre Marquis, Romain Wallon
On Weakening Strategies for PB Solvers. CoRR (2020)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. IJCAR (2018)
Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clément, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. CoRR (2018)
Daniel Le Berre, Pascal Rapicault
Boolean-Based Dependency Management for the Eclipse Ecosystem. Int. J. Artif. Intell. Tools 27 (1) (2018)
Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
Pseudo-Boolean Constraints from a Knowledge Representation Perspective. IJCAI (2018)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A SAT-Based Approach For PSPACE Modal Logics. KR (2018)
Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clement, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. IEEE Trans. Software Eng. 43 (1) (2017)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI (2017)
Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP (2017)
Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. AAAI (2017)
Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
Fixed-Parameter Tractable Optimization Under DNNF Constraints. ECAI (2016)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
On Checking Kripke Models for Modal Logic K. PAAR@IJCAR (2016)
Sergio Segura, Amador Durán, Ana Belén Sánchez, Daniel Le Berre, Emmanuel Lonca, Antonio Ruiz Cortés
Automated metamorphic testing of variability analysis tools. Softw. Test. Verification Reliab. 25 (2) (2015)
Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus
Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT. CoRR (2014)
Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey
Detecting Cardinality Constraints in CNF. SAT (2014)
Daniel Le Berre, Emmanuel Lonca
Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne. Rev. d'Intelligence Artif. 28 (5) (2014)
Daniel Le Berre
Some thoughts about benchmarks for NMR. CoRR (2014)
Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck
Consistency checking for the evolution of cardinality-based feature models. SPLC (2014)
Daniel Le Berre, Stéphanie Roussel
Sat4j 2.3.2: on the fly solver configuration System Description. J. Satisf. Boolean Model. Comput. 8 (3/4) (2014)
Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA (2014)
Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
On the Complexity of Optimization Problems based on Compiled NNF Representations. CoRR (2014)
Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus
Automatic repair of buggy if conditions and missing preconditions with SMT. CSTVA (2014)
David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure
Computing prime implicants. FMCAD (2013)
Daniel Le Berre, Pierre Marquis, Stéphanie Roussel
Planning Personalised Museum Visits. ICAPS (2013)
Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon
The International SAT Solver Competitions. AI Mag. 33 (1) (2012)
Daniel Le Berre, Anne Parrain
The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput. 7 (2-3) (2010)
Josep Argelich, Daniel Le Berre, Inês Lynce, João P. Marques Silva, Pascal Rapicault
Solving Linux Upgradeability Problems Using Boolean Optimization LoCoCo (2010)
Daniel Le Berre, Pierre Marquis, Meltem Öztürk
Aggregating Interval Orders by Propositional Optimization. ADT (2009)
Daniel Le Berre, Anne Parrain
On SAT Technologies for Dependency Management and Beyond. SPLC (2) (2008)
Salem Benferhat, Daniel Le Berre, Karima Sedki
Handling Qualitative Preferences Using Normal Form Functions. FLAIRS Conference (2007)
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. 1 (1) (2006)
Daniel Le Berre, Laurent Simon
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Salem Benferhat, Daniel Le Berre, Karima Sedki
An Alternative Inference for Qualitative Choice Logic. ECAI (2006)
Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis
Representing Policies for Quantified Boolean Formulae. KR (2006)
Laurent Simon, Daniel Le Berre, Edward A. Hirsch
The SAT2002 competition. Ann. Math. Artif. Intell. 43 (1) (2005)
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe
A Branching Heuristics for Quantified Renamable Horn Formulas. SAT (2005)
Paul W. Purdom, Daniel Le Berre, Laurent Simon
A parsimony tree for the SAT2002 competition. Ann. Math. Artif. Intell. 43 (1) (2005)
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI (2005)
Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella
The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers (2004)
Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
Weakening conflicting information for iterated revision and knowledge integration. Artif. Intell. 153 (1-2) (2004)
Gerhard Brewka, Salem Benferhat, Daniel Le Berre
Qualitative choice logic. Artif. Intell. 157 (1-2) (2004)
Daniel Le Berre, Laurent Simon
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. SAT (Selected Papers (2004)
Daniel Le Berre, Laurent Simon, Armando Tacchella
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. SAT (2003)
Daniel Le Berre, Laurent Simon
The Essentials of the SAT 2003 Competition. SAT (2003)
Gerhard Brewka, Salem Benferhat, Daniel Le Berre
Qualitative Choice Logic. KR (2002)
Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
Weakening Conflicting Information for Iterated Revision and Knowledge Integration. IJCAI (2001)
Daniel Le Berre
Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. 9 (2001)
Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. Fundam. Informaticae 37 (1-2) (1999)
Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. AAAI/IAAI (1998)
Leila Amgoud, Claudette Cayrol, Daniel Le Berre
Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. ICTAI (1996)
Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre
Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. ECAI (1996)