Last update: 2004, November

I am an assistant professor (Maître de Conférence), in the Artificial Intelligence and Inference System group (IASI) of the LRI laboratory in Paris-Sud, France. I've defensed my PhD in december, 2001. I'm also responsible for the SatEx web site, a site devoted to the experimentation of SAT solvers. Its main idea is to provide execution trace of all SAT provers on all available benchmarks. In my late news, I was involved in the SAT-2004 solver/benchmarks competition (that follows the SAT-2003 and the SAT-2002 competitions, of course). For more information, please visit the official competition web page, located at www.satlive.org/SATCompetition , the SAT-2003 web page or, the incredible web site that publish the results.

Link summary:

• The Journal on Satisfiability, Boolean Modeling and Computation. It's a peer reviewed Journal guaranteeing fast publication, and in which I'm involved.
• Here is the way to the SAT'05 Contest Results !!
• Here is the way to the SAT'04 Contest Results
• Here is the way to the SAT'03 Contest Results
• Here is the way to (the too old, now) Sat-Ex, which I maintain and which wants to be "the experimentation web site around the satisfiability problem".. But I'll close it some days to the brand new satex 3.0...
• Here is a complete list, with abstracts, of my papers.

2005
[ACG+05]	Scalability study of peer-to-peer consequence finding. P. Adjiman, P. Chatalic, F. Goasdoué, M.-C. Rousset, and L. Simon. In International Joint Conference on Artificial Intelligence (IJCAI), 2005. [ bib | .pdf ]
2004
[BS04]	Fifty-five solvers in vancouver: The sat 2004 competition. D. Le Berre and L. Simon. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), volume Lecture Notes in Computer Science. 2004. Accepted for publication. [ bib | .ps.gz ]
[DLBT04]	The second qbf solvers comparative evaluation. L. Simon D. Le Berre, M. Narizzano and A. Tacchella. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), volume Lecture Notes in Computer Science. 2004. Accepted for publication. [ bib | .pdf ]
[ACG+04a]	Distributed reasoning in a peer-to-peer setting. Philippe Adjiman, Philippe Chatalic, Francois Goasdoue, Marie-Christine Rousset, and Laurent Simon. In European Conference on Artificial Intelligence (ECAI'04),, 2004. [ bib ]
[ACG+04c]	Somewhere in the semantic web. Philippe Adjiman, Philippe Chatalic, Francois Goasdoue, Marie-Christine Rousset, and Laurent Simon. Technical report, LRI, 2004. [ bib | .pdf ]
[ACG+04b]	Raisonnement distribué dans un environnement de type pair-à-pair. Philippe Adjiman, Philippe Chatalic, Francois Goasdoue, Marie-Christine Rousset, and Laurent Simon. In Actes des Dixièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'04), pages 259-270, Angers, 21-22-23 Juin 2004. [ bib | .ps.gz | .pdf ]
2003
[BS03]	The Essentials of the Sat'03 competition. D. Le Berre and L. Simon. In A. Tacchella E. Giunchiglia, editor, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), volume Lecture Notes in Computer Science 2919, pages 452-467. June 2003. [ bib | .ps.gz ]
[BST03]	Challenges in the qbf arena: the sat'03 evaluation of qbf solvers. D. Le Berre, L. Simon, and A. Tachella. In A. Tacchella E. Giunchiglia, editor, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), volume Lecture Notes in Computer Science 2919, pages 468-485. June 2003. [ bib ]
2002
[SBH05]	The SAT 2002 competition. L. Simon, D. Le Berre, and E. Hirsch. Accepted for publication in Annals of Mathematics and Artificial Intelligence (AMAI), 43:343-378, 2005. [ bib | .ps.gz ]
[PPS05]	A phylogenetic tree for the sat 2002 contest. D. Le Berre P. Purdom and L. Simon. Accepted for publication in Annals of Mathematics and Artificial Intelligence (AMAI), 43, 2005. [ bib ]
2001
[CS01a]	Multiresolution for sat checking. P. Chatalic and L. Simon. Journal of Artificial Intelligence Tools, 10(4), December 2001. [ bib | .ps.gz ]
[SC01]	SATEx: a Web-based Framework for SAT Experimentation. Laurent Simon and Philippe Chatalic. In Henry Kautz and Bart Selman, editors, Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT2001), Boston University, Massachusetts, USA, June 14th-15th 2001. Online Publication. [ bib | http | .ps.gz | .pdf ]
[SdV01]	Efficient consequence finding. Laurent Simon and Alvaro del Val. In 17th International Joint Conference on Artificial Intelligence (IJCAI'01), pages 359-365, Seattle, Washington, USA, 2001. [ bib | .ps.gz | .pdf ]
[CS01b]	SatEx : un cadre de travail dynamique pour l'expérimentation SAT. Philippe Chatalic and Laurent Simon. In Actes des Septièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'01), pages 259-270, Toulouse, 27-28-29 Juin 2001. [ bib | .ps.gz | .pdf ]
[Sim01b]	SatEx: towards and exhaustive and up-to-date SAT experimentation. Laurent Simon. IJCAI'01 Workshop on Empirical Methods in Artificial Intelligence (Organized by H. Hoos and T. Stützle), August 4th 2001. [ bib | .ps.gz | .pdf ]
[Sim01a]	Multirésolution pour le test de consistance et la déduction en logique propositionnelle. L. Simon. PhD thesis, Université Orsay Paris XI, Décembre 2001. [ bib ]
2000
[CS00e]	Zres: The old Davis-Putnam procedure meets ZBDDs. Philippe Chatalic and Laurent Simon. In David McAllester, editor, 17th International Conference on Automated Deduction (CADE'17), number 1831 in Lecture Notes in Artificial Intelligence (LNAI), pages 449-454, June 2000. [ bib | .ps.gz ]
[CS00a]	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. [ bib | .ps.gz ]
[CS00b]	Davis and Putnam 40 years later: a first experimentation. Philippe Chatalic and Laurent Simon. Technical Report 1237, LRI, Université Paris-Sud, 91405 Orsay Cedex, France, 2000. [ bib | .ps.gz ]
[CS00c]	Multi-Resolution on compressed sets of clauses. Philippe Chatalic and Laurent Simon. In Twelth International Conference on Tools with Artificial Intelligence (ICTAI'00), pages 2-10, 2000. [ bib | .ps.gz ]
[CS00d]	Résolution sur des ensembles de clauses compressés : comment doper dp. Philippe Chatalic and Laurent Simon. In Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'00), pages 107-118, Marseilles, 2000. [ bib | .ps.gz ]
< 2000
[CS99]	Davis et putnam, 40 ans après : une première expérimentation. Philippe Chatalic and Laurent Simon. In Actes des Sixièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pages 9-16, Lyon, 1999. [ bib | .ps.gz ]
[Sim97]	Algorithmes de calcul de résolvant. Laurent Simon. Technical report, Université Orsay Paris XI, France, Septembre 1997. Stage de DEA (only in french). [ bib | .ps.gz ]

Some conferences involvement :

• JSAT Editorial Board Member. Jsat is The Journal on Satisfiability, Boolean Modeling and Computation. Please do follow the link!
• Member of the PC of SAT-03, SAT-04 and SAT-05 conferences on Satisfiability.
• Member of the PC of ESCAR-05, Workshop on Empirically Successful Classical Automated Reasoning.
• SAT-2002, 2003, 2004 and 2005 Competition Chair (with Daniel le Berre, and Edward Hirsch (for SAT-2002))
• Member of the PC of JNPC-03, JNPC-04 and JFPC-05 (French Conference)
• Reviewing for Discrete Applied Mathematics and AIM journals.

Here is a picture of our 2005 engineering high school diploma ceremony.

• 2003-2004 and 2004-2005: In charge of the last year of our university engineering school, computer science department IFIPS. I teached Languages and Data structures and Artificial Intelligence
• 2002-2003: Operating Systems, Computer architecture, Networks, Unix Systems, Languages and Data structures and Artificial Intelligence
• 2001-2002: Operating Systems, C projects , Imperative Programming Approach
• 2000-2001: Computer architecture, Operating Systems
• 1999-2000: Languages and Data structures, Imperative Programming Approach
• 1998-1999: Languages and Data structures, Functional Programming Approach
• before 1998: Office (Windows, Excel, Word...) Tools and Pascal Programming

2000-2004 Comments, suggestions