Publications

International journals

2022 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 in Automated Software Engineering,pp. 1-52, 2022.

2018 Daniel Le Berre, Pascal Rapicault, Boolean-Based Dependency Management for the Eclipse Ecosystem in International Journal on Artificial Intelligence Tools,vol. 27, n° 01, pp. 1840003, 2018.

2017 Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clément, Sebastian Lamelas, Thomas Durieux, Daniel Le Berre, Martin Monperrus, Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs in IEEE Transactions on Software Engineering,vol. 43, n° 1, pp. 34-55, 2017.

2015 Sergio Segura, Amador Durán, Ana B. Sánchez, Daniel Le Berre, Emmanuel Lonca, Antonio Ruiz Cortés, Automated metamorphic testing of variability analysis tools in Journal of : Software Testing, Verification and Reliability,vol. 25, n° 2, pp. 138-163, 2015.

2014 Daniel Le Berre, Stéphanie Roussel, Sat4j 2.3.2: on the fly solver configuration, System Description in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 8, pp. 197-202, 2014.

2012 Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon, The International SAT Solver Competitions in AI magazine,vol. 1, n° 33, pp. 89-94, 2012.

2010 Daniel Le Berre, Anne Parrain, The SAT4J library, Release 2.2, System Description in Journal on Satisfiability, Boolean Modeling and Computation,vol. 7, pp. 59-64, 2010.

2005 L Simon, Daniel Le Berre, E. Hirsch, The SAT 2002 Competition , Annals of Mathematics and Artificial Intelligence in Annals of Mathematics and Artificial Intelligence (AMAI),vol. 43,, pp. 307-342, 2005.

2004 Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams, Weakening conflicting information for iterated revision and knowledge integration in Artificial Intelligence,vol. 153, pp. 339-371, 2004.

2004 G. Brewka, Salem Benferhat, Daniel Le Berre, Qualitative Choice Logic in Artificial Intelligence,vol. 157, n° 1-2, pp. 203-237, 2004.

1999 Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin, Using possibilistic logic for modeling qualitative decision: Atms-based algorithms in Fundamenta Informaticae,vol. 37, n° 1-2, pp. 1-30, 1999.

International conferences

2021 Daniel Le Berre, Romain Wallon, On Dedicated CDCL Strategies for PB Solvers in 24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21),pp. 315-331, 2021.

2020 Daniel Le Berre, Pierre Marquis, Romain Wallon, On Weakening Strategies for PB Solvers in 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20),pp. 322-331, 2020.

