Daniel Le Berre

Documents

Publications

	Curated dataset of association constants between a cyclodextrin and a guest for machine learning Gökhan Tahil , Fabien Delorme , Daniel Le Berre , Éric Monflier , Adlane Sayede Chemical Data Collections, 2023, 45, pp.101022. ⟨10.1016/j.cdc.2023.101022⟩ Article dans une revue hal-04056166v1
	The Silent (R)evolution of SAT Johannes Fichte , Daniel Le Berre , Markus Hecher , Stefan Szeider Communications of the ACM, 2023, 66 (6), pp.64-72. ⟨10.1145/3560469⟩ Article dans une revue hal-04106948v1
	Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach Xhevahire Tërnava , Johann Mortara , Philippe Collet , Daniel Le Berre Automated Software Engineering, 2022, pp.1-52. ⟨10.1007/s10515-022-00329-x⟩ Article dans une revue hal-03593967v1
	Boolean-Based Dependency Management for the Eclipse Ecosystem Daniel Le Berre , Pascal Rapicault International Journal on Artificial Intelligence Tools, 2018, 27 (01), pp.1840003. ⟨10.1142/S0218213018400031⟩ Article dans une revue hal-02310059v1
	Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs Jifeng Xuan , Matias Martinez , Favio Demarco , Maxime Clément , Sebastian Lamelas IEEE Transactions on Software Engineering, 2017, 43 (1), pp.34-55. ⟨10.1109/TSE.2016.2560811⟩ Article dans une revue hal-01285008v2
	Automated metamorphic testing of variability analysis tools Sergio Segura , Amador Durán , Ana B. Sánchez , Daniel Le Berre , Emmanuel Lonca Journal of Software Testing, Verification and Reliability, 2015, 25 (2), pp.138-163. ⟨10.1002/stvr.1566⟩ Article dans une revue hal-02380763v1
	Sat4j 2.3.2: on the fly solver configuration, System Description Daniel Le Berre , Stéphanie Roussel Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 2014, 8, pp.197-202. ⟨10.3233/SAT190098⟩ Article dans une revue hal-03300797v1
	The International SAT Solver Competitions Matti Jarvisalo , Daniel Le Berre , Olivier Roussel AI magazine, 2012, 1 (33), pp.89-94. ⟨10.1609/aimag.v33i1.2395⟩ Article dans une revue hal-00868244v1
	The SAT4J library, Release 2.2, System Description Daniel Le Berre , Anne Parrain Journal on Satisfiability, Boolean Modeling and Computation, 2010, 7, pp.59-64. ⟨10.3233/SAT190075⟩ Article dans une revue hal-00868136v1
	Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages Sylvie Coste-Marquis , Daniel Le Berre , Florian Letombe , Pierre Marquis Journal on Satisfiability, Boolean Modeling and Computation, 2006, 1, pp.61-88 Article dans une revue hal-00109570v1
	The Second QBF Solvers Comparative Evaluation M. Narizzano , L. Simon , A. Tachella , Daniel Le Berre Lecture Notes in Computer Science, 2005, 3542, pp.376-392 Article dans une revue hal-00090749v1
	The SAT 2002 Competition , Annals of Mathematics and Artificial Intelligence L Simon , Daniel Le Berre , E. Hirsch Annals of Mathematics and Artificial Intelligence, 2005, 43,, pp.307-342 Article dans une revue hal-03300798v1
	A Parsimony Tree for the SAT2002 Competition P. Purdom , L. Simon , Daniel Le Berre Annals of Mathematics and Artificial Intelligence, 2005, 43, Issue 1 - pp 343-365 Article dans une revue hal-00018851v1
	A Branching Heuristics for Quantified Renamable Horn Formulas Sylvie Coste-Marquis , Daniel Le Berre , Florian Letombe Lecture Notes in Computer Science, 2005, 3569, pp.393 Article dans une revue hal-00014611v1
	The SAT 2002 Competition L. Simon , Daniel Le Berre , E. Hirsch Annals of Mathematics and Artificial Intelligence, 2005, vol.43, Issue 1-4, pp.307-342 Article dans une revue hal-00022662v1
	Qualitative Choice Logic G. Brewka , Salem Benferhat , Daniel Le Berre Artificial Intelligence, 2004, 157 (1-2), pp.203-237. ⟨10.1016/j.artint.2004.04.006⟩ Article dans une revue hal-03299554v1
	Weakening conflicting information for iterated revision and knowledge integration Salem Benferhat , Souhila Kaci , Daniel Le Berre , Mary-Anne Williams Artificial Intelligence, 2004, 153, pp.339-371. ⟨10.1016/j.artint.2003.08.003⟩ Article dans une revue hal-03299555v1
	Using possibilistic logic for modeling qualitative decision: Atms-based algorithms Didier Dubois , Daniel Le Berre , Henri Prade , Régis Sabbadin Fundamenta Informaticae, 1999, 37 (1-2), pp.1-30. ⟨10.3233/FI-1999-371201⟩ Article dans une revue hal-03300799v1

	Compressing UNSAT Search Trees with Caching Anthony Blomme , Daniel Le Berre , Anne Parrain , Olivier Roussel ICAART 2023 : 15th International Conference on Agents and Artificial Intelligence, Feb 2023, Lisbonne, Portugal. pp.358-365, ⟨10.5220/0011671800003393⟩ Communication dans un congrès hal-04015616v1
	Use of Machine Learning for Determination of Association Constant between a Cyclodextrin and a Guest Gökhan Tahil , Fabien Delorme , Daniel Le Berre , Eric Monflier , Adlane Sayede 7^th European Conference on Cyclodextrin (EuroCD 2023), Sep 2023, Budapest (Hungary)., Hungary Communication dans un congrès hal-04214791v1
	Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning models Adlane Sayede , Gökhan Tahil , Fabien Delorme , Daniel Le Berre , Eric Monflier 9^th Symposium on Theoretical Biophysics (TheoBio2023), Jul 2023, Cetraro, Italy Communication dans un congrès hal-04193143v1
	Compresser des arbres de recherche UNSAT à l’aide d’un système de cache Anthony Blomme , Daniel Le Berre , Anne Parrain , Olivier Roussel Journées Francophones de Programmation par Contraintes (JFPC'23), Jul 2023, Strasbourg, France. pp.38-45 Communication dans un congrès hal-04425245v1
	SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks Takehide Soh , Morgan Magnin , Daniel Le Berre , Mutsunori Banbara , Naoyuki Tamura 14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023), Feb 2023, Lisbon, Portugal Communication dans un congrès hal-03964870v1
	SAF: SAT-based Attractor Finder in Asynchronous Automata Networks Takehide Soh , Morgan Magnin , Daniel Le Berre , Mutsunori Banbara , Naoyuki Tamura 21st International Conference on Computational Methods in Systems Biology (CMSB 2023), Sep 2023, Luxembourg City, Luxembourg Communication dans un congrès hal-04184830v1
	Machine learning challenges for determination of association constant between a cyclodextrin and a guest Gökhan Tahil , Fabien Delorme , Daniel Le Berre , Eric Monflier , Adlane Sayede 20^èmes Journées Cyclodextrines, Oct 2022, Lille, France Communication dans un congrès hal-03954803v1
	On Irrelevant Literals in Pseudo-Boolean Constraint Learning Daniel Le Berre , Pierre Marquis , Stefan Mengel , Romain Wallon 29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩ Communication dans un congrès hal-02912451v1
	On Dedicated CDCL Strategies for PB Solvers Daniel Le Berre , Romain Wallon 24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21), Jul 2021, Barcelone (hybride), Spain. pp.315-331, ⟨10.1007/978-3-030-80223-3_22⟩ Communication dans un congrès hal-03295263v1
	Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs Daniel Le Berre , Romain Wallon 16es Journées Francophones de Programmation par Contraintes (JFPC'21), Jun 2021, Nice (en ligne), France Communication dans un congrès hal-03295266v1
	Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning for Catalyzed Functionalization of Bio-Sourced Substrates Gökhan Tahil , Fabien Delorme , Daniel Le Berre , Eric Monflier , Adlane Sayede First international symposium on High-Throughput Catalysts Design, Jun 2021, Lille, France Communication dans un congrès hal-03957829v1
	On Weakening Strategies for PB Solvers Daniel Le Berre , Pierre Marquis , Romain Wallon 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⟩ Communication dans un congrès hal-02912458v1
	Une approche SAT sensible à la mémoire pour les logiques modales PSPACE Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail JIAF 2019 - 13es Journées de l'Intelligence Artificielle Fondamentale, Jul 2019, Toulouse, France Communication dans un congrès hal-02271392v1
	De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises Daniel Le Berre , Pierre Marquis , Stefan Mengel , Romain Wallon 15es Journées Francophones de Programmation par Contraintes (JFPC’19), Jun 2019, Albi, France. pp.43-52 Communication dans un congrès hal-02912461v1
	On Irrelevant Literals in Pseudo-Boolean Constraint Learning Daniel Le Berre , Pierre Marquis , Stefan Mengel , Romain Wallon 10th International Workshop on Pragmatics of SAT (POS'19), Jul 2019, Lisbonne, Portugal Communication dans un congrès hal-03457395v1
	A SAT-Based Approach For PSPACE Modal Logics Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail Principles of Knowledge Representation and Reasoning: Sixteenth International Conference, Oct 2018, Tempe, United States Communication dans un congrès hal-02271405v1
	An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail 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 Communication dans un congrès hal-02271403v1
	Pseudo-Boolean Constraints from a Knowledge Representation Perspective Daniel Le Berre , Pierre Marquis , Stefan Mengel , Romain Wallon 27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩ Communication dans un congrès hal-02310063v1
	A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.674-680 Communication dans un congrès hal-02271412v1
	Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation Takehide Soh , Mutsunori Banbara , Naoyuki Tamura , Daniel Le Berre 23rd International Conference on Principles and Practice of Constraint Programming (CP'17), 2017, Melbourne, Australia. pp.596-614 Communication dans un congrès hal-03300800v1
	Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail 11e Journées d'Intelligence Artificielle Fondamentale, Jul 2017, Caen, France Communication dans un congrès hal-01575536v1
	A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem Thomas Caridroit , Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail Thirty-First AAAI Conference on Artificial Intelligence, Feb 2017, San Francisco, United States Communication dans un congrès hal-02271408v1
	Complexité paramétrée de l'optimisation sous contrainte DNNF Frédéric Koriche , Daniel Le Berre , Emmanuel Lonca , Pierre Marquis 12èmes Journée Francophone de Programmation par Contraintes (JFPC'16), 2016, Montpellier, France Communication dans un congrès hal-02380769v1
	Fixed-Parameter Tractable Optimization under DNNF Constraints Frédéric Koriche , Daniel Le Berre , Emmanuel Lonca , Pierre Marquis 22nd European Conference on Artificial Intelligence (ECAI'16), 2016, The Hague, Netherlands. pp.1194-1202 Communication dans un congrès hal-02380765v1
	On Checking Kripke Models for Modal Logic K Jean-Marie Lagniez , Daniel Le Berre , Tiago de Lima , Valentin Montmirail 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 Communication dans un congrès hal-02271413v1
	A propos de la vérification de modèles en logique modale K Valentin Montmirail , Daniel Le Berre , Tiago de Lima , Jean-Marie Lagniez 10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016), Jun 2016, Montpellier, France. ⟨10.13140/RG.2.1.1178.5843⟩ Communication dans un congrès hal-01332832v1
	Détection de contraintes de cardinalité dans les CNF Armin Biere , Daniel Le Berre , Emmanuel Lonca , Norbert Manthey 10èmes Journées Francophones de Programmation par Contraintes (JFPC'14), 2014, Angers, France. pp.253-262 Communication dans un congrès hal-02380772v1
	Detecting Cardinality Constraints in CNF Armin Biere , Daniel Le Berre , Emmanuel Lonca , Norbert Manthey 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⟩ Communication dans un congrès hal-02380768v1
	Some thoughts about benchmarks for NMR Daniel Le Berre 15th International Workshop on Non-Monotonic Reasoning (NMR'14), 2014, Vienna, Austria Communication dans un congrès hal-03300807v1
	Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT Favio Demarco , Jifeng Xuan , Daniel Le Berre , Martin Monperrus Proceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis, 2014, Hyderabad, India. ⟨10.1145/2593735.2593740⟩ Communication dans un congrès hal-00977798v1
	Consistency Checking for the Evolution of Cardinality-based Feature Models Clément Quinton , Andreas Pleuss , Daniel Le Berre , Laurence Duchien , Goetz Botterweck SPLC - 18th International Software Product Line Conference, Sep 2014, Florence, Italy. pp.122-131 Communication dans un congrès hal-01054604v1
	Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem Takehide Soh , Daniel Le Berre , Stéphanie Roussel , Mutsunori Banbara , Naoyuki Tamura 14th European Conference on Logics in Artificial Intelligence (JELIA'14), 2014, Madeira, Portugal. pp.684-693 Communication dans un congrès hal-03300801v1
	Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne Daniel Le Berre , Emmanuel Lonca 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.185-194 Communication dans un congrès hal-00869924v1
	Computing prime implicants David Deharbe , Pascal Fontaine , Daniel Le Berre , Bertrand Mazure 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⟩ Communication dans un congrès hal-03300802v1
	Planning Personalised Museum Visits Daniel Le Berre , Pierre Marquis , Stéphanie Roussel 23rd International Conference on Automated Planning and Scheduling (ICAPS'13), Jun 2013, Rome, Italy. pp.380-388 Communication dans un congrès hal-00875201v1
	Optimisation multicritère pour la gestion de dépendances logicielles : utilisation de la norme de Tchebycheff Daniel Le Berre , Emmanuel Lonca , Pierre Marquis , Anne Parrain RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3 Communication dans un congrès hal-00656571v1
	Résolution de contraintes qualitatives pour le temps et l'espace par SAT à partir de treillis Jean-François Condotta , Daniel Le Berre RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3 Communication dans un congrès hal-00660969v1
	Calcul de solutions équilibrées Pareto-optimales : application au problème de gestion de dépendances logicielles Daniel Le Berre , Emmanuel Lonca , Pierre Marquis , Anne Parrain Huitièmes Journées Francophones de Programmation par Contraintes - JFPC 2012, May 2012, Toulouse, France Communication dans un congrès hal-00829567v1
	Dependency Management for the Eclipse Ecosystem: An Update Daniel Le Berre , Pascal Rapicault 3rd International Workshop on Logic and Search {LaSh'10), 2010, Edinbourgh, United Kingdom Communication dans un congrès hal-00870884v1
	Solving Linux Upgradeability Problems Using Boolean Optimization Josep Argelich , Daniel Le Berre , Inês Lynce , Joao Marques-Silva , Pascal Rapicault Workshop on Logics for Component Configuration ((LoCoCo'10), 2010, Edinbourgh, United Kingdom. pp.11-22 Communication dans un congrès hal-00870877v1
	Dependency management for the Eclipse ecosystem Daniel Le Berre , Pascal Rapicault Open Component Ecosystems International Workshop (IWOCE'09), 2009, Amsterdam, Netherlands Communication dans un congrès hal-00870855v1
	Aggregating Interval Orders by Propositional Optimization Daniel Le Berre , Pierre Marquis , Meltem Öztürk 1st International Conference on Algorithmic Decision Theory (ADT'09), 2009, Venice, Italy. pp.249-260, ⟨10.1007/978-3-642-04428-1_22⟩ Communication dans un congrès hal-00866857v1
	On SAT Technologies for dependency management and beyond Daniel Le Berre , Anne Parrain First Workshop on Software Product Lines (ASPL'08), 2008, Limerick, Ireland. pp.197-200 Communication dans un congrès hal-00870846v1
	Handling Qualitative Preferences Using Normal Form Functions Salem Benferhat , Daniel Le Berre , Karima Sedki International FLAIRS Conference (FLAIRS'07), May 2007, South Beach, United States. pp.38-43 Communication dans un congrès hal-00421714v1
	À propos de l'extension d'un solveur SAT pour traiter des contraintes pseudo-booléennes Daniel Le Berre , Anne Parrain Troisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), Jun 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France Communication dans un congrès inria-00151038v1
	On extending SAT solvers for PB problems Daniel Le Berre , Anne Parrain 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07, Jul 2007, Rome, Italy Communication dans un congrès hal-00466227v1
	Fragments propositionnels pour la compilation de connaissances et formules booléennes quantifiées Sylvie Coste-Marquis , Daniel Le Berre , Florian Letombe , Pierre Marquis 15ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle(RFIA'06), Jan 2006, Tours, France. pp.Actes électroniques Communication dans un congrès hal-00192926v1
	Representing Policies for Quantified Boolean Formulae Sylvie Coste-Marquis , Hélène Fargier , Jérôme Lang , Daniel Le Berre , Pierre Marquis Tenth International Conference on Principles of Knowledge Representation and Reasoning, Jun 2006, Lake District, United Kingdom. pp.286-296 Communication dans un congrès hal-00121155v1
	ECAI 2006 Salem Benferhat , Daniel Le Berre , Karima Sedki ECAI 2006, 2006, Riva del Garda, Italy. pp.741-742 Communication dans un congrès hal-00143833v1
	Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae Sylvie Coste-Marquis , Daniel Le Berre , Florian Letombe , Pierre Marquis The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conferencep, 2005, Pittsburg, United States. pp.288 Communication dans un congrès hal-00014629v1
	The Second QBF Solvers Comparative Evaluation Daniel Le Berre , M. Narizzano , L Simon , A Tachella Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, 2005, Vancouver, Canada. pp.376-392 Communication dans un congrès hal-03300803v1
	CSP2SAT4J: A Simple CSP to SAT translator Daniel Le Berre Second International Workshop on Constraint Propagation and Implementation(CPAI05), Oct 2005, Sitges, Spain. pp.59-66 Communication dans un congrès hal-00460869v1
	The long way from conflict driven clause learning to conflict driven constraint learning Daniel Le Berre , Anne Parrain , Olivier Roussel Guangzhou Symposium on Satisfiability and its applications (Guangzhou04), 2004, Guangzhou, China Communication dans un congrès hal-03300804v1
	Fifty-Five Solvers in Vancouver: The SAT 2004 Competition Daniel Le Berre , L. Simon Seventh International Conference on Theory and Applications of Satisfiability Testing(SAT'04), 2004, Vancouver, Canada. pp.321-344 Communication dans un congrès hal-00397465v1
	The essentials of the SAT 2003 competition Daniel Le Berre , Laurent Simon Proceedings of the Sixth International Conference on Theory and Applications of satisfiability Testing (SAT 2003), 2003, Portofino, Italy. pp.452-467 Communication dans un congrès hal-03300806v1
	OpenSAT: une plateforme SAT Open Source Gilles Audemard , Daniel Le Berre , Olivier Roussel JNPC'03, 2003, Amiens, France Communication dans un congrès hal-03299519v1
	OpenSAT: an open source SAT software project Gilles Audemard , Daniel Le Berre , Olivier Roussel , Ines Lynce , Joao Marques-Silva Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy Communication dans un congrès hal-03299485v1
	Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers Daniel Le Berre , Laurent Simon , A Tachella Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy. pp.468-485 Communication dans un congrès hal-03300805v1
	Résolution de formules booléennes quantifiées : problèmes et algorithmes Sylvie Coste-Marquis , Hélène Fargier , Jérôme Lang , Daniel Le Berre , Pierre Marquis 13ème Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA 2002), 2002, Angers, France. pp.289-298 Communication dans un congrès hal-03300386v1
	Logical representation and computation of optimal decisions in a qualitative setting Didier Dubois , Daniel Le Berre , Henri Prade , Régis Sabbadin 15th National Conference on Artificial Intelligence / 10th Innovative Applications of Artificial Intelligence Conference (AAAI / IAAI 1998), AAAI; IAAI, Jul 1998, Madison, Wisconsin, United States. pp.588--593 Communication dans un congrès hal-04026178v1

	Establishing a national research software award Isabelle Catala , Roberto Di Cosmo , Mathieu Giraud , Daniel Le Berre , Violaine Louvet 2023 Pré-publication, Document de travail hal-04258977v1

	Forges de l’Enseignement supérieur et de la Recherche - Définition, usages, limitations rencontrées et analyse des besoins Daniel Le Berre , Jean-Yves Jeannas , Roberto Di Cosmo , François Pellegrini Comité pour la science ouverte. 2023 Rapport hal-04098702v5
	Higher Education and Research Forges in France - Definition, uses, limitations encountered and needs analysis Daniel Le Berre , Jean-Yves Jeannas , Roberto Di Cosmo , François Pellegrini Comité pour la science ouverte. 2023 Rapport hal-04208924v2
	On the Complexity of Optimization Problems based on Compiled NNF Representations Daniel Le Berre , Emmanuel Lonca , Pierre Marquis [Technical Report] CRIL. 2014 Rapport hal-03296019v1
	Projet ANR BR4CP Livrables t0 + 24 Algorithmes Résultats expérimentaux individuels Daniel Le Berre [Technical Report] Centre de Recherche en Informatique de Lens. 2014 Rapport hal-03300810v1

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

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

	Proceedings of the 14th International Workshop on Pragmatics of SAT Matti Järvisalo , Daniel Le Berre 14th International Workshop on Pragmatics of SAT, 2023 Proceedings/Recueil des communications hal-04486837v1
	Proceedings of Pragmatics of SAT 2015 and 2018 Daniel Le Berre , Matti Jarvisalo Pragmatics of SAT, EPiC Series in Computing, 59, 2019 Proceedings/Recueil des communications hal-04266998v1
	19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16) Nadia Creignou , Daniel Le Berre Lecture Notes in Computer Science, 9710, Springer, 2016 Proceedings/Recueil des communications hal-03300808v1
	POS-14. Fifth Pragmatics of SAT workshop Daniel Le Berre EPiC Series in Computing, 27, 2014 Proceedings/Recueil des communications hal-04266997v1
	POS-13. Pragmatics of SAT 2013 Daniel Le Berre EPiC Series in Computing, 29, 2014 Proceedings/Recueil des communications hal-04266995v1
	POS-10. Pragmatics of SAT Daniel Le Berre EPiC Series in Computing, 8, 2012 Proceedings/Recueil des communications hal-04266993v1

	Special Volume on the SAT 2005 competitions and evaluations L. Simon , Daniel Le Berre Journal of Satisfiability, Boolean Modeling and Computation, 2, 2006 N°spécial de revue/special issue hal-00459960v1

	Valoriser la recherche par le logiciel libre Daniel Le Berre 2022 Article de blog scientifique hal-04266999v1
	D’un laboratoire universitaire à 40 millions d’utilisateurs, l’aventure d’un logiciel libre Daniel Le Berre 2020 Article de blog scientifique hal-04264143v1

Daniel Le Berre

Publications

Curated dataset of association constants between a cyclodextrin and a guest for machine learning

The Silent (R)evolution of SAT

Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach

Boolean-Based Dependency Management for the Eclipse Ecosystem

Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs

Automated metamorphic testing of variability analysis tools

Sat4j 2.3.2: on the fly solver configuration, System Description

The International SAT Solver Competitions

The SAT4J library, Release 2.2, System Description

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages

The Second QBF Solvers Comparative Evaluation

The SAT 2002 Competition , Annals of Mathematics and Artificial Intelligence

A Parsimony Tree for the SAT2002 Competition

A Branching Heuristics for Quantified Renamable Horn Formulas

The SAT 2002 Competition

Qualitative Choice Logic

Weakening conflicting information for iterated revision and knowledge integration

Using possibilistic logic for modeling qualitative decision: Atms-based algorithms

Compressing UNSAT Search Trees with Caching

Use of Machine Learning for Determination of Association Constant between a Cyclodextrin and a Guest

Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning models

Compresser des arbres de recherche UNSAT à l’aide d’un système de cache

SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks

SAF: SAT-based Attractor Finder in Asynchronous Automata Networks

Machine learning challenges for determination of association constant between a cyclodextrin and a guest

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

On Dedicated CDCL Strategies for PB Solvers

Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs

Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning for Catalyzed Functionalization of Bio-Sourced Substrates

On Weakening Strategies for PB Solvers

Une approche SAT sensible à la mémoire pour les logiques modales PSPACE

De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

A SAT-Based Approach For PSPACE Modal Logics

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem

Pseudo-Boolean Constraints from a Knowledge Representation Perspective

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem

Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation

Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem

Complexité paramétrée de l'optimisation sous contrainte DNNF

Fixed-Parameter Tractable Optimization under DNNF Constraints

On Checking Kripke Models for Modal Logic K

A propos de la vérification de modèles en logique modale K

Détection de contraintes de cardinalité dans les CNF

Detecting Cardinality Constraints in CNF

Some thoughts about benchmarks for NMR

Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT

Consistency Checking for the Evolution of Cardinality-based Feature Models

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem

Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne

Computing prime implicants

Planning Personalised Museum Visits

Optimisation multicritère pour la gestion de dépendances logicielles : utilisation de la norme de Tchebycheff

Résolution de contraintes qualitatives pour le temps et l'espace par SAT à partir de treillis

Calcul de solutions équilibrées Pareto-optimales : application au problème de gestion de dépendances logicielles

Dependency Management for the Eclipse Ecosystem: An Update

Solving Linux Upgradeability Problems Using Boolean Optimization

Dependency management for the Eclipse ecosystem

Aggregating Interval Orders by Propositional Optimization

On SAT Technologies for dependency management and beyond

Handling Qualitative Preferences Using Normal Form Functions

À propos de l'extension d'un solveur SAT pour traiter des contraintes pseudo-booléennes

On extending SAT solvers for PB problems

Fragments propositionnels pour la compilation de connaissances et formules booléennes quantifiées

Representing Policies for Quantified Boolean Formulae

ECAI 2006

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae

The Second QBF Solvers Comparative Evaluation

CSP2SAT4J: A Simple CSP to SAT translator

The long way from conflict driven clause learning to conflict driven constraint learning

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition

The essentials of the SAT 2003 competition

OpenSAT: une plateforme SAT Open Source

OpenSAT: an open source SAT software project

Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers

Résolution de formules booléennes quantifiées : problèmes et algorithmes

Logical representation and computation of optimal decisions in a qualitative setting