Publications

Articles de revues internationales

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

2017 Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clement, 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 (TSE),vol. 43, n° 1, pp. 34-55, 2017. [Download]

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 Software Testing, Verification and Reliability (STVR),vol. 25, n° 2, Wiley, pp. 138-163, mars 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. [Download]

2012 Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon, The International SAT Solver Competitions in Artificial Intelligence Magazine (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 (JSAT),vol. 7, pp. 59–64, 2010. [Download]

2006 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis, Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages in Journal on Satisfiability, Boolean Modeling and Computation,vol. 1, pp. 61-88, mars 2006. [Download]

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, janvier 2005.

2005 P Purdom, Daniel Le Berre, L Simon, A Parsimony Tree for the SAT2002 Competition in Annals of Mathematics and Artificial Intelligence (AMAI),vol. 43, , pp. 343 - 365, janvier 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, mars 2004.

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

1999 Didier Dubois, Daniel Le Berre, H. Prade, R. Sabbadin, Using possibilistic logic for modeling qualitative decision: Atms-based algorithms in Fundamenta Informaticae (FI),vol. 37, pp. 1-30, 1999. [Download]

Articles de conférences internationales

2018 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, An Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem in 9th International Joint Conference on Automated Reasoning (IJCAR’18),juillet 2018. (to appear)

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),juillet 2018. (to appear)

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 26th International Joint Conference on Artificial Intelligence (IJCAI’17),pp. 674-680, août 2017. [Download]

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 31st AAAI Conference on Artificial Intelligence (AAAI’17),The AAAI Press, pp. 3864-3870, février 2017. [Download]

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, septembre 2016. [Download]

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, juillet 2014. [Download]

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 18th International Software Product Line Conference (SPLC14),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.

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, pp. 249-260, octobre 2009.

2008 Daniel Le Berre, Ines Lynce, CSP2SAT4J: A Simple CSP to SAT translator in Proceedings of the second CSP Competition (CSPCOMP2),pp. 43–54, janvier 2008. (Held in conjunction with CP’06)

2007 Salem Benferhat, Daniel Le Berre, Karima Sedki, Handling Qualitative Preferences Using Normal Form Functions in 20th International Florida Artificial Intelligence Research Society Conference (FLAIRS’07),pp. 38-43, mai 2007.

2006 Sylvie Coste-Marquis, Hélène Fargier, J. Lang, Daniel Le Berre, Pierre Marquis, Representing Policies for Quantified Boolean Formulae in Proc. of the 10th Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-06),AAAI Press, pp. 286-296, juin 2006.

2006 Daniel Le Berre, Anne Parrain, On extending SAT solvers for PB problems in Guangzhou Symposium on Satisfiability and its applications (Guangzhou06),septembre 2006. (papier invité)

2006 Salem Benferhat, Daniel Le Berre, Karima Sedki, An Alternative Inference for Qualitative Choice Logic in 17th European Conference on Artificial Intelligence (ECAI’06),IOS Press, pp. 741-742, 2006.

2005 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, A Branching Heuristics for Quantified Renamable Horn Formulas in Proc. of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT’05),LNCS 3569, Springer 2005, pp. 393-399, juin 2005. (Poster)

2005 Daniel Le Berre, L Simon, Fifty-Five Solvers in Vancouver: The SAT 2004 Competition in Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004,Lecture Notes in Computer Science (LNCS 3542), Springer, Lecture Notes in Computer Science, pp. 321-344, 2005. (Revised Selected Papers)

2005 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis, Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae in 20th National Conference on Artificial Intelligence (AAAI’05),pp. 288-293, 2005.

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. ( Revised Selected Papers)

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),septembre 2004. (papier invité)

2004 Salem Benferhat, G. Brewka, Daniel Le Berre, On the Relationship Between Qualitative Choice Logic and Possibilistic Logic in Tenth International Conference of Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’04),vol. 2, pp. 951-957, juillet 2004.

2003 Daniel Le Berre, L 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. [Download]

2003 Daniel Le Berre, L 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 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),mai 2003. (poster) [Download]

2002 G. Brewka, Salem Benferhat, Daniel Le Berre, Qualitative Choice Logic in Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR’02),Morgan Kaufmann Publishers, Inc., pp. 158-169, avril 2002.

2001 Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams, Weakening conflicting information for iterated revision and knowledge integration in Proceedings of the (IJCAI’01),Morgan Kaufmann Publishers, Inc., pp. 109-115, août 2001.

1998 Didier Dubois, Daniel Le Berre, H. Prade, R. Sabbadin, Logical representation and computation of optimal decisions in a qualitative setting in Fifteenth National Conference on Artificial Intelligence (AAAI’98),pp. 588-593, 1998. [Download]

1996 Leila Amgoud, C. Cayrol, Daniel Le Berre, Comparing arguments using preference orderings for argument-based reasoning in Eighth IEEE International Conference on Tools with Artificial Intelligence (ICTAI’96),pp. 400-403, 1996.

1996 T. Castell, C. Cayrol, Michel Cayrol, Daniel Le Berre, Using the Davis and Putnam procedure for an efficient computation of preferred models in Proceedings of the (ECAI’96),pp. 350-354, 1996.

