Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Simon 0001
Person information
- affiliation: CNRS Bordeaux INP, Talence, France
Other persons with the same name
- Laurent Simon — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j9]Carlos Ansótegui
, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon:
Community Structure in Industrial SAT Instances. J. Artif. Intell. Res. 66: 443-472 (2019)- [j8]Rohan Padhye, Caroline Lemieux, Koushik Sen, Laurent Simon, Hayawardh Vijayakumar:
FuzzFactory: domain-specific fuzzing with waypoints. Proc. ACM Program. Lang. 3(OOPSLA): 174:1-174:29 (2019) - 2018
- [j7]Gilles Audemard, Laurent Simon:
On the Glucose SAT Solver. Int. J. Artif. Intell. Tools 27(1): 1840001:1-1840001:25 (2018) - 2014
- [j6]Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon:
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28(5): 593-614 (2014) - 2012
- [j5]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012) - [j4]Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon:
The International SAT Solver Competitions. AI Mag. 33(1): 89-92 (2012) - 2006
- [j3]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) - 2005
- [j2]Laurent Simon, Daniel Le Berre, Edward A. Hirsch:
The SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 307-342 (2005) - [j1]Paul W. Purdom, Daniel Le Berre, Laurent Simon:
A parsimony tree for the SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 343-365 (2005)
Conference and Workshop Papers
- 2023
- [c32]Maxime Fuccellaro, Laurent Simon, Akka Zemmari:
A Robust Drift Detection Algorithm with High Accuracy and Low False Positives Rate. SafeAI@AAAI 2023 - 2022
- [c31]Maxime Fuccellaro, Laurent Simon, Akka Zemmari:
Partially Supervised Classification for Early Concept Drift Detection. ICTAI 2022: 190-196 - 2021
- [c30]Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon:
The Dungeon Variations Problem Using Constraint Programming. CP 2021: 27:1-27:16 - [c29]Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger H. Hoos:
Statistical Comparison of Algorithm Performance Through Instance Selection. CP 2021: 43:1-43:21 - [c28]Jonathan Metzman, László Szekeres, Laurent Simon, Read Sprabery, Abhishek Arya:
FuzzBench: an open fuzzer benchmarking platform and service. ESEC/SIGSOFT FSE 2021: 1393-1403 - 2020
- [c27]Gilles Audemard, Loïc Paulevé, Laurent Simon:
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. SAT 2020: 107-113 - 2018
- [c26]Rohan Fossé, Laurent Simon:
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers. CP 2018: 128-143 - [c25]Guillaume Baud-Berthier, Laurent Simon:
Zigzagging Strategies for Temporal Induction. ICTAI 2018: 744-748 - [c24]Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon:
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI 2018: 1300-1308 - 2017
- [c23]Guillaume Baud-Berthier, Laurent Simon:
On Selecting Constraints for Replication in Model Checking. ICTAI 2017: 876-883 - [c22]Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon:
On the Community Structure of Bounded Model Checking SAT Problems. SAT 2017: 65-82 - 2016
- [c21]Gilles Audemard, Laurent Simon:
Extreme Cases in SAT Problems. SAT 2016: 87-103 - 2015
- [c20]Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon:
Using Community Structure to Detect Relevant Learnt Clauses. SAT 2015: 238-254 - 2014
- [c19]Sabine Pérès, Martin Morterol, Laurent Simon:
SAT-Based Metabolics Pathways Analysis without Compilation. CMSB 2014: 20-31 - [c18]Gilles Audemard, Laurent Simon:
Lazy Clause Exchange Policy for Parallel SAT Solvers. SAT 2014: 197-205 - [c17]Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon:
Impact of Community Structure on SAT Solver Performance. SAT 2014: 252-268 - 2013
- [c16]George Katsirelos, Ashish Sabharwal, Horst Samulowitz, Laurent Simon:
Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers. AAAI 2013: 481-488 - [c15]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Just-In-Time Compilation of Knowledge Bases. IJCAI 2013: 447-453 - [c14]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT 2013: 309-317 - 2012
- [c13]Gilles Audemard, Laurent Simon:
Refining Restarts Strategies for SAT and UNSAT. CP 2012: 118-126 - [c12]George Katsirelos, Laurent Simon:
Eigenvector Centrality in Industrial SAT Instances. CP 2012: 348-356 - [c11]George Katsirelos, Laurent Simon:
Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation). SAT 2012: 496-497 - 2011
- [c10]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610 - 2010
- [c9]Gilles Audemard, George Katsirelos, Laurent Simon:
A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI 2010: 15-20 - 2009
- [c8]Gilles Audemard, Laurent Simon:
Predicting Learnt Clauses Quality in Modern SAT Solvers. IJCAI 2009: 399-404 - 2008
- [c7]Gilles Audemard, Laurent Simon:
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. CP 2008: 630-634 - 2007
- [c6]Gilles Audemard, Laurent Simon:
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. IJCAI 2007: 2256-2261 - 2004
- [c5]Daniel Le Berre, Laurent Simon:
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. SAT (Selected Papers 2004: 321-344 - [c4]Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella:
The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers 2004: 376-392 - 2003
- [c3]Daniel Le Berre, Laurent Simon:
The Essentials of the SAT 2003 Competition. SAT 2003: 452-467 - [c2]Daniel Le Berre, Laurent Simon, Armando Tacchella:
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. SAT 2003: 468-485 - 2001
- [c1]Laurent Simon, Alvaro del Val:
Efficient Consequence Finding. IJCAI 2001: 359-370
Editorship
- 2016
- [e1]Boris Konev, Stephan Schulz, Laurent Simon:
IWIL@LPAR 2015, 11th International Workshop on the Implementation of Logics, Suva, Fiji, November 23, 2015. EPiC Series in Computing 40, EasyChair 2016 [contents]
Informal and Other Publications
- 2024
- [i2]Maxime Fuccellaro, Laurent Simon, Akka Zemmari:
Drift Detection: Introducing Gaussian Split Detector. CoRR abs/2405.08637 (2024) - 2020
- [i1]Gilles Audemard, Loïc Paulevé, Laurent Simon:
SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. CoRR abs/2006.01503 (2020)
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-08-07 22:25 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:
