Daniel Le Berre

76 papers A* 11A 14B 5Misc 1Journal 25Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Not All Countermodels Are Equal. ICAART (4) Daniel Crowley, Daniel Le Berre, Yakoub Salhi
2025	B	`conf`	A Framework for Hybrid Set-Theoretic and Numerical Problem Solving. ICTAI Daniel Crowley, Daniel Le Berre, Olivier Roussel, Yakoub Salhi
2025	A*	`conf`	A SAT-based Method for Counting All Singleton Attractors in Boolean Networks. IJCAI Rei Higuchi, Takehide Soh, Daniel Le Berre, Morgan Magnin, Mutsunori Banbara, Naoyuki Tamura
2025	A	`conf`	Practically Feasible Proof Logging for Pseudo-Boolean Optimization. CP Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan, Marc Vinyals
2025	A	`conf`	SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. SAT Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura
2024	—	`conf`	Compressing UNSAT CDCL Trees with Caching. ICAART (3) Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel
2024	J	`jnl`	Stereoisomers Are Not Machine Learning's Best Friends. J. Chem. Inf. Model. Gökhan Tahil, Fabien Delorme, Daniel Le Berre, Éric Monflier, Adlane Sayede, Sébastien Tilloy
2023	—	`conf`	Compressing UNSAT Search Trees with Caching. ICAART (3) Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel
2023	—	`ed.`	Proceedings of the 14th International Workshop on Pragmatics of SAT co-located with the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy, July 4, 2023. POS@SAT Matti Järvisalo, Daniel Le Berre
2023	—	`conf`	SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
2023	—	`conf`	SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
2023	J	`jnl`	The Silent (R)evolution of SAT. Commun. ACM Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
2022	J	`jnl`	Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach. Autom. Softw. Eng. Xhevahire Tërnava, Johann Mortara, Philippe Collet, Daniel Le Berre
2021	A	`conf`	On Dedicated CDCL Strategies for PB Solvers. SAT Daniel Le Berre, Romain Wallon
2021	J	`jnl`	On Dedicated CDCL Strategies for PB Solvers. CoRR Daniel Le Berre, Romain Wallon
2020	A*	`conf`	On Irrelevant Literals in Pseudo-Boolean Constraint Learning. IJCAI Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
2020	J	`jnl`	On Irrelevant Literals in Pseudo-Boolean Constraint Learning. CoRR Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
2020	A	`conf`	On Weakening Strategies for PB Solvers. SAT Daniel Le Berre, Pierre Marquis, Romain Wallon
2020	J	`jnl`	On Weakening Strategies for PB Solvers. CoRR Daniel Le Berre, Pierre Marquis, Romain Wallon
2019	—	`ed.`	Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018. POS@SAT Daniel Le Berre, Matti Järvisalo
2018	A*	`conf`	A SAT-Based Approach For PSPACE Modal Logics. KR Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
2018	A	`conf`	An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. IJCAR Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
2018	J	`jnl`	Boolean-Based Dependency Management for the Eclipse Ecosystem. Int. J. Artif. Intell. Tools Daniel Le Berre, Pascal Rapicault
2018	J	`jnl`	Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. CoRR Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clément, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus
2018	A*	`conf`	Pseudo-Boolean Constraints from a Knowledge Representation Perspective. IJCAI Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
2017	A*	`conf`	A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
2017	A*	`conf`	A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. AAAI Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
2017	J	`jnl`	Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. IEEE Trans. Software Eng. Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clement, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus
2017	A	`conf`	Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre
2016	A	`conf`	Fixed-Parameter Tractable Optimization Under DNNF Constraints. ECAI Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
2016	—	`conf`	On Checking Kripke Models for Modal Logic K. PAAR@IJCAR Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
2016	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings SAT Nadia Creignou, Daniel Le Berre
2015	J	`jnl`	Automated metamorphic testing of variability analysis tools. Softw. Test. Verification Reliab. Sergio Segura, Amador Durán, Ana Belén Sánchez, Daniel Le Berre, Emmanuel Lonca, Antonio Ruiz Cortés
2014	J	`jnl`	Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT. CoRR Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus
2014	—	`conf`	Automatic repair of buggy if conditions and missing preconditions with SMT. CSTVA Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus
2014	B	`conf`	Consistency checking for the evolution of cardinality-based feature models. SPLC Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck
2014	A	`conf`	Detecting Cardinality Constraints in CNF. SAT Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey
2014	B	`conf`	Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura
2014	J	`jnl`	On the Complexity of Optimization Problems based on Compiled NNF Representations. CoRR Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
2014	—	`ed.`	POS-13. Fourth Pragmatics of SAT workshop, a workshop of the SAT 2013 conference, July 7, 2013, Helsinki, Finland POS@SAT Daniel Le Berre
2014	—	`ed.`	POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria POS@SAT Daniel Le Berre
2014	J	`jnl`	Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne. Rev. d'Intelligence Artif. Daniel Le Berre, Emmanuel Lonca
2014	J	`jnl`	Sat4j 2.3.2: on the fly solver configuration System Description. J. Satisf. Boolean Model. Comput. Daniel Le Berre, Stéphanie Roussel
2014	J	`jnl`	Some thoughts about benchmarks for NMR. CoRR Daniel Le Berre
2013	B	`conf`	Computing prime implicants. FMCAD David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure
2013	A*	`conf`	Planning Personalised Museum Visits. ICAPS Daniel Le Berre, Pierre Marquis, Stéphanie Roussel
2012	—	`ed.`	POS-10. Pragmatics of SAT, Edinburgh, UK, July 10, 2010 POS@SAT Daniel Le Berre
2012	J	`jnl`	The International SAT Solver Competitions. AI Mag. Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon
2010	—	`book`	Sat4j, un moteur libre de raisonnement en logique propositionnelle. (Sat4j, an open reasoning platform for propositional reasoning). Daniel Le Berre
2010	—	`conf`	Solving Linux Upgradeability Problems Using Boolean Optimization LoCoCo Josep Argelich, Daniel Le Berre, Inês Lynce, João Marques-Silva, Pascal Rapicault
2010	J	`jnl`	The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput. Daniel Le Berre, Anne Parrain
2009	—	`conf`	Aggregating Interval Orders by Propositional Optimization. ADT Daniel Le Berre, Pierre Marquis, Meltem Öztürk
2008	—	`conf`	On SAT Technologies for Dependency Management and Beyond. SPLC (2) Daniel Le Berre, Anne Parrain
2007	Misc	`conf`	Handling Qualitative Preferences Using Normal Form Functions. FLAIRS Salem Benferhat, Daniel Le Berre, Karima Sedki
2006	A	`conf`	An Alternative Inference for Qualitative Choice Logic. ECAI Salem Benferhat, Daniel Le Berre, Karima Sedki
2006	J	`jnl`	Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
2006	J	`jnl`	Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. J. Satisf. Boolean Model. Comput. Daniel Le Berre, Laurent Simon
2006	A*	`conf`	Representing Policies for Quantified Boolean Formulae. KR Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis
2005	A	`conf`	A Branching Heuristics for Quantified Renamable Horn Formulas. SAT Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe
2005	J	`jnl`	A parsimony tree for the SAT2002 competition. Ann. Math. Artif. Intell. Paul W. Purdom, Daniel Le Berre, Laurent Simon
2005	A*	`conf`	Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
2005	J	`jnl`	The SAT2002 competition. Ann. Math. Artif. Intell. Laurent Simon, Daniel Le Berre, Edward A. Hirsch
2004	—	`conf`	Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. SAT (Selected Papers Daniel Le Berre, Laurent Simon
2004	J	`jnl`	Qualitative choice logic. Artif. Intell. Gerhard Brewka, Salem Benferhat, Daniel Le Berre
2004	—	`conf`	The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella
2004	J	`jnl`	Weakening conflicting information for iterated revision and knowledge integration. Artif. Intell. Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
2003	A	`conf`	Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. SAT Daniel Le Berre, Laurent Simon, Armando Tacchella
2003	A	`conf`	The Essentials of the SAT 2003 Competition. SAT Daniel Le Berre, Laurent Simon
2002	A*	`conf`	Qualitative Choice Logic. KR Gerhard Brewka, Salem Benferhat, Daniel Le Berre
2001	J	`jnl`	Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. Daniel Le Berre
2001	A*	`conf`	Weakening Conflicting Information for Iterated Revision and Knowledge Integration. IJCAI Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
2000	—	`—`	Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications). Daniel Le Berre
1999	J	`jnl`	Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. Fundam. Informaticae Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
1998	—	`conf`	Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. AAAI/IAAI Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
1996	B	`conf`	Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. ICTAI Leila Amgoud, Claudette Cayrol, Daniel Le Berre
1996	A	`conf`	Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. ECAI Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre