Skip to Main content
Number of documents

73

Daniel Le Berre's publications


Journal articles16 documents

  • 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. Automated Software Engineering, Springer Verlag, 2022, pp.1-52. ⟨10.1007/s10515-022-00329-x⟩. ⟨hal-03593967⟩
  • Daniel Le Berre, Pascal Rapicault. Boolean-Based Dependency Management for the Eclipse Ecosystem. International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2018, 27 (01), pp.1840003. ⟨10.1142/S0218213018400031⟩. ⟨hal-02310059⟩
  • Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clément, Sebastian Lamelas, et al.. Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. IEEE Transactions on Software Engineering, Institute of Electrical and Electronics Engineers, 2017, 43 (1), pp.34-55. ⟨10.1109/TSE.2016.2560811⟩. ⟨hal-01285008v2⟩
  • Sergio Segura, Amador Durán, Ana B. Sánchez, Daniel Le Berre, Emmanuel Lonca, et al.. Automated metamorphic testing of variability analysis tools. Journal of : Software Testing, Verification and Reliability, Wiley, 2015, 25 (2), pp.138-163. ⟨10.1002/stvr.1566⟩. ⟨hal-02380763⟩
  • Daniel Le Berre, Stéphanie Roussel. Sat4j 2.3.2: on the fly solver configuration, System Description. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 2014, 8, pp.197-202. ⟨10.3233/SAT190098⟩. ⟨hal-03300797⟩
  • Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon. The International SAT Solver Competitions. AI magazine, Association for the Advancement of Artificial Intelligence, 2012, 1 (33), pp.89-94. ⟨10.1609/aimag.v33i1.2395⟩. ⟨hal-00868244⟩
  • Daniel Le Berre, Anne Parrain. The SAT4J library, Release 2.2, System Description. Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2010, 7, pp.59-64. ⟨10.3233/SAT190075⟩. ⟨hal-00868136⟩
  • Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2006, 1, pp.61-88. ⟨hal-00109570⟩
  • L Simon, Daniel Le Berre, E. Hirsch. The SAT 2002 Competition , Annals of Mathematics and Artificial Intelligence. Annals of Mathematics and Artificial Intelligence (AMAI), 2005, 43,, pp.307-342. ⟨hal-03300798⟩
  • P. Purdom, L. Simon, Daniel Le Berre. A Parsimony Tree for the SAT2002 Competition. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2005, 43, Issue 1 - pp 343-365. ⟨hal-00018851⟩
  • L. Simon, Daniel Le Berre, E. Hirsch. The SAT 2002 Competition. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2005, vol.43, Issue 1-4, pp.307-342. ⟨hal-00022662⟩
  • M. Narizzano, L. Simon, A. Tachella, Daniel Le Berre. The Second QBF Solvers Comparative Evaluation. Lecture Notes in Computer Science, Springer, 2005, 3542, pp.376-392. ⟨hal-00090749⟩
  • Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe. A Branching Heuristics for Quantified Renamable Horn Formulas. Lecture Notes in Computer Science, Springer, 2005, 3569, pp.393. ⟨hal-00014611⟩
  • G. Brewka, Salem Benferhat, Daniel Le Berre. Qualitative Choice Logic. Artificial Intelligence, 2004, 157 (1-2), pp.203-237. ⟨10.1016/j.artint.2004.04.006⟩. ⟨hal-03299554⟩
  • Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams. Weakening conflicting information for iterated revision and knowledge integration. Artificial Intelligence, 2004, 153, pp.339-371. ⟨10.1016/j.artint.2003.08.003⟩. ⟨hal-03299555⟩
  • Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin. Using possibilistic logic for modeling qualitative decision: Atms-based algorithms. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 1999, 37 (1-2), pp.1-30. ⟨10.3233/FI-1999-371201⟩. ⟨hal-03300799⟩

