Professor in Computer Science CRIL University of Artois

Transcription

1 Lakhdar SAÏS Professor in Computer Science CRIL, CNRS-UMR 8188 rue Jean Souvraz, SP18 F Lens Cedex T +33 (0) B sais@cril.fr sais Present Position Professor in Computer Science CRIL University of Artois PEDR Research interests Propositionnal Satisfiability, Constraint Satisfaction Problems, Quantified Boolean formulae, Knowledge Representation, Logic and Artificial Intelligence. Professional activities Professor, UFR des Sciences, University of Artois, Lens Professor, University of Paul Sabatier, IRIT, Toulouse III Lecturer, IUT - Lens, University of Artois Researcher - ATER, University of Provence, Marseille. Education 2000 French Research Habilitation (HdR) in Computer Science, University of Artois, France, «De la résolution du problème SAT à la résoution de problèmes autour de SAT» PhD in Computer Science, University of Provence, Aix-Marseille I, France, «Étude des symétries et de la cardinalité en calcul propositionnel : Application aux algorithmes sémantiques», Supervisor : Pierre Siegel. Mention : "Très Honorable et Félicitations du jury" 1990 Master Degree (DEA) in Computer Science and Mathematics (Artificial Intelligence), University of Aix-Marseille II (Luminy, France), Mention : Bien Engineer in Computer Science, National Institute in Computer Science, University of Tizi-Ouzou, Algeria, Mention : Très-Bien. Research responsibilities Head of the CRIL research group on "Inference and Decision Process" ( ) Co-leader of Animation Structure SA 1.2 (GdR I3) "Algorithms for Inference and Constraint Satisfaction problems" ( ). Member of the Consulting Committee - CRIL research lab ( ) Member of the Scientific Consulting Committee - University of Artois ( ) Member of the Consulting Committee - Faculty of Sciences - University of Artois ( ) Member of the "comité de direction" GdR-I3 ( ), and of the Animation Committee Theme 1 : Fondamental Aritificial Intelligence - GdR-I3 (since january 2007). Member of the Management Committee - French Association on Constraint Programming ( ) Member of the CSE (sections ) - University of Artois ( ) Member of the CSE (section 30) - University of Artois ( ) Member of the CSE (sections ) - University of Artois ( ) External Member of the CSE (section 27), University of Lille III and University of Valenciennes. Other Current Research responsibilities

