default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Le Berre
Person information
- affiliation: Artois University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Gökhan Tahil, Fabien Delorme, Daniel Le Berre, Éric Monflier
, Adlane Sayede, Sébastien Tilloy:
Stereoisomers Are Not Machine Learning's Best Friends. J. Chem. Inf. Model. 64(14): 5451-5469 (2024)- [c38]Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel:
Compressing UNSAT CDCL Trees with Caching. ICAART (3) 2024: 792-799 - 2023
- [j17]Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider:
The Silent (R)evolution of SAT. Commun. ACM 66(6): 64-72 (2023) - [c37]Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS 2023: 163-174 - [c36]Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB 2023: 175-183 - [c35]Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel:
Compressing UNSAT Search Trees with Caching. ICAART (3) 2023: 358-365 - [e6]Matti Järvisalo, Daniel Le Berre:
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. CEUR Workshop Proceedings 3545, CEUR-WS.org 2023 [contents] - 2022
- [j16]Xhevahire Tërnava, Johann Mortara, Philippe Collet, Daniel Le Berre:
Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach. Autom. Softw. Eng. 29(1): 25 (2022) - 2021
- [c34]Daniel Le Berre, Romain Wallon:
On Dedicated CDCL Strategies for PB Solvers. SAT 2021: 315-331 - [i7]Daniel Le Berre, Romain Wallon:
On Dedicated CDCL Strategies for PB Solvers. CoRR abs/2109.01013 (2021) - 2020
- [c33]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. IJCAI 2020: 1148-1154 - [c32]Daniel Le Berre, Pierre Marquis, Romain Wallon:
On Weakening Strategies for PB Solvers. SAT 2020: 322-331 - [i6]Daniel Le Berre, Pierre Marquis, Romain Wallon:
On Weakening Strategies for PB Solvers. CoRR abs/2005.04466 (2020) - [i5]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. CoRR abs/2012.04424 (2020)
2010 – 2019
- 2019
- [e5]Daniel Le Berre, Matti Järvisalo:
Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018. EPiC Series in Computing 59, EasyChair 2019 [contents] - 2018
- [j15]Daniel Le Berre, Pascal Rapicault:
Boolean-Based Dependency Management for the Eclipse Ecosystem. Int. J. Artif. Intell. Tools 27(1): 1840003:1-1840003:23 (2018) - [c31]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. IJCAR 2018: 1-18 - [c30]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
Pseudo-Boolean Constraints from a Knowledge Representation Perspective. IJCAI 2018: 1891-1897 - [c29]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A SAT-Based Approach For PSPACE Modal Logics. KR 2018: 651-652 - [i4]Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clément, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus:
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. CoRR abs/1811.04211 (2018) - 2017
- [j14]Jifeng Xuan, Matias Martinez, Favio Demarco, Maxime Clement, Sebastian R. Lamelas Marcote, Thomas Durieux, Daniel Le Berre, Martin Monperrus:
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs. IEEE Trans. Software Eng. 43(1): 34-55 (2017) - [c28]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. AAAI 2017: 3864-3870 - [c27]Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre:
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP 2017: 596-614 - [c26]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI 2017: 674-680 - 2016
- [c25]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
On Checking Kripke Models for Modal Logic K. PAAR@IJCAR 2016: 69-81 - [c24]Frédéric Koriche, Daniel Le Berre, Emmanuel Lonca, Pierre Marquis:
Fixed-Parameter Tractable Optimization Under DNNF Constraints. ECAI 2016: 1194-1202 - [e4]Nadia Creignou, Daniel Le Berre:
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. Lecture Notes in Computer Science 9710, Springer 2016, ISBN 978-3-319-40969-6 [contents] - 2015
- [j13]Sergio Segura, Amador Durán, Ana Belén Sánchez, Daniel Le Berre, Emmanuel Lonca, Antonio Ruiz Cortés:
Automated metamorphic testing of variability analysis tools. Softw. Test. Verification Reliab. 25(2): 138-163 (2015) - 2014
- [j12]Daniel Le Berre, Stéphanie Roussel:
Sat4j 2.3.2: on the fly solver configuration System Description. J. Satisf. Boolean Model. Comput. 8(3/4): 197-202 (2014) - [j11]Daniel Le Berre, Emmanuel Lonca:
Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne. Rev. d'Intelligence Artif. 28(5): 615-636 (2014) - [c23]Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus:
Automatic repair of buggy if conditions and missing preconditions with SMT. CSTVA 2014: 30-39 - [c22]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. JELIA 2014: 684-693 - [c21]Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey:
Detecting Cardinality Constraints in CNF. SAT 2014: 285-301 - [c20]Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck:
Consistency checking for the evolution of cardinality-based feature models. SPLC 2014: 122-131 - [e3]Daniel Le Berre:
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. EPiC Series in Computing 27, EasyChair 2014 [contents] - [e2]Daniel Le Berre:
POS-13. Fourth Pragmatics of SAT workshop, a workshop of the SAT 2013 conference, July 7, 2013, Helsinki, Finland. EPiC Series in Computing 29, EasyChair 2014 [contents] - [i3]Favio Demarco, Jifeng Xuan, Daniel Le Berre, Martin Monperrus:
Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT. CoRR abs/1404.3186 (2014) - [i2]Daniel Le Berre:
Some thoughts about benchmarks for NMR. CoRR abs/1405.1183 (2014) - [i1]Daniel Le Berre, Emmanuel Lonca, Pierre Marquis:
On the Complexity of Optimization Problems based on Compiled NNF Representations. CoRR abs/1410.6690 (2014) - 2013
- [c19]Daniel Le Berre, Pierre Marquis, Stéphanie Roussel:
Planning Personalised Museum Visits. ICAPS 2013 - [c18]David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure:
Computing prime implicants. FMCAD 2013: 46-52 - 2012
- [j10]Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon:
The International SAT Solver Competitions. AI Mag. 33(1): 89-92 (2012) - [e1]Daniel Le Berre:
POS-10. Pragmatics of SAT, Edinburgh, UK, July 10, 2010. EPiC Series in Computing 8, EasyChair 2012 [contents] - 2010
- [b2]Daniel Le Berre:
Sat4j, un moteur libre de raisonnement en logique propositionnelle. (Sat4j, an open reasoning platform for propositional reasoning). Artois University, Arras, France, 2010 - [j9]Daniel Le Berre, Anne Parrain:
The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput. 7(2-3): 59-6 (2010) - [c17]Josep Argelich, Daniel Le Berre, Inês Lynce, João Marques-Silva, Pascal Rapicault:
Solving Linux Upgradeability Problems Using Boolean Optimization. LoCoCo 2010: 11-22
2000 – 2009
- 2009
- [c16]Daniel Le Berre, Pierre Marquis, Meltem Öztürk:
Aggregating Interval Orders by Propositional Optimization. ADT 2009: 249-260 - 2008
- [c15]Daniel Le Berre, Anne Parrain:
On SAT Technologies for Dependency Management and Beyond. SPLC (2) 2008: 197-200 - 2007
- [c14]Salem Benferhat, Daniel Le Berre, Karima Sedki:
Handling Qualitative Preferences Using Normal Form Functions. FLAIRS 2007: 38-43 - 2006
- [j8]Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. 1(1): 61-88 (2006) - [j7]Daniel Le Berre, Laurent Simon:
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. J. Satisf. Boolean Model. Comput. 2(1-4) (2006) - [c13]Salem Benferhat, Daniel Le Berre, Karima Sedki:
An Alternative Inference for Qualitative Choice Logic. ECAI 2006: 741-742 - [c12]Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis:
Representing Policies for Quantified Boolean Formulae. KR 2006: 286-297 - 2005
- [j6]Laurent Simon, Daniel Le Berre, Edward A. Hirsch:
The SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 307-342 (2005) - [j5]Paul W. Purdom, Daniel Le Berre, Laurent Simon:
A parsimony tree for the SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 343-365 (2005) - [c11]Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293 - [c10]Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas. SAT 2005: 393-399 - 2004
- [j4]Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams:
Weakening conflicting information for iterated revision and knowledge integration. Artif. Intell. 153(1-2): 339-371 (2004) - [j3]Gerhard Brewka, Salem Benferhat, Daniel Le Berre:
Qualitative choice logic. Artif. Intell. 157(1-2): 203-237 (2004) - [c9]Daniel Le Berre, Laurent Simon:
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. SAT (Selected Papers 2004: 321-344 - [c8]Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella:
The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers 2004: 376-392 - 2003
- [c7]Daniel Le Berre, Laurent Simon:
The Essentials of the SAT 2003 Competition. SAT 2003: 452-467 - [c6]Daniel Le Berre, Laurent Simon, Armando Tacchella:
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. SAT 2003: 468-485 - 2002
- [c5]Gerhard Brewka, Salem Benferhat, Daniel Le Berre:
Qualitative Choice Logic. KR 2002: 158-169 - 2001
- [j2]Daniel Le Berre:
Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. 9: 59-80 (2001) - [c4]Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams:
Weakening Conflicting Information for Iterated Revision and Knowledge Integration. IJCAI 2001: 109-118 - 2000
- [b1]Daniel Le Berre:
Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications). Paul Sabatier University, Toulouse, France, 2000
1990 – 1999
- 1999
- [j1]Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin:
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. Fundam. Informaticae 37(1-2): 1-30 (1999) - 1998
- [c3]Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin:
Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. AAAI/IAAI 1998: 588-593 - 1996
- [c2]Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre:
Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. ECAI 1996: 350-354 - [c1]Leila Amgoud, Claudette Cayrol, Daniel Le Berre:
Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. ICTAI 1996: 400-403
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
