Voici ma liste de publications, classées par année. Je suis en train de collecter les papiers (sous PDF) pour les distribuer par ce site (mais cela me prend un peu de temps). (A propos de DBLP: j’ai envoyé quelques e-mails à DBLP concernant les problèmes d’homonymes. Il y a au moins un autre Laurent Simon qui apparait dans ma liste de publications…)
- Logic programming-based Minimal Cut Sets reveal consortium-level therapeutic targets for chronic wound infections. Maxime Mahout, Ross P. Carlson, Laurent Simon, Sabine Pérès, dans Nature Portfolio Journal (NPJ), Systems Biology and Applications. (2024) [journal] (pdf) [link]
- Drift Detection: Introducing Gaussian Split Detector. Maxime Fuccellaro, Laurent Simon, Akka Zemmari, dans International Conference on Image Processing Theory, Tools and Applications. (2024) [conference] (pdf)
- A Robust Drift Detection Algorithm with High Accuracy and Low False Positives Rate. Maxime Fuccellaro, Laurent Simon, Akka Zemmari, dans AAAI's Workshop on Artificial Intelligence Safety. (2023) [workshop] (pdf)
- Partially Supervised Classification for Early Concept Drift Detection. Maxime Fuccellaro, Laurent Simon, Akka Zemmari, dans International Conference on Tools with Artificial Intelligence (ICTAI). (2022) [conference] (pdf)
- The Dungeon Variations Problem Using Constraint Programming. Gaël Glorian, A. Debesson, S. Yvon-Paliot, Laurent Simon, dans 27th International Conference on Principles and Practice of Constraint (CP). (2021) [conference] (pdf)
- Statistical comparison of algorithm performance through instance selection. Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger Hoos, dans 27th International conference on principles and practice of constraint (CP). (2021) [conference] (pdf)
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. Gilles Audemard, Loïc Paulevé, Laurent Simon, dans Proceedings of the Twenty-Third Conference on Theory and Applications of Satisfiability Testing (SAT). (2020) [conference] (pdf) [arxiv]
- Reasoning with Propositional Logic: from SAT Solvers to Knowledge Compilation. Laurent Simon, dans A guided tour of Artificial Intelligence Research. Edited by Pierre Marquis, Odile Papini, Henri Prade (2020) [book chapter]
- Community Structure in Industrial SAT Instances. Carlos Ansotegui, Maria Luisa Bonet, Jesus Giraldez-Cru, Jordi Levy, Laurent Simon, dans Journal of Artificial Intelligence Research. 66: 443-472 (2019) [journal] (pdf)
- Glucose and Syrup: Nine years in the SAT competitions. Gilles Audemard, Laurent Simon, dans Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions. (2018) [workshop] (pdf)
- SAT et SMT. Laurent Simon, dans book chapter written for the summer school EJCIM 2018. (2018) [book chapter] (in french)
- On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers. Rohan Fossé, Laurent Simon, dans Principles and Practice of Constraint Programming - 24th International Conference (CP). (2018) [conference] (pdf)
- Algorithmes de Recherche Systématique. Gilles Dequen, Laurent Simon, dans SAT : Progrès et défis. (2018) [book chapter] (in french)
- The Glucose SAT Solver. Gilles Audemard, Laurent Simon, dans International Journal on Artificial Intelligence Tools. Volume No.27, Issue No. 01 (2018) [journal]
- Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon, dans Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, (IJCAI). (2018) [conference]
- Zigzagging Strategies for Temporal Induction. Guillaume Baud-Berthier, Laurent Simon, dans International Conference on Tools for Artificial Intelligence (ICTAI). (2018) [conference] (pdf)
- On the Community Structure of Bounded Model Checking SAT Problems. Guillaume Baud-Berthier, Jesùs Giráldez-Cru, Laurent Simon, dans International Conference on Theory and Applications of Satisfiability Testing (SAT). (2017) [conference] (pdf)
- Modernisation de la duplication de clauses. Guillaume Baud-Berthier, Laurent Simon, dans Journées Francophones de Programmation par Contraintes (JFPC),. (2017) [conference] (in french) (pdf)
- Diagnosability Planning for Controllable Discrete Event Systems. Hassan Ibrahim, Philippe Dague, Alban Grastien, Lina Ye, Laurent Simon, dans AAAI Conference on Artificial Intelligence (AAAI). (2017) [conference]
- Glucose and Syrup in the SAT'16. Gilles Audemard, Laurent Simon, dans Proceedings of SAT Competition 2016: Solver and Benchmark Descriptions. (2016) [workshop] (pdf)
- Abérrations dans les Problèmes SAT. Gilles Audemard, Laurent Simon, dans Journées Francophones de Programmation par Contraintes (JFPC). (2016) [conference] (in french)
- Minimality of Metabolic Flux Modes under Boolean Regulation Constraints. Martin Morterol, Philippe Dague, Sabine Peres, Laurent Simon, dans Workshop on Constraint-Based Methods for Bioinformatics (WCB). (2016) [workshop]
- Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. Jan Elffers, Jakob Nordstrom, Laurent Simon, Karem A. Sakallah, dans Pragmatics of SAT Workshop. (2016) [workshop]
- SAT-Based Testing of Diagnosability and Predictability of Centralized and Distributed Discrete Event Systems. Hassan Ibrahim, Philippe Dague, Laurent Simon, dans Eighth International Conference on Advances in System Testing and Validation Lifecycle (VALID). (2016) [conference]
- Extreme Cases in SAT Problems. Gilles Audemard, Laurent Simon, dans International Conference on Theory and Applications of Satisfiability Testing (SAT). (2016) [conference]
- Using community structure to detect relevant learnt clauses. Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon, dans International Conference on Theory and Applications of Satisfiability Testing (SAT). (2015) [conference]
- Using Incremental SAT for Testing Diagnosability of Distributed DES. Hassan Ibrahim, Philippe Dague, Laurent Simon, dans DX@Safeprocess. (2015) [workshop]
- SAT-Based Metabolics Pathways Analysis Without Compilation. Sabine Peres, Martin Morterol, Philippe Dague, Laurent Simon, dans 12th Conference on Computational Methods in Systems Biology (CMSB). (2014) [conference]
- Impact of Community Structure on SAT Solver Performance. Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon, dans 17th International Conference on Theory and Applications of Satisfiability Testing (SAT). (2014) [conference]
- Lazy Clause Exchange Policy for parallel SAT solvers. Gilles Audemard, Laurent Simon, dans 17th International Conference on Theory and Applications of Satisfiability Testing (SAT). (2014) [conference]
- Améliorer SAT dans le cadre incrémental. Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon, dans Revue d'Intelligence Artificielle (RIA). (2014) [journal] (in french)
- Post Mortem Analysis of SAT Solver Proofs. Laurent Simon, dans Fifth Pragmatics of SAT workshop (POS). (2014) [workshop]
- Just-In-Time Compilation of Knowledge Bases. Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, dans 23rd International Joint Conference on Artificial Intelligence (IJCAI). (2013) [conference]
- Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers. George Katsirelos, Ashish Sabharwal, Horst Samulowitz, Laurent Simon, dans Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI). (2013) [conference]
- Improving Glucose for Incremental SAT Solving with Assumption: Application to MUS Extraction. Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, dans Proceedings of SAT. (2013) [conference]
- Learning Polynomials over GF(2) in a SAT Solver. George Katsirelos, Laurent Simon, dans Proceedings of SAT 2012, LNCS 7317, 496--497. (2012) [conference]
- Refining restarts strategies for SAT and UNSAT formulae. Gilles Audemard, Laurent Simon, dans Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP). (2012) [conference]
- Eigenvector centrality in industrial SAT instances. George Katsirelos, Laurent Simon, dans Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP). (2012) [conference]
- Distributed tree decomposition with privacy. Vincent Armant, Philippe Dague, Laurent Simon, dans Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP). (2012) [conference]
- Distributed Tree Decomposition by Local Elections with One Token. Vincent Armant, Laurent Simon, dans Sixièmes Journées d'Intelligence Artificielle Fondamentale (JIAF). (2012) [conference] (in french)
- Optimizing with Minimum Satisfiability. Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon, dans Artificial Intelligence. (2012) [journal]
- The International SAT Solver Competition. Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon, dans Artificial Intelligence Magazine. (2012)
- GLUCOSE 2.1: Aggressive – but Reactive – Clause Database Management, Dynamic Restarts. Gilles Audemard and Laurent Simon, dans Pragmatics of SAT (Workshop of SAT'12). (2012) [workshop]
- Satisfiabilité Minimale et Applications. Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon, dans Septièmes Journées Francophones de Programmation par Contraintes (JFPC). (2011) [conference] (in french)
- Minimum Satisfiability and its Applications. Chu-Min Li, Zhu Zhu, Felip Manya, Laurent Simon, dans Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). pages 605--611 (2011) [conference]
- A Restriction of Extended Resolution for Clause Learning SAT Solvers. Gilles Audemard, George Katsirelos, Laurent Simon, dans Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI). pages 15--20 (2010) [conference]
- Une restriction de la résolution étendue pour les démonstrateurs SAT modernes. Gilles Audemard, Georges Katsirelos, Laurent Simon, dans Sixièmes Journées Francophones de Programmation par Contraintes (JFPC). pages 45--50 (2010) [conference] (in french)
- Predicting Learnt Clauses Quality in Modern SAT Solver. Gilles Audemard, Laurent Simon, dans Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI). pages 399--404 (2009) [conference]
- Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus~?. Gilles Audemard, Mouny S. Modeliar, Laurent Simon, dans Cinquièmes Journées Francophones de Programmation par Contraintes (JFPC). pages 245-253 (2009) [conference] (in french)
- Distributed Consistency-Based Diagnosis without Conflicts. Vincent Armant, Philippe Dague, Laurent Simon, dans 19th International Workshop on Principles of Diagnosis (DX). (2008) [workshop] (pdf)
- Diagnostique distribué à base de modèles sans calcul préalable des conflits. Vincent Armant, Philippe Dague, Laurent Simon, dans Quatrièmes Journées Francophones de Programmation par Contraintes (JFPC 2008)}, pages 41--48, 2008.. (2008) [conference] (in french) (pdf)
- Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. Gilles Audemard, Laurent Simon, dans International Conference on Principles and Practice of Constraint Programming (CP). pages 630--634} (2008) [conference] (pdf)
- Distributed Consistency-Based Diagnosis. Vincent Armant, Philippe Dague, Laurent Simon, dans International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR). pages 113-127 (2008) [conference] (pdf)
- GUNSAT: A Greedy Local Seach Algorithm for Unsatisfiability. Gilles Audemard, Laurent Simon, dans International Joint Conference on Artificial Intelligence (IJCAI). pages 2256--2261 (2007) [conference]
- Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web. Philippe Adjiman, Philippe Chatalic, François Goasdoué, Marie-Christine Rousset, Laurent Simon, dans Journal of Artificial Intelligence Research (JAIR). volume 25, pages 269--314 (2006) [journal]
- Scalability study of peer-to-peer consequence finding. Philippe Adjiman, Philippe Chatalic, François Goasdoué, Marie-Christine Rousset, Laurent Simon, dans International Joint Conference on Artificial Intelligence (IJCAI). pages 351--356 (2005) [conference] (pdf)
- The SAT 2002 Competition. Laurent Simon, Daniel Le Berre, Edward Hirsch, dans Annals of Mathematics and Artificial Intelligence (AMAI). volume 43, pages 343--378 (2005) [journal] (ps.gz)
- A Parsimony Tree for the SAT 2002 contest. Daniel Le Berre, Paul W. Purdom, Laurent Simon, dans Annals of Mathematics and Artificial Intelligence (AMAI). volume 43, issue 1-4, pages 343--365 (2005) [journal]
- Raisonnement distribué dans un environnement de type pair-à-pair. Philippe Adjiman, Philippe Chatalic, François Goasdoué, Marie-Christine Rousset, Laurent Simon, dans Actes des Dixièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC). pages 259-270, Angers (2004) [conference] (in french)
- The second QBF solvers comparative evaluation. Laurent Simon, Daniel Le Berre, Massimo Narizzano, Armando Tacchella, dans Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT). 376--392, Lecture Notes in Computer Science 3542 (2004) [conference]
- Fifty-five solvers in Vancouver: The SAT 2004 competition. Daniel Le Berre, Laurent Simon, dans Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT). pages 321--344, Lecture Notes in Computer Science 3542 (2004) [conference]
- Distributed reasoning in a peer-to-peer setting. Philippe Adjiman, Philippe Chatalic, François Goasdoué, Marie-Christine Rousset, Laurent Simon, dans European Conference on Artificial Intelligence (ECAI). pages 945--946 (2004) [conference]
- The Essentials of the SAT'03 competition. Daniel Le Berre, Laurent Simon, dans Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT). Lecture Notes in Computer Science 2919, pages 452--467 (2003) [conference]
- Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT), dans volume Lecture Notes in Computer Science 2919, pages 468--485. (2003) [conference]
- SatEx: Towards an Exhaustive and Up-to-Date SAT Experimentation. Laurent Simon, dans Electronic Proceedings of the IJCAI'01 Workshop on Experimentations in A.I.. Seattle (2001) [workshop]
- SatEx: A Web-based Framework for SAT Experimentation. Philippe Chatalic, Laurent Simon, dans LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT). (2001) [workshop]
- SatEx~: un cadre de travail dynamique pour l'expérimentation SAT. Philippe Chatalic, Laurent Simon, dans Actes des Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC). Toulouse (2001) [conference] (in french)
- Efficient Consequence Finding. Laurent Simon, Alvaro Del Val, dans Proceedings of the 17th nternational Joint Conference on Artificial Intelligence, (IJCAI). p. 359--365, Seattle (2001) [conference] (pdf)
- Multiresolution for SAT checking. Philippe Chatalic , Laurent Simon, dans Journal of Artificial Intelligence Tools (JAIT). 10(4), pages 451--481 (2001) [journal] (ps.gz)
- Multi-Resolution on Compressed Sets of Clauses. Philippe Chatalic, Laurent Simon, dans Proceedings of the 12th International Conference on Tools with Artificial Intelligence (ICTAI). p. 2--10, Vancouver (2000) [conference] (ps.gz)
- ZRes: the old DP meets ZBDDs. Philippe Chatalic, Laurent Simon, dans Proceedings of the 17th Conference of Automated Deduction (CADE). p. 449--454, Pittsburgh (2000) [conference]
- Résolution sur des ensembles de clauses compressés~: comment doper DP. Philippe Chatalic, Laurent Simon, dans Actes des Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC). p 107--118, Marseille (2000) [conference] (in french)
- Davis et Putnam 40 ans après~: une première expérimentation. Philippe Chatalic, Laurent Simon, dans Actes des Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC). p. 9--16, Lyon (1999) [conference] (in french)