Publications

Home pages of researchers are strange: it's like a "live" CV opened worldwide. Don't misunterpret this point: It's just the usual way of introducing ourselves to colleagues and to make the research living (when we look for a paper, for a reviewer, for a program committee, for a project, we like to find everything we need on the web: so, we also make our "scientific life" publicly available). I really hope you'll find something interesting in this web site, and forget about this "formal" basis for colleagues.

My Top Papers

If you want to know my work, I would like to point out this "Top 10" selection:

Citations Banks

Microsoft Academic Research is full of mistakes (too many Laurent Simon for it!). It's too time consuming to fix more than a couple algorithms outputs and this last one is probably the one with the more mistakes (one lucky homonym has many, many papers . Hopefully, at some point A.I. will make progress here.

Bibliography

On Selecting Constraints for Replication in Model Checking Guillaume Baud-Berthier and Laurent Simon, in International Conference on Tools for Artificial Intelligence (ICTAI), 2017.

On the Community Structure of Bounded Model Checking SAT Problems Guillaume Baud-Berthier, Jesùs Giráldez-Cru and Laurent Simon, in International Conference on Theory and Applications of Satisfiability Testing (SAT), 2017.

Distributed tree decomposition with privacy. Vincent Armant, Philippe Dague and Laurent Simon, in Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP-12), 2012.

Eigenvector centrality in industrial SAT instances. George Katsirelos and Laurent Simon, in Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP-12), 2012.

Refining restarts strategies for SAT and UNSAT formulae. Gilles Audemard and Laurent Simon, in Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP-12), 2012.

Learning Polynomials over GF(2) in a SAT Solver. George Katsirelos and Laurent Simon. In Proceedings of SAT 2012, LNCS 7317, 496--497, 2012.

GUNSAT: A Greedy Local Seach Algorithm for Unsatisfiability
G. Audemard, L. Simon.
in IJCAI'07, as a short/poster paper. You may find our A0 poster here .
[ pdf ]
You can also download the gunsat-V1 jar file used in the experiments.

Some Results and Lessons from the SAT Competitions. L. Simon.
Invited Talk in the Second International Workshop on Constraint Propagation and Implementation, held in conjunction with Eleventh International Conference on Principles and Practice of Constraint Programming (CP'2005), Sitges, Spain, 2005. Slides Only.
[
zip ]

Are pigeon hole and urquhart problems really exponential for DP?
Philippe Chatalic and Laurent Simon.
In Third Workshop on the Satisfiability Problem (SAT2000), May
2000.
Slides of the presentation only.
[ .ps.gz ]