2020 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, On Irrelevant Literals in Pseudo-Boolean Constraint Learning in 29th International Joint Conference on Artificial Intelligence (IJCAI'20),International Joint Conferences on Artificial Intelligence Organization, pp. 1148-1154, 2020.

2019 Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail, Une approche SAT sensible à la mémoire pour les logiques modales PSPACE in JIAF 2019 - 13es Journées de l'Intelligence Artificielle Fondamentale,2019.

2019 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, On Irrelevant Literals in Pseudo-Boolean Constraint Learning in 10th International Workshop on Pragmatics of SAT (POS'19),2019.

2018 Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail, An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem in Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018,pp. 1-18, 2018.

2018 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, Pseudo-Boolean Constraints from a Knowledge Representation Perspective in 27th International Joint Conference on Artificial Intelligence (IJCAI'18),International Joint Conferences on Artificial Intelligence Organization, pp. 1891-1897, 2018.

2018 Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail, A SAT-Based Approach For PSPACE Modal Logics in Principles of Knowledge Representation and Reasoning: Sixteenth International Conference,2018.

2017 Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre, Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation in 23rd International Conference on Principles and Practice of Constraint Programming (CP'17),pp. 596-614, 2017.

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 in Twenty-Sixth International Joint Conference on Artificial Intelligence,International Joint Conferences on Artificial Intelligence Organization, pp. 674-680, 2017.

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 in Thirty-First AAAI Conference on Artificial Intelligence,2017.

2016 Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail, On Checking Kripke Models for Modal Logic K in Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), Coimbra, Portugal, July 2nd, 2016.,2016.

2016 Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis, Fixed-Parameter Tractable Optimization under DNNF Constraints in 22nd European Conference on Artificial Intelligence (ECAI'16),pp. 1194-1202, 2016.

2014 Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus, Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT in Proceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis,2014.

2014 Daniel Le Berre, Some thoughts about benchmarks for NMR in 15th International Workshop on Non-Monotonic Reasoning (NMR'14),vol. abs/1405.1183, 2014.

2014 Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey, Detecting Cardinality Constraints in CNF in 17th International Conference on Theory and Applications of Satisfiability Testing (SAT'14),Springer, pp. 285-301, 2014.

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 in 14th European Conference on Logics in Artificial Intelligence (JELIA'14),Springer, pp. 684-693, 2014.

2014 Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck, Consistency Checking for the Evolution of Cardinality-based Feature Models in SPLC - 18th International Software Product Line Conference,pp. 122-131, 2014.

2013 Daniel Le Berre, Pierre Marquis, Stéphanie Roussel, Planning Personalised Museum Visits in 23rd International Conference on Automated Planning and Scheduling (ICAPS'13),AAAI Press, pp. 380-388, 2013.

2013 David Deharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure, Computing prime implicants in 13th International Conference on Formal Methods in Computer-Aided Design (FMCAD'13),IEEE Press, pp. 46-52, 2013.

2010 Josep Argelich, Daniel Le Berre, Inês Lynce, Joao Marques-Silva, Pascal Rapicault, Solving Linux Upgradeability Problems Using Boolean Optimization in Workshop on Logics for Component Configuration ((LoCoCo'10),pp. 11-22, 2010.

2010 Daniel Le Berre, Pascal Rapicault, Dependency Management for the Eclipse Ecosystem: An Update in 3rd International Workshop on Logic and Search {LaSh'10),2010.

2009 Daniel Le Berre, Pierre Marquis, Meltem Öztürk, Aggregating Interval Orders by Propositional Optimization in 1st International Conference on Algorithmic Decision Theory (ADT'09),Springer, vol. 5783, pp. 249-260, 2009.

2009 Daniel Le Berre, Pascal Rapicault, Dependency management for the Eclipse ecosystem in Open Component Ecosystems International Workshop (IWOCE'09),2009.

2008 Daniel Le Berre, Anne Parrain, On SAT Technologies for dependency management and beyond in First Workshop on Software Product Lines (ASPL'08),pp. 197-200, 2008.

2007 Salem Benferhat, Daniel Le Berre, Karima Sedki, Handling Qualitative Preferences Using Normal Form Functions in International FLAIRS Conference (FLAIRS'07),pp. 38-43, 2007.

2005 Daniel Le Berre, M. Narizzano, L Simon, A Tachella, The Second QBF Solvers Comparative Evaluation in Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004,Lecture Notes in Computer Science (LNCS 3542), Springer, pp. 376-392, 2005.

2005 Daniel Le Berre, CSP2SAT4J: A Simple CSP to SAT translator in Second International Workshop on Constraint Propagation and Implementation(CPAI05),pp. 59-66, 2005.

2005 Daniel Le Berre, L. Simon, Fifty-Five Solvers in Vancouver: The SAT 2004 Competition in Seventh International Conference on Theory and Applications of Satisfiability Testing(SAT'04),Springer, pp. 321-344, 2005.

2004 Daniel Le Berre, Anne Parrain, Olivier Roussel, The long way from conflict driven clause learning to conflict driven constraint learning in Guangzhou Symposium on Satisfiability and its applications (Guangzhou04),2004.

2003 Daniel Le Berre, Laurent Simon, The essentials of the SAT 2003 competition in Proceedings of the Sixth International Conference on Theory and Applications of satisfiability Testing (SAT 2003),pp. 452-467, 2003.

2003 Daniel Le Berre, Laurent Simon, A Tachella, Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers in Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003),pp. 468-485, 2003.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, Ines Lynce, Joao Marques-Silva, OpenSAT: an open source SAT software project in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003),2003.

National conferences

2021 Daniel Le Berre, Romain Wallon, Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs in 16es Journées Francophones de Programmation par Contraintes (JFPC'21),2021.

2019 Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon, De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises in 15es Journées Francophones de Programmation par Contraintes (JFPC’19),pp. 43-52, 2019.

2017 Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail, Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K in 11e Journées d'Intelligence Artificielle Fondamentale,2017.

2016 Valentin Montmirail, Daniel Le Berre, Tiago de Lima, Jean-Marie Lagniez, A propos de la vérification de modèles en logique modale K in 10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016),2016.

2016 Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis, Complexité paramétrée de l'optimisation sous contrainte DNNF in 12èmes Journée Francophone de Programmation par Contraintes (JFPC'16),2016.

2014 Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey, Détection de contraintes de cardinalité dans les CNF in 10èmes Journées Francophones de Programmation par Contraintes (JFPC'14),pp. 253-262, 2014.

2013 Daniel Le Berre, Emmanuel Lonca, Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 185-194, 2013.

2012 Daniel Le Berre, Emmanuel Lonca, Pierre Marquis, Anne Parrain, Optimisation multicritère pour la gestion de dépendances logicielles : utilisation de la norme de Tchebycheff in RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle),pp. 978-2-9539515-2-3, 2012.

2012 Jean-François Condotta, Daniel Le Berre, Résolution de contraintes qualitatives pour le temps et l'espace par SAT à partir de treillis in RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle),pp. 978-2-9539515-2-3, 2012.

2012 Daniel Le Berre, Emmanuel Lonca, Pierre Marquis, Anne Parrain, Calcul de solutions équilibrées Pareto-optimales : application au problème de gestion de dépendances logicielles in Huitièmes Journées Francophones de Programmation par Contraintes - JFPC 2012,2012.

2007 Daniel Le Berre, Anne Parrain, On extending SAT solvers for PB problems in 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07,2007.

2006 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis, Fragments propositionnels pour la compilation de connaissances et formules booléennes quantifiées in 15ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle(RFIA'06),pp. Actes électroniques, 2006.

2005 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis, Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae in The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conferencep,pp. 288, 2005.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, OpenSAT: une plateforme SAT Open Source in JNPC'03,2003.

2002 Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis, Résolution de formules booléennes quantifiées : problèmes et algorithmes in 13ème Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA 2002),pp. 289-298, 2002.

Proceedings editions

2016 Nadia Creignou, Daniel Le Berre, 19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16) Springer, 2016.

2006 L. Simon, Daniel Le Berre, Special Volume on the SAT 2005 competitions and evaluations IOS Press, 2006.

Technical reports

2014 Daniel Le Berre, Projet ANR BR4CP Livrables t0 + 24 Algorithmes Résultats expérimentaux individuels 2014.

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