2 Postgraduate supervisor of 9 PhD theses and two internship at MSR Cambridge Program chair of the international CP 08 workshop on Symmetry in Constraint Satisfaction (Symcon 08, Sydney Australia), of the international Colloquium on Optimisation and Information systems (COSI 07- Algiers and COSI 08 - Oran Algeria), of the First Summer School on Decision Aiding (sponsored by Microsoft Research Cambridge june 2007, Oran, Algeria), of the International ECAI 96 workhop on «Advances in Propositional Deduction» (Budapest Hungary) and of the national conference "Journées Nationales sur la résolution pratique de problèmes NP-Complets (JNPC 98, Nantes France). Program Committee Member of the international conference : Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 08), of the Twentieth International Conference on Tools with Artificial Intelligence (ICTAI 08), of the International Symmetry Conference (ISC 07,Edinburgh, Scotland), of the IEEE International Conference on Information Reuse and Integration (IEEE-IRI 05-08), of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 05,St Andrews Scotland), of the international Colloquium on Optimisation and Information systems (COSI 05-08), of the CP 06 international workshop «Integration of SAT and CP Techniques» and of the national conferences : JNPC 99, JNPC 97 et RJCIA 94. President of the steering committee of the Summer School on Decision Aiding (Oran) june 2008, of the national conference on Constraint Programming (JFPC 05) Reviewer of the international journals «Journal on Operation Research», «Studia Logic», of the international conference on Theory and Applications of Satisfiability Testing (SAT 05, SAT 04), of the International Conference on Tools with Artificial Intelligence (ICTAI 08, IC- TAI 04), of the International Joint Conference on Artificial Intelligence (IJCAI 07, IJCAI 05, IJCAI 03, IJCAI 99 and IJCAI 97), of the International Conference on Constraint Programming (CP 07, CP 97), of the European Conference on Artificial Intelligence (ECAI 04, ECAI 98), of the International Symposium on Theoretical Computer Science (STACS 00, STACS 99), of the national journals «Techniques et Sciences Informatique» and «Revue d Intelligence Artificielle» and of the national conferences «Reconaissance des Formes et Intelligence Artificielle» ( RFIA 04 and RFIA 96). Expert at the National Research Agency (ANR) «Evaluation of White and Young Research Program» and at the Ministry of Foreign Affairs «Evaluation of the French and South American Projects External Evaluator for the PhD defence of Subbarayan Sathiamoorthy (IT University of Copenhagen), Laurent Verroust (University of Aix-Marselle III), Bing Quan Huang (University college of Dublin, Ireland), Mohamed Réda Saïdi (University of Provence, Marseille), Faycal Djerourou (Univ. Paris 13), Hadja Faiza Khellaf-Haned (USTHB, Alger), Ma Jixuan (Univ. Valenciennes), É. Canaud (Univ. Claude Bernard Lyon I), F. Lardeux (Univ. Angers), M. Butaru (Univ. Metz), L. Keddar (Univ. Aix-Marseille III), and for the "Habilitation" of Bachir Saadi (Univ. Tizi-Ouzou). Jury Member for the "Habilitation HdR" of O. Bailleux (Univ. Bourgogne), L. Henocque (Univ. Provence) and of the PhD defence of Cédric Piette (Univ. Artois), Sébastien Tabary (Univ. Artois), Julien Vion (Univ. Artois), F. Letombe (Univ. Artois), N. Porquet (Univ. Artois), O. Couturier (Univ. Artois), R. Ostrowski (Univ. Artois), D. Ansart (Univ. Artois), G. El Baida (Univ. Artois), B. Jurkowiak (Univ. de Picardie), L. Keddar (Univ. Provence), G. Audemard (Univ. Provence), L. Brisoux(Univ. Artois), B. Mazure (Univ. Artois), Anbulagan (UTC), D. Martinez (ENS Aéronautique de Toulouse). Principal Investigator of the Inter-labs project LGI2A-CRIL, Université d Artois, Math- STIC CNRS project "Heterogeneous Optimization Methods for industrial problem Solving" and of the Cocoa project CPER Nord-Pas-de-Calais.

3 Research projects : PAI Ulysses (France-Ireland), PAI PESSOA (French-Portugal), AS STIC "Algorithmic and experimental evaluation for Quantified Boolean Formulas", French- Portugal PAI on "Design of software platform for SAT" and "Solving Pseudo Boolean Formulas", TACT (now TAC CPER Nord/Pas-de-Calais), of the Cocoa project CPER Nord-Pas-de-Calais, of the PRC-IA projects " Boolean: Algorithms and Heuristics for AI", "Polynomial classes", and "Algorithmic Aspect for Solving Problem expressed with constraints" (RESSA), and of the Ganymède I et II of the "Contrat de plan état/région Nord/Pas-de-Calais". Organizer of the Doctoral Fellowship Program JNPC/JFPC ( ). Scientific Awards 2008 Gold Medal (First Rank), Parallel Track at the SAT Race "ManySAT" Solver by Youssef Hamadi, Said Jabbour and Lakhdar Sais (CRIL-MSR Cambridge) 2006 First rank on binary CSP category, at the International Constraint Satisfaction Solver Competition "ValCSP" by Assef Chmeiss, Vincent Krawczyk and Lakhdar Sais 2003 First rank (Qualification phase) and second rank (final phase) on handmade category, SAT 2003 International SAT competition - "LSATv2.0" by Richard Ostrowski, Bertrand Mazure and Lakhdar Sais 1998 Best paper award at the 8th international conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 98 Publications Summary 1 French Book on SAT, Hermes Publishing Ltd, London. 3 Book chapters Editor of 4 conference proceedings 8 International Journal papers 60 referred papers (20 since 2004) at international conference (e.g. IJCAI, ECAI, AAAI, CP, SAT, ICTAI) 24 referred papers (19 since 2004) at the national conferences (e.g. RFIA, JFPC, JNPC) Publications ( ) Articles in international referred journals G. Audemard, S. Jabbour, and L. Sais. Graph-Based SAT Representation : A New Perspective. In Journal of Algorithms in Logic, Informatics and Cognition, 2008 (to appear) C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Recording and Minimizing Nogoods from Restarts. Journal on Satisfiability, Boolean Modeling and Computation, pages , C. Lecoutre, L. Sais, and J. Vion. Using SAT Encodings to Derive CSP Value Ordering Heuristics. Journal on Satisfiability, Boolean Modeling and Computation, pages , Editions of Books and Proceedings L. Saïs. Problème SAT : Progrès et Défis. Hermes Publishing Ltd, London, may, M. Aider, L. Nourine and L. Saïs, éditeurs. Actes du 5ème Colloque International sur l optimisation et les systèmes d information (COSI 2008). Tizi-Ouzou, Algeria, 8-10 june L. Nourine and L. Saïs, éditeurs. Actes du 4ème Colloque International sur l optimisation et les systèmes d information (COSI 2007). Oran, Algeria, june Book Chapter O. Dubois et L. Sais. Bilan et Défis. Book chapter, Hermes Publishing Ltd, London, pages , mai Publications in international conferences with selection committee G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Sais. A generalized framework for conflict analysis. In Proceedings of SAT 08, pages 21 27, Guangzhou, China, 2008.

