Skip to Main content
Number of documents

37

Daniel Le Berre's publications


Journal articles6 documents

  • 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. Software Testing, Verification and Reliability (STVR), 2015, 25 (2), pp.138-163. ⟨hal-02380763⟩
  • Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon. The International SAT Solver Competitions. Artificial Intelligence Magazine (AI Magazine), 2012, 1 (33), pp.89-94. ⟨hal-00868244⟩
  • Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon. The International SAT Solver Competition. Artificial Intelligence Magazine, Springer, 2012. ⟨hal-00790513⟩
  • 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. ⟨hal-00868136⟩

Conference papers28 documents

  • 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. Pseudo-Boolean Constraints from a Knowledge Representation Perspective. Twenty-Seventh International Joint Conference on Artificial Intelligence , 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 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. 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⟩
  • 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. 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • Olivia Gerigny, S. Coudray, Paul-Antoine Bisgambiglia, Cristina Lapucci, Daniel Le Berre, et al.. Systemic approach in a Marine Protected Area (Strait of Bonifacio – South of Corsica). Modeling and hydrodynamics for applied research (larvae dispersion, marine litter, chlorophyll) . JONSMOD 2014, Joint Numerical Sea Modelling Group Conference, May 2014, Brussels, Belgium. ⟨hal-01145582⟩
  • 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. ⟨hal-02380768⟩
  • 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⟩
  • 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⟩
  • David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure. Computing prime implicant. FMCAD - Formal Methods in Computer-Aided Design 2013, Oct 2013, Portland, United States. pp.46-52. ⟨hal-00910363⟩
  • Daniel Le Berre, Pierre Marquis, Stéphanie Roussel. Planning Personalised Museum Visits. 23rd International Conference on Automated Planning and Scheduling (ICAPS'13), 2013, Rome, Italy. pp.380-388. ⟨hal-00875201⟩
  • 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⟩
  • 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⟩
  • 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. 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. ⟨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. À 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⟩
  • 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⟩
  • 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⟩

Book sections1 document

  • 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, Oxford,UK, July 14-17, 2018, Proceedings, pp.1-18, 2018. ⟨hal-02271403⟩

Directions of work or proceedings2 documents

  • Valentin Montmirail, Daniel Le Berre, Tiago de Lima, Jean-Marie Lagniez. A propos de la vérification de modèles en logique modale K. Jun 2016, Montpellier, France. 2016, Actes des 10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016), ⟨10.13140/RG.2.1.1178.5843⟩. ⟨hal-01332832⟩
  • Daniel Le Berre, L. Simon. Special Volume on the SAT 2005 competitions and evaluations. IOS Press, pp.237, 2006. ⟨hal-00459960⟩