Daniel Le Berre
Publications
Publications
|
|
Not All Countermodels Are EqualICAART, Mar 2026, Marbella, Spain. pp.3028-3035 |
Practically Feasible Proof Logging for Pseudo-Boolean Optimization31st International Conference on Principles and Practice of Constraint Programming (CP 2025), Aug 2025, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.CP.2025.21⟩ |
|
A SAT-based Method for Counting All Singleton Attractors in Boolean NetworksThirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI-25), Aug 2025, Montreal, Canada. pp.2601-2609, ⟨10.24963/ijcai.2025/290⟩ |
|
SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025), Aug 2025, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.SAT.2025.24⟩ |
|
|
|
SAF: SAT-based Attractor Finder in Asynchronous Automata Networks21st International Conference on Computational Methods in Systems Biology (CMSB 2023), Sep 2023, Luxembourg City, Luxembourg |
|
|
SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023), Feb 2023, Lisbon, Portugal |
Use of Machine Learning for Determination of Association Constant between a Cyclodextrin and a Guest7th European Conference on Cyclodextrin (EuroCD 2023), Sep 2023, Budapest (Hungary)., Hungary |
|
|
|
Compressing UNSAT Search Trees with CachingICAART 2023 : 15th International Conference on Agents and Artificial Intelligence, Feb 2023, Lisbonne, Portugal. pp.358-365, ⟨10.5220/0011671800003393⟩ |
Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning models9th Symposium on Theoretical Biophysics (TheoBio2023), Jul 2023, Cetraro, Italy |
|
|
|
Compresser des arbres de recherche UNSAT à l’aide d’un système de cacheJournées Francophones de Programmation par Contraintes (JFPC'23), Jul 2023, Strasbourg, France. pp.38-45 |
Machine learning challenges for determination of association constant between a cyclodextrin and a guest20èmes Journées Cyclodextrines, Oct 2022, Lille, France |
|
|
|
Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs16es Journées Francophones de Programmation par Contraintes (JFPC'21), Jun 2021, Nice (en ligne), France |
|
|
On Dedicated CDCL Strategies for PB Solvers24th 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⟩ |
Determination of the Association Constant between a Cyclodextrin and a Guest using Machine Learning for Catalyzed Functionalization of Bio-Sourced SubstratesFirst international symposium on High-Throughput Catalysts Design, Jun 2021, Lille, France |
|
|
|
On Irrelevant Literals in Pseudo-Boolean Constraint Learning29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩ |
|
|
On Weakening Strategies for PB Solvers23rd 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⟩ |
|
|
De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises15es Journées Francophones de Programmation par Contraintes (JFPC’19), Jun 2019, Albi, France. pp.43-52 |
On Irrelevant Literals in Pseudo-Boolean Constraint Learning10th International Workshop on Pragmatics of SAT (POS'19), Jul 2019, Lisbonne, Portugal |
|
|
|
Une approche SAT sensible à la mémoire pour les logiques modales PSPACEJIAF 2019 - 13es Journées de l'Intelligence Artificielle Fondamentale, Jul 2019, Toulouse, France |
|
|
Pseudo-Boolean Constraints from a Knowledge Representation Perspective27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩ |
|
|
A SAT-Based Approach For PSPACE Modal LogicsPrinciples of Knowledge Representation and Reasoning: Sixteenth International Conference, Oct 2018, Tempe, United States |
|
|
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability ProblemAutomated 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 |
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation23rd International Conference on Principles and Practice of Constraint Programming (CP'17), 2017, Melbourne, Australia. pp.596-614 |
|
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability ProblemTwenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.674-680 |
|
Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K11e Journées d'Intelligence Artificielle Fondamentale, Jul 2017, Caen, France |
|
|
|
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability ProblemThirty-First AAAI Conference on Artificial Intelligence, Feb 2017, San Francisco, United States |
Fixed-Parameter Tractable Optimization under DNNF Constraints22nd European Conference on Artificial Intelligence (ECAI'16), 2016, The Hague, Netherlands. pp.1194-1202 |
|
Complexité paramétrée de l'optimisation sous contrainte DNNF12èmes Journée Francophone de Programmation par Contraintes (JFPC'16), 2016, Montpellier, France |
|
|
|
On Checking Kripke Models for Modal Logic KProceedings 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 |
A propos de la vérification de modèles en logique modale K10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016), Jun 2016, Montpellier, France. ⟨10.13140/RG.2.1.1178.5843⟩ |
|
|
|
Automatic Repair of Buggy If Conditions and Missing Preconditions with SMTProceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis, 2014, Hyderabad, India. ⟨10.1145/2593735.2593740⟩ |
Détection de contraintes de cardinalité dans les CNF10èmes Journées Francophones de Programmation par Contraintes (JFPC'14), 2014, Angers, France. pp.253-262 |
|
|
|
Consistency Checking for the Evolution of Cardinality-based Feature ModelsSPLC - 18th International Software Product Line Conference, Sep 2014, Florence, Italy. pp.122-131 |
|
|
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem14th European Conference on Logics in Artificial Intelligence (JELIA'14), 2014, Madeira, Portugal. pp.684-693 |
|
|
Some thoughts about benchmarks for NMR15th International Workshop on Non-Monotonic Reasoning (NMR'14), 2014, Vienna, Austria |
|
|
Detecting Cardinality Constraints in CNF17th 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⟩ |
Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.185-194 |
|
|
|
Planning Personalised Museum Visits23rd International Conference on Automated Planning and Scheduling (ICAPS'13), Jun 2013, Rome, Italy. pp.380-388 |
Computing prime implicants13th 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⟩ |
|
|
|
Calcul de solutions équilibrées Pareto-optimales : application au problème de gestion de dépendances logiciellesHuitièmes Journées Francophones de Programmation par Contraintes - JFPC 2012, May 2012, Toulouse, France |
|
|
Résolution de contraintes qualitatives pour le temps et l'espace par SAT à partir de treillisRFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3 |
|
|
Optimisation multicritère pour la gestion de dépendances logicielles : utilisation de la norme de TchebycheffRFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3 |
|
|
Dependency Management for the Eclipse Ecosystem: An Update3rd International Workshop on Logic and Search {LaSh'10), 2010, Edinbourgh, United Kingdom |
Solving Linux Upgradeability Problems Using Boolean OptimizationWorkshop on Logics for Component Configuration ((LoCoCo'10), 2010, Edinbourgh, United Kingdom. pp.11-22 |
|
|
|
Dependency management for the Eclipse ecosystemOpen Component Ecosystems International Workshop (IWOCE'09), 2009, Amsterdam, Netherlands |
|
|
Aggregating Interval Orders by Propositional Optimization1st International Conference on Algorithmic Decision Theory (ADT'09), 2009, Venice, Italy. pp.249-260, ⟨10.1007/978-3-642-04428-1_22⟩ |
|
|
On SAT Technologies for dependency management and beyondFirst Workshop on Software Product Lines (ASPL'08), 2008, Limerick, Ireland. pp.197-200 |
Handling Qualitative Preferences Using Normal Form FunctionsInternational FLAIRS Conference (FLAIRS'07), May 2007, South Beach, United States. pp.38-43 |
|
|
|
À propos de l'extension d'un solveur SAT pour traiter des contraintes pseudo-booléennesTroisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), Jun 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France |
On extending SAT solvers for PB problems14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07, Jul 2007, Rome, Italy |
|
ECAI 2006ECAI 2006, 2006, Riva del Garda, Italy. pp.741-742 |
|
|
|
Representing Policies for Quantified Boolean FormulaeTenth International Conference on Principles of Knowledge Representation and Reasoning, Jun 2006, Lake District, United Kingdom. pp.286-296 |
Fragments propositionnels pour la compilation de connaissances et formules booléennes quantifiées15ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle(RFIA'06), Jan 2006, Tours, France. pp.Actes électroniques |
|
|
|
Fifty-Five Solvers in Vancouver: The SAT 2004 CompetitionSeventh International Conference on Theory and Applications of Satisfiability Testing(SAT'04), 2004, Vancouver, Canada. pp.321-344 |
CSP2SAT4J: A Simple CSP to SAT translatorSecond International Workshop on Constraint Propagation and Implementation(CPAI05), Oct 2005, Sitges, Spain. pp.59-66 |
|
The Second QBF Solvers Comparative EvaluationProceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, 2005, Vancouver, Canada. pp.376-392 |
|
Propositional Fragments for Knowledge Compilation and Quantified Boolean FormulaeThe Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conferencep, 2005, Pittsburg, United States. pp.288 |
|
The long way from conflict driven clause learning to conflict driven constraint learningGuangzhou Symposium on Satisfiability and its applications (Guangzhou04), 2004, Guangzhou, China |
|
OpenSAT: une plateforme SAT Open SourceJNPC'03, 2003, Amiens, France |
|
Challenges in the QBF arena : the SAT'03 evaluation of QBF solversProceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy. pp.468-485 |
|
The essentials of the SAT 2003 competitionProceedings of the Sixth International Conference on Theory and Applications of satisfiability Testing (SAT 2003), 2003, Portofino, Italy. pp.452-467 |
|
OpenSAT: an open source SAT software projectSixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy |
|
Résolution de formules booléennes quantifiées : problèmes et algorithmes13ème Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA 2002), 2002, Angers, France. pp.289-298 |
|
Logical representation and computation of optimal decisions in a qualitative setting15th 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 |
|
|
Establishing a national research software award2023 |
|
|
Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applicationsIntelligence artificielle [cs.AI]. Université Toulouse III Paul Sabatier, 2000. Français. ⟨NNT : ⟩ |
|
|
Sat4j, un moteur libre de raisonnement en logique propositionnelleIntelligence artificielle [cs.AI]. Université d'Artois, 2010 |
Proceedings of the 14th International Workshop on Pragmatics of SAT14th International Workshop on Pragmatics of SAT, 2023 |
|
Proceedings of Pragmatics of SAT 2015 and 2018Pragmatics of SAT, EPiC Series in Computing, 59, 2019 |
|
19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16)Lecture Notes in Computer Science, 9710, Springer, 2016 |
|
POS-13. Pragmatics of SAT 2013EPiC Series in Computing, 29, 2014 |
|
POS-14. Fifth Pragmatics of SAT workshopEPiC Series in Computing, 27, 2014 |
|
POS-10. Pragmatics of SATEPiC Series in Computing, 8, 2012 |
Special Volume on the SAT 2005 competitions and evaluationsJournal of Satisfiability, Boolean Modeling and Computation, 2, 2006 |
Valoriser la recherche par le logiciel libre2022 |
|
D’un laboratoire universitaire à 40 millions d’utilisateurs, l’aventure d’un logiciel libre2020 |