4 C. Piette, Y. Hamadi, and L. Sais. Vivifying propositional clausal formulae. In Proceedings of ECAI 08, to appear, Patras, Greece, A. Chmeiss, V. Krawczyk, and L. Sais. Redundancy in CSPs. In Proceedings of ECAI 08, poster to appear, Patras, Greece, G. Audemard and L. Sais. Circuit-based Encoding for CNF Formulas. In Proceedings of SAT 07, pages 16 21, Lisbon, Portugal, O. Fourdrinoy, E. Grégoire, B. Mazure, and L. Saïs. Eliminating Redundant Clauses in SAT Instances. In Proceedings of CPAIOR 07, pages 71 83, Bruxelles, Belgium, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Transposition Tables for Constraint Satisfaction. In Proceedings of AAAI 07, pages , Vancouver, Canada, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Nogood recording from restarts. In Proceedings of IJCAI 07, pages , Hyderabad, India, G. Audemard, S. Jabbour, and L. Sais. Symmetry Breaking in Quantified Boolean Formulae. In Proceedings of IJCAI 07, pages , Hyderabad, India, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Last Conflict-based Reasonning. In Proceedings of ECAI 06, pages , Trento, Italy, F. Hemery, C. Lecoutre, L. Sais, and F. Boussemart. Extracting MUCs from constraint networks. In Proceedings of ECAI 06, pages , Trento, Italy, L. Paris, R. Ostrowski, L. Sais, and P. Siegel. Computing Horn Strong Backdoor Sets Thanks to Local Search. In Proceedings of ICTAI 06, pages , Washington, USA, G. Audemard and L. Sais. A Symbolic Search Based Approach for Quantified Boolean Formulas. In Proceedings of SAT 05, pages 16 30, St. Andrews, Scotland, S. Darras, G. Dequen, L. Devendeville, B. Mazure, R. Ostrowski, and L. Saïs. Using Boolean Constraint Propagation for Sub-clause Deduction. Dans Proceedings of CP 05 (short paper), pages , Sitges, Espagne, O. Fourdrinoy, É. Grégoire, B. Mazure, and L. Saïs. Exploring Hybrid Algorithms for SAT. Dans Proceedings of LPAR 05 (short paper), pages 33 37, Montego Bay, Jamaïque, É Grégoire, R. Ostrowski, B. Mazure, and L. Saïs. Automatic Extraction of Functional Dependencies. In Proceedings of SAT 04 (Revised Selected Papers), pages , F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Boosting systematic search by weighting constraints. In Proceedings of ECAI 04, pages , Valancia, Spain, F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Support inference for generic filtering. In Proceedings of CP 04, pages , Toronto, Canada, G. Audemard, B. Mazure, and L. Sais. Dealing with Symmetries in Quantified Boolean Formulas. In proceedings of SAT 04, pages , Vancouver, Canada, G. Audemard and L. Sais. SAT Based BDD Solver for Quantified Boolean Formulas. In Proceedings of ICTAI 04, pages 82 89, Boca Raton, Florida, A. Chmeiss and L. Sais. Constraint Satisfaction Problems : Backtrack Search Revisitied. In Proceedings of ICTAI 04, pages , Floride, USA, Publications in international workshops with selection committee G. Audemard, S. Jabbour, and L. Sais Efficient Symmetry Breaking Predicates for Quantified Boolean Formulae". In Proceedings of the International Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon), pages 14 21, september 2007 G. Audemard, S. Jabbour, and L. Sais Using SAT-Graph representation to derive hard instances in Proceedings of the 14th RCRA International workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA07), july 2007 J.F. Condotta, D. Dalmeida, C. Lecoutre, and L. Sais. From Qualitative to Discrete Constraint Networks. In Proceedings of the International Workshop on Qualitative Constraint Calculi held with KI 2006, pages 54 64, Bremen, Germany, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Nogood Recording from Restarts. In Proceedings of SAT/CP workshop held with CP 06, pages , Nantes, France, C. Lecoutre, L. Sais, and J. Vion. Using SAT Encodings to Derive CSP Value Ordering Heuristics. In Proceedings of SAT/CP workshop held with CP 06, pages 33 47, Nantes, France, Publications in national conferences with selection committee

