Daniel Le Berre

Orcid: 0000-0003-3221-9923

Affiliations:
  • Artois University, France


According to our database1, Daniel Le Berre authored at least 58 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stereoisomers Are Not Machine Learning's Best Friends.
J. Chem. Inf. Model., 2024

Compressing UNSAT CDCL Trees with Caching.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
The Silent (R)evolution of SAT.
Commun. ACM, June, 2023

Compressing UNSAT Search Trees with Caching.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks.
Proceedings of the Computational Methods in Systems Biology, 2023

SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks.
Proceedings of the 16th International Joint Conference on Biomedical Engineering Systems and Technologies, 2023

2022
Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach.
Autom. Softw. Eng., 2022

2021
On Dedicated CDCL Strategies for PB Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
On Weakening Strategies for PB Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

On Irrelevant Literals in Pseudo-Boolean Constraint Learning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018
Boolean-Based Dependency Management for the Eclipse Ecosystem.
Int. J. Artif. Intell. Tools, 2018

A SAT-Based Approach For PSPACE Modal Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Pseudo-Boolean Constraints from a Knowledge Representation Perspective.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs.
IEEE Trans. Software Eng., 2017

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation.
Proceedings of the Principles and Practice of Constraint Programming, 2017

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Fixed-Parameter Tractable Optimization Under DNNF Constraints.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On Checking Kripke Models for Modal Logic K.
Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), 2016

2015
Automated metamorphic testing of variability analysis tools.
Softw. Test. Verification Reliab., 2015

2014
Réutiliser ou adapter les prouveurs SAT pour l'optimisation booléenne.
Rev. d'Intelligence Artif., 2014

Sat4j 2.3.2: on the fly solver configuration System Description.
J. Satisf. Boolean Model. Comput., 2014

On the Complexity of Optimization Problems based on Compiled NNF Representations.
CoRR, 2014

Some thoughts about benchmarks for NMR.
CoRR, 2014

Consistency checking for the evolution of cardinality-based feature models.
Proceedings of the 18th International Software Product Line Conference, 2014

Detecting Cardinality Constraints in CNF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Automatic repair of buggy if conditions and missing preconditions with SMT.
Proceedings of the 6th International Workshop on Constraints in Software Testing, 2014

2013
Computing prime implicants.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Planning Personalised Museum Visits.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
The International SAT Solver Competitions.
AI Mag., 2012

2010
The Sat4j library, release 2.2.
J. Satisf. Boolean Model. Comput., 2010

Solving Linux Upgradeability Problems Using Boolean Optimization
Proceedings of the Proceedings First International Workshop on Logics for Component Configuration, 2010

Sat4j, un moteur libre de raisonnement en logique propositionnelle. (Sat4j, an open reasoning platform for propositional reasoning).
, 2010

2009
Aggregating Interval Orders by Propositional Optimization.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
On SAT Technologies for Dependency Management and Beyond.
Proceedings of the Software Product Lines, 12th International Conference, 2008

2007
Handling Qualitative Preferences Using Normal Form Functions.
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2006
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.
J. Satisf. Boolean Model. Comput., 2006

Preface to the Special Volume on the SAT 2005 Competitions and Evaluations.
J. Satisf. Boolean Model. Comput., 2006

Representing Policies for Quantified Boolean Formulae.
Proceedings of the Proceedings, 2006

An Alternative Inference for Qualitative Choice Logic.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
The SAT2002 competition.
Ann. Math. Artif. Intell., 2005

A parsimony tree for the SAT2002 competition.
Ann. Math. Artif. Intell., 2005

A Branching Heuristics for Quantified Renamable Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae.
Proceedings of the Proceedings, 2005

2004
Qualitative choice logic.
Artif. Intell., 2004

Weakening conflicting information for iterated revision and knowledge integration.
Artif. Intell., 2004

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

The Second QBF Solvers Comparative Evaluation.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

2003
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

The Essentials of the SAT 2003 Competition.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2001
Exploiting the real power of unit propagation lookahead.
Electron. Notes Discret. Math., 2001

2000
Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications).
PhD thesis, 2000

1999
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms.
Fundam. Informaticae, 1999

1998
Logical Representation and Computation of Optimal Decisions in a Qualitative Setting.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1996
Comparing Arguments Using Preference Ordering for Argument-Based Reasoning.
Proceedings of the Eigth International Conference on Tools with Artificial Intelligence, 1996

Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996


  Loading...