Articles de workshops internationaux

2016 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, On Checking Kripke Models for Modal Logic K in 5th Workshop on Practical Aspects of Automated Reasoning (PAAR’16),http://ceur-ws.org, juin 2016. [Download]

2014 Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus, Automatic repair of buggy if conditions and missing preconditions with SMT in 6th Workshop on Constraints in Software Testing, Verification, and Analysis (CSTVA’14),pp. 30-39, 2014. [Download]

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. [Download]

2010 Josep Argelich, Daniel Le Berre, Ines 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, juillet 2010. (dans le cadre de FloC’10) [Download]

2010 Daniel Le Berre, Pascal Rapicault, Dependency Management for the Eclipse Ecosystem: An Update in 3rd International Workshop on Logic and Search ({LaSh’10}),juillet 2010. (dans le cadre de FloC’2010)

2009 Daniel Le Berre, Pascal Rapicault, Dependency management for the Eclipse ecosystem in Open Component Ecosystems International Workshop (IWOCE’09),août 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 , septembre 2008.

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),juillet 2007. [Download]

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.

2001 Daniel Le Berre, Exploiting the real power of unit propagation lookahead in Proceedings of the (SAT2001),Elsevier Science Publishers, juin 2001. [Download]

2001 Daniel Le Berre, ADS: a unified computational framework for some consistency and abductive based propsositional reasoning in Proceedings of the (),2001.

1997 Daniel Le Berre, R. Sabbadin, Decision-theoretic diagnosis and repair: representational and computational issues in Eigthth International Workshop on Principles of Diagnosis (DX’97),pp. 141-145, 1997. [Download]

Articles de revues nationales

2014 Daniel Le Berre, Emmanuel Lonca, Réutiliser ou adapter les prouveurs SAT pour l’optimisation booléenne in Revue d’intelligence artificielle (RIA),vol. 28, n° 5, Lavoisier, pp. 615–636, decembre 2014. [Download]

Articles de conférences nationales

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 11èmes Journées de l’Intelligence Artificielle Fondamentale (IAF’17),juillet 2017.

2017 Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, Une approche basée sur SAT pour le problème de satisfiabilité en logique modale S5 in Actes des 13es journées Francophones de Programmation par Contraintes (JFPC’17),pp. 45-53, juin 2017. [Download]

2016 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, À propos de la vérification de modèles en logique modale K in 10èmes Journées de l’Intelligence Artificielle Fondamentale (IAF’16),pp. 10, juin 2016. [Download]

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, juin 2014. [Download]

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

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 Raisonnement sur le temps et l’espace et applications en analyse et en interprétation d’images ou de vidéos (RTE’12),janvier 2012. (dans le cadre de RFIA’2012 - Actes électroniques) [Download]

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 18ième congrès francophone sur la Reconnaissance des Formes et l’Intelligence Artificielle (RFIA’12),janvier 2012. [Download]

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 8ièmes Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 180-185, mai 2012. [Download]

2007 Daniel Le Berre, Anne Parrain, À propos de l’extension d’un solveur SAT pour traiter des contraintes pseudo-booléennes in 3èmes Journées Francophones de Programmation par Contraintes (JFPC’07),pp. 38-47, juin 2007. [Download]

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 Actes du 15ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle (RFIA’06),janvier 2006. (Actes électroniques) [Download]

2006 Salem Benferhat, Daniel Le Berre, Karima Sedki, La logique du choix qualitatif in Rencontres Francophones sur la Logique Floue et ses Applications (LFA’06),Cépadues, 2006.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, OpenSAT: une plateforme SAT Open Source in JNPC’03,juin 2003. [Download]

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

1998 T. Castell, C. Cayrol, Michel Cayrol, Daniel Le Berre, Modèles P-restreints : application à l’inférence propositionnelle in Actes du Onzième Congrès Reconnaissance des Formes et Intelligence Artificielle (RFIA’98),pp. 205-214, 1998.

Éditions d'actes de conférences

2016 Nadia Creignou, Daniel Le Berre, 19th International Conference on Theory and Applications of Satisfiability Testing (SAT’16) Springer, 2016. (Lecture Notes in Computer Science 9710)

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

Thèses de doctorat

2000 Daniel Le Berre, Autour de SAT: le calcul d’impliquants P-restreints, algorithmes et applications Université Toulouse III - Paul Sabatier, janvier 2000. [Download]

Habilitations à Diriger des Recherches

2010 Daniel Le Berre, Sat4j, un moteur libre de raisonnement en logique propositionnelle Université d’Artois, decembre 2010.

Rapports techniques

2014 Daniel Le Berre, Emmanuel Lonca, Pierre Marquis, On the Complexity of Optimization Problems based on Compiled NNF Representations in CoRR,CoRR, vol. abs/1410.6690, 2014.

2014 Daniel Le Berre, Projet ANR BR4CP Livrables t0 + 24 Algorithmes Résultats expérimentaux individuels CRIL-Universit? d’Artois, janvier 2014.