5 G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Sais. Un cadre général pour l analyse des conflits. In Actes de JFPC 08, pages , Nantes, France, A. Chmeiss, V. Krawczyk, and L. Sais. La redondance dans les CSPs. In Actes de JFPC 08, pages , Nantes, France, O. Fourdrinoy, E. Gregoire, B. Mazure, and L. Sais. Réduction d instances de SAT vers des instances polynomiales. In Actes de RFIA 08, pages , Amiens, France, O. Fourdrinoy, E. Grégoire, B. Mazure, and L. Saïs. Suppression des clauses redondantes dans des instances SAT. In Actes de JFPC 07, pages 29 38, Rocquencourt, France, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Tables de transposition pour la satisfaction de contraintes. In Actes de JFPC 07, pages , Rocquencourt, France, C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Recherche dirigée par le dernier conflit. In Proceedings of JFPC 06, pages , Nimes, France, G. Audemard, S. Jabbour, and L. Sais. Exploitation des symétries dans les formules booléennes quantifiées. In Actes de JFPC 06, pages 15 24, Nîmes, France, F. Hemery, C. Lecoutre, L. Sais, and F. Boussemart. Extraction de noyaux insatisfiables minimaux de reseaux de contraintes. In Proceedings of JFPC 06, pages , Nimes, France, L. Paris, R. Ostrowski, L. Saïs and P. Siegel Approximation d ensembles Horn strong backdoor par recherche locale. In Actes de JFPC 06, pages , Nîmes, France, A. Chmeiss and L. Sais. About Look-Ahead Algorithms in Constraint Satisfaction Problems. In Proceedings of ICTTA 06, Damascus, Syria, 2006 É Grégoire, B. Mazure, R. Ostrowski, and L. Saïs. Dépendances Fonctionnelles Booléennes : Détection et Exploitation. Dans Actes de COSI 05, pages , Beijaia, Algérie, G. Audemard and L. Sais. Une approche symbolique pour les formules booléennes quantifiées. In Actes de JFPC 05, pages 59 69, Lens, France, F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Inférence de supports pour les algorithmes de filtrage générique. In Actes de JFPC 05, pages 89 98, Lens, France, A. Chmeiss and L. Sais. De FC à MAC : un algorithme paramétrable pour la résolution de CSP. In Actes de JFPC 05, pages , Lens, France, S. Darras, G. Dequen, L. Devendeville, B. Mazure, R. Ostrowski, and L. Saïs. Utilisation de la Propagation de Contraintes pour la Production de Sous-Clauses. Dans Actes des JFPC 05, pages 69 78, Lens, France, G. Audemard, B. Mazure, and L. Sais. Symétries et formules booléennes quantifiées. In Actes de JNPC 04, pages 43 53, F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Heuristiques de choix de variables dirigees par les conflits. In Actes de JNPC 04, pages , Angers, France, É Grégoire, R. Ostrowski, B. Mazure, and L. Saïs. Déduction automatique de dépendances fonctionnelles. Dans Actes des JNPC 04, pages , Angers, France, R. Ostrowski, B. Mazure, L. Saïs, and É. Grégoire. Élimination des redondances dans les algorithmes de résolution de SAT. Dans Actes de RFIA 04, pages , Toulouse, France, 2004.

6