Conference papers51 documents

  • Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon. On Irrelevant Literals in Pseudo-Boolean Constraint Learning. 29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩. ⟨hal-02912451⟩
  • Daniel Le Berre, Romain Wallon. On Dedicated CDCL Strategies for PB Solvers. 24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21), Jul 2021, Barcelona (en ligne), Spain. pp.315-331, ⟨10.1007/978-3-030-80223-3_22⟩. ⟨hal-03295263⟩
  • Daniel Le Berre, Romain Wallon. Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs. 16es Journées Francophones de Programmation par Contraintes (JFPC'21), Jun 2021, Nice (en ligne), France. ⟨hal-03295266⟩
  • Daniel Le Berre, Pierre Marquis, Romain Wallon. On Weakening Strategies for PB Solvers. 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20), Jul 2020, Alghero (en ligne), Italy. pp.322-331, ⟨10.1007/978-3-030-51825-7_23⟩. ⟨hal-02912458⟩
  • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. Une approche SAT sensible à la mémoire pour les logiques modales PSPACE. JIAF 2019 - 13es Journées de l'Intelligence Artificielle Fondamentale, Jul 2019, Toulouse, France. ⟨hal-02271392⟩
  • Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon. De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises. 15es Journées Francophones de Programmation par Contraintes (JFPC’19), Jun 2019, Albi, France. pp.43-52. ⟨hal-02912461⟩
  • Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon. On Irrelevant Literals in Pseudo-Boolean Constraint Learning. 10th International Workshop on Pragmatics of SAT (POS'19), Jul 2019, Lisbon, Portugal. ⟨hal-03457395⟩
  • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. A SAT-Based Approach For PSPACE Modal Logics. Principles of Knowledge Representation and Reasoning: Sixteenth International Conference, Oct 2018, Tempe, United States. ⟨hal-02271405⟩
  • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Jul 2018, Oxford, United Kingdom. pp.1-18. ⟨hal-02271403⟩
  • Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon. Pseudo-Boolean Constraints from a Knowledge Representation Perspective. 27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩. ⟨hal-02310063⟩
  • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.674-680. ⟨hal-02271412⟩
  • 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. Thirty-First AAAI Conference on Artificial Intelligence, Feb 2017, San Francisco, United States. ⟨hal-02271408⟩
  • 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. 11e Journées d'Intelligence Artificielle Fondamentale, Jul 2017, Caen, France. ⟨hal-01575536⟩
  • Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre. Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. 23rd International Conference on Principles and Practice of Constraint Programming (CP'17), 2017, Melbourne, Australia. pp.596-614. ⟨hal-03300800⟩
  • Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis. Complexité paramétrée de l'optimisation sous contrainte DNNF. 12èmes Journée Francophone de Programmation par Contraintes (JFPC'16), 2016, Montpellier, France. ⟨hal-02380769⟩
  • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. On Checking Kripke Models for Modal Logic K. 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., Jul 2016, Coimbra, Portugal. ⟨hal-02271413⟩
  • Valentin Montmirail, Daniel Le Berre, Tiago de Lima, Jean-Marie Lagniez. A propos de la vérification de modèles en logique modale K. 10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016), Jun 2016, Montpellier, France. ⟨10.13140/RG.2.1.1178.5843⟩. ⟨hal-01332832⟩
  • Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis. Fixed-Parameter Tractable Optimization under DNNF Constraints. 22nd European Conference on Artificial Intelligence (ECAI'16), 2016, The Hague, Netherlands. pp.1194-1202. ⟨hal-02380765⟩
  • Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey. Détection de contraintes de cardinalité dans les CNF. 10èmes Journées Francophones de Programmation par Contraintes (JFPC'14), 2014, Angers, France. pp.253-262. ⟨hal-02380772⟩
  • Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey. Detecting Cardinality Constraints in CNF. 17th International Conference on Theory and Applications of Satisfiability Testing (SAT'14), 2014, Vienna, Austria. pp.285-301, ⟨10.1007/978-3-319-09284-3_22⟩. ⟨hal-02380768⟩
  • Daniel Le Berre. Some thoughts about benchmarks for NMR. 15th International Workshop on Non-Monotonic Reasoning (NMR'14), 2014, Vienna, Austria. ⟨hal-03300807⟩
  • 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. 14th European Conference on Logics in Artificial Intelligence (JELIA'14), 2014, Madeira, Portugal. pp.684-693. ⟨hal-03300801⟩
  • Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck. Consistency Checking for the Evolution of Cardinality-based Feature Models. SPLC - 18th International Software Product Line Conference, Sep 2014, Florence, Italy. pp.122-131. ⟨hal-01054604⟩
  • Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus. Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT. Proceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis, 2014, Hyderabad, India. ⟨10.1145/2593735.2593740⟩. ⟨hal-00977798⟩
  • Daniel Le Berre, Emmanuel Lonca. Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne. 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.185-194. ⟨hal-00869924⟩
  • David Deharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure. Computing prime implicants. 13th International Conference on Formal Methods in Computer-Aided Design (FMCAD'13), Oct 2013, Portland, Oregon, United States. pp.46-52, ⟨10.1109/FMCAD.2013.6679390⟩. ⟨hal-03300802⟩
  • Daniel Le Berre, Pierre Marquis, Stéphanie Roussel. Planning Personalised Museum Visits. 23rd International Conference on Automated Planning and Scheduling (ICAPS'13), Jun 2013, Rome, Italy. pp.380-388. ⟨hal-00875201⟩
  • Jean-François Condotta, Daniel Le Berre. Résolution de contraintes qualitatives pour le temps et l'espace par SAT à partir de treillis. RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3. ⟨hal-00660969⟩
  • 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. RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3. ⟨hal-00656571⟩
  • 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. Huitièmes Journées Francophones de Programmation par Contraintes - JFPC 2012, May 2012, Toulouse, France. ⟨hal-00829567⟩
  • Daniel Le Berre, Pascal Rapicault. Dependency Management for the Eclipse Ecosystem: An Update. 3rd International Workshop on Logic and Search 2010, Edinbourgh, United Kingdom. ⟨hal-00870884⟩
  • Josep Argelich, Daniel Le Berre, Inês Lynce, Joao Marques-Silva, Pascal Rapicault. Solving Linux Upgradeability Problems Using Boolean Optimization. Workshop on Logics for Component Configuration ((LoCoCo'10), 2010, Edinbourgh, United Kingdom. pp.11-22. ⟨hal-00870877⟩
  • Daniel Le Berre, Pierre Marquis, Meltem Öztürk. Aggregating Interval Orders by Propositional Optimization. 1st International Conference on Algorithmic Decision Theory (ADT'09), 2009, Venice, Italy. pp.249-260, ⟨10.1007/978-3-642-04428-1_22⟩. ⟨hal-00866857⟩
  • Daniel Le Berre, Pascal Rapicault. Dependency management for the Eclipse ecosystem. Open Component Ecosystems International Workshop (IWOCE'09), 2009, Amsterdam, Netherlands. ⟨hal-00870855⟩
  • Daniel Le Berre, Anne Parrain. On SAT Technologies for dependency management and beyond. First Workshop on Software Product Lines (ASPL'08), 2008, Limerick, Ireland. pp.197-200. ⟨hal-00870846⟩
  • Daniel Le Berre, Anne Parrain. On extending SAT solvers for PB problems. 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07, Jul 2007, Rome, Italy. ⟨hal-00466227⟩
  • Salem Benferhat, Daniel Le Berre, Karima Sedki. Handling Qualitative Preferences Using Normal Form Functions. International FLAIRS Conference (FLAIRS'07), May 2007, South Beach, United States. pp.38-43. ⟨hal-00421714⟩
  • Daniel Le Berre, Anne Parrain. À propos de l'extension d'un solveur SAT pour traiter des contraintes pseudo-booléennes. Troisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), Jun 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France. ⟨inria-00151038⟩
  • Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Fragments propositionnels pour la compilation de connaissances et formules booléennes quantifiées. 15ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle(RFIA'06), Jan 2006, Tours, France. pp.Actes électroniques. ⟨hal-00192926⟩
  • Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Pierre Marquis, Daniel Le Berre. Representing Policies for Quantified Boolean Formulae. AAAI, Jun 2006, Boston, United States. pp.286-296. ⟨hal-00121155⟩
  • Salem Benferhat, Daniel Le Berre, Karima Sedki. ECAI 2006. ECAI 2006, 2006, Riva del Garda, Italy. pp.741-742. ⟨hal-00143833⟩
  • Daniel Le Berre. CSP2SAT4J: A Simple CSP to SAT translator. Second International Workshop on Constraint Propagation and Implementation(CPAI05), Oct 2005, Sitges, Spain. pp.59-66. ⟨hal-00460869⟩
  • Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conferencep, 2005, Pittsburg, United States. pp.288. ⟨hal-00014629⟩
  • Daniel Le Berre, M. Narizzano, L Simon, A Tachella. The Second QBF Solvers Comparative Evaluation. Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, 2005, Vancouver, Canada. pp.376-392. ⟨hal-03300803⟩
  • Daniel Le Berre, Anne Parrain, Olivier Roussel. The long way from conflict driven clause learning to conflict driven constraint learning. Guangzhou Symposium on Satisfiability and its applications (Guangzhou04), 2004, Guangzhou, China. ⟨hal-03300804⟩
  • Daniel Le Berre, L. Simon. Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. Seventh International Conference on Theory and Applications of Satisfiability Testing(SAT'04), 2004, Vancouver, Canada. pp.321-344. ⟨hal-00397465⟩
  • Daniel Le Berre, Laurent Simon. The essentials of the SAT 2003 competition. Proceedings of the Sixth International Conference on Theory and Applications of satisfiability Testing (SAT 2003), 2003, Portofino, Italy. pp.452-467. ⟨hal-03300806⟩
  • Gilles Audemard, Daniel Le Berre, Olivier Roussel, Ines Lynce, Joao Marques-Silva. OpenSAT: an open source SAT software project. Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy. ⟨hal-03299485⟩
  • Daniel Le Berre, Laurent Simon, A Tachella. Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers. Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy. pp.468-485. ⟨hal-03300805⟩
  • Gilles Audemard, Daniel Le Berre, Olivier Roussel. OpenSAT: une plateforme SAT Open Source. JNPC'03, 2003, Amiens, France. ⟨hal-03299519⟩
  • 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. 13ème Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA 2002), 2002, Angers, France. pp.289-298. ⟨hal-03300386⟩

Directions of work or proceedings2 documents

  • Nadia Creignou, Daniel Le Berre. 19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16). Springer, 2016. ⟨hal-03300808⟩
  • L. Simon, Daniel Le Berre. Special Volume on the SAT 2005 competitions and evaluations. IOS Press, pp.237, 2006. ⟨hal-00459960⟩

Reports2 documents

  • Daniel Le Berre. Projet ANR BR4CP Livrables t0 + 24 Algorithmes Résultats expérimentaux individuels. [Technical Report] Centre de Recherche en Informatique de Lens. 2014. ⟨hal-03300810⟩
  • Daniel Le Berre, Emmanuel Lonca, Pierre Marquis. On the Complexity of Optimization Problems based on Compiled NNF Representations. [Technical Report] CRIL. 2014. ⟨hal-03296019⟩

Theses1 document

  • Daniel Le Berre. Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. Intelligence artificielle [cs.AI]. Université Toulouse III Paul Sabatier, 2000. Français. ⟨tel-02881946⟩

Habilitation à diriger des recherches1 document

  • Daniel Le Berre. Sat4j, un moteur libre de raisonnement en logique propositionnelle. Intelligence artificielle [cs.AI]. Université d'Artois, 2010. ⟨tel-02884327⟩