Laurent Simon

Orcid: 0000-0003-0544-5503

Affiliations:
  • CNRS Bordeaux INP, Talence, France


According to our database1, Laurent Simon authored at least 42 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Drift Detection: Introducing Gaussian Split Detector.
CoRR, 2024

2023
A Robust Drift Detection Algorithm with High Accuracy and Low False Positives Rate.
Proceedings of the Workshop on Artificial Intelligence Safety 2023 (SafeAI 2023) co-located with the Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2023), 2023

2022
Partially Supervised Classification for Early Concept Drift Detection.
Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

2021
FuzzBench: an open fuzzer benchmarking platform and service.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Statistical Comparison of Algorithm Performance Through Instance Selection.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

The Dungeon Variations Problem Using Constraint Programming.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
FuzzFactory: domain-specific fuzzing with waypoints.
Proc. ACM Program. Lang., 2019

Community Structure in Industrial SAT Instances.
J. Artif. Intell. Res., 2019

2018
On the Glucose SAT Solver.
Int. J. Artif. Intell. Tools, 2018

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Zigzagging Strategies for Temporal Induction.
Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
On the Community Structure of Bounded Model Checking SAT Problems.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

On Selecting Constraints for Replication in Model Checking.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016
Extreme Cases in SAT Problems.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Using Community Structure to Detect Relevant Learnt Clauses.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

2014
Améliorer SAT dans le cadre incrémental.
Rev. d'Intelligence Artif., 2014

Impact of Community Structure on SAT Solver Performance.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Lazy Clause Exchange Policy for Parallel SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

SAT-Based Metabolics Pathways Analysis without Compilation.
Proceedings of the Computational Methods in Systems Biology, 2014

2013
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Just-In-Time Compilation of Knowledge Bases.
Proceedings of the IJCAI 2013, 2013

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

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

Optimizing with minimum satisfiability.
Artif. Intell., 2012

Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Eigenvector Centrality in Industrial SAT Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Refining Restarts Strategies for SAT and UNSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Minimum Satisfiability and Its Applications.
Proceedings of the IJCAI 2011, 2011

2010
A Restriction of Extended Resolution for Clause Learning SAT Solvers.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Predicting Learnt Clauses Quality in Modern SAT Solvers.
Proceedings of the IJCAI 2009, 2009

2008
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability.
Proceedings of the IJCAI 2007, 2007

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

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

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

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
Efficient Consequence Finding.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001


  Loading...