Report of education and scientific activities Hachémi BENNACEUR

1
Report of education and scientific
activities
Hachémi BENNACEUR
Full Professor
2
1. Personal Information, Qualifications and Diplomas, Professional Experience
Personal Information
Hachémi Bennaceur
06 13 1959 (Oran (Algeria))
married, 3 children
French nationality
Office Phone number (+966) 1 25 82 140
Mobile phone number (+966) 5 039 19 705
Since October 2009 to present
Full Professor, Computer Science Department.
College of Computer and Information Sciences
AL Imam Muhammad Ibn Saud University
P.O. Box 5701, Riyadh 11432
SAUDI ARABIA
Email : [email protected]
Before October 2009
Full Professor, at University Lille-Nord (France)
Department of Computer Science
I.U.T de Lens, Université Lille-Nord
Rue de l’Université, SP 16
62307 Lens Cedex.
Tel : 00 33 3 21 79 23 76
Email : [email protected]
Researcher at the Computer Science Laboratory of Lens (CRIL)
University Lille-Nord
Associated with CNRS UMR 8188.
Rue de l’Université, SP 16
62307 Lens Cedex.
.
3
Qualifications
Academic Qualifications
• High doctorate (H.D.R). “Accreditation to supervise scientific researches (TENURE)”
(in french ‘Habilitation à Diriger des Recherches’), Computer Science, Paris-Nord
University, (France), 1989-1997.
• Ph.D., Computer Science, Paris-Nord University, (France), 1986-1989.
• Master (DEA : Post-Graduate Diploma, 1 year), Computer Science, Paris VI University
(France), 1985.
• Bachelor-Engineer (5 years), Computer Science, University of Algiers (Algeria), 19791984.
Professional Experience
• Since, October 2009, Full Professor at the College of Computer and Information
Sciences, AL Imam Muhammad Ibn Saud University.
•
June 2007-October 2009, Full Professor at Lille-Nord University(France).
•
June 2007-October 2009, Researcher at the Laboratory of Computer Science of the
University Lille-Nord (CRIL, France).
•
September 1992- June 2007, Associate Professor, first class, Computer Science, at the
University of Cergy-Pontoise (Paris).
•
September 1992- June 2007, researcher at the Laboratory of Computer Science of the
university Paris 13 (LIPN, Paris).
•
•
1991-1992, Assistant Professor, Computer Science at the university Paris 13.
1989-1990, Consultant at INRIA (National Research Institute in Computer Science and
Automatism) for the project CAPRAN (in French ‘Calcul Parallèle Numérique'), Paris.
Languages
• French and Arabic: native fluency
•
English : writing and speaking professional level
4
2. Teaching Activities
Teaching Activity
2.1 Teaching at the college of Computer Science (AL Imam Muhammad Ibn Saud
University), since october 2009 :
Artificial Intelligence
Discreate Structure
Data Structure
Programming C++
Advanced Artificial Intelligence (master)
2.2 Teachning before 2009
I have taught in all levels of graduate and post-graduate studies. My main teachings consist
of the following domains : Information Systems and Databases, Data Structures and
Programming, Artificial Intelligence and Operational Research.
Below is the list of courses which I teach or I have taught :
•
Information systems and Databases.
Data and Process Models,
Relational Algebra.
Structured Query Language (SQL, PLSQL).
Database management systems (DBASE, ACCESS systems).
•
Data Structures and Programming
Data structures and graph algorithms
Algorithmic and Programming Languages
Languages C, C++.
Object-Oriented programming JAVA
•
Artificial Intelligence
Knowledge representation and reasoning
Knowledge representation : Constraint, Relation, Constraint Programming.
Constraint-based reasoning, Constraint Satisfaction.
Language : Prolog.
•
Operational Research and Discrete Mathematics
Linear Programming
Graph Algorithms
Combinatorial Optimization (discrete structures, Branch and bound method,
relaxations, Local search methods, meta-heuristics,…)
Fundamental notions of algebra, mathematical analysis (sets, operations on the
sets, matrices, linear algebra, complex numbers, functions, equation systems,…).
5
3. Research Activities
Research Activity
3.1 Research topics
Knowledge representation and reasoning is an important research subject in the
Intelligence Artificial field. Relations (Constraints) are powerful tools to reoresent
knowledge and the constraint based reasoning offers several elegant strategies to extract
new knowledge. Constraint Programming is a paradigm for knowledge representation
and reasoning where knowledge is represented by constraints and the constraint basedreasoning regroups strategies for reasoning and infering new knowledge.
My research activity deals with the constraint based-reasoning. Designing methods to
check the consistency of a set of relations is based in general on the tools of two
independent fields : Research Operational and Artificial Intelligence. Namely, my
researches are focused on the Constraint Satisfaction Problems (CSP, Max-CSP,
Weighted CSP) and the Satisfiability Problem (SAT, Max-SAT).
Several applications in domains such as data bases, resource allocation, scheduling,
bioinformatics, robotic can be modeled and solved with Constraint Programming.
I used Constraint Programming in real-life applications such as :
•
•
•
Constraints in Databases
The frequency assignment problems for the radio links.
Scheduling of the French electricity nuclear power plant outages.
Key words :
Constraint Programming, Local Consistency, Branch and Bound, Local Search,
Metaheuristics.
3.2 Research group and projects since october 2009
I involved in the creation of the Artificial Intelligence and Knowledge representation
and discovery research group . This research group conducts research in many areas of
artificial intelligence and information discovery, such as web intelligence, knowledge
representation and reasoning, machine learning, data mining.
Submitted project :
Tilte : Constraint satisfaction problem: Solving strategies and applications
Submitted to KACST
Project in preparation :
Title : Frequency Assignment in Wireless Telephone : Modeling and Solving
The project will be submitted to KASCT
6
4. Publications
Publications
Book
S. Belhadji, H. Bennaceur, G. Plateau : " Intégration des techniques de recherche
opérationnelle et de programmation par contraintes", in Méthaheuristiques et outils nouveaux
en recherche opérationnelle (Marc Pirlot, Jacques Teghem), juin 2002, Hermès edition (the
book).
Journal Papers
1. M.O.I. Khemmoudj, H. Bennaceur, Clique Inference Process for Solving Max-CSP,
European Journal of Operational Research, 2009, vol. 199, issue 3, pages
665-673.
2. F. Djerourou, H. Bennaceur, “Local search with constraint propagation for
the Partial Constraints Satisfaction Problem –CSP”, Vol. 6 No. 3 pp. 247-258,
2005.
3. H. Bennaceur . "A comparison between CSP and SAT techniques",
CONSTRAINT Journal, 9 (2) : 123-138, 2004.
4. F. Boufares, H. Bennaceur. "Consistency Problems in ER-Schemas for
Database Systems", Information Sciences Journal, 163 (4) : 263-274, 2004.
5. H. Bennaceur, I. Gouachi, G. Plateau. "An Incremental Branch-and-Bound
Method for the Satisfiability Problem", Journal on Computing, 10 (3) : 301308, 1998.
6. H. Bennaceur, G. Plateau. "Impact of quantitative methods for the
satisfiability problem", Investigation Operativa Journal, 4 (3), 1994.
7. H. Bennaceur, G. Plateau. "Constraint Satisfaction and Combinatorial
Optimization", JORBEL Belgian Journal of Operational Research, 35 (4),
1995.
8. H. Bennaceur, G. Plateau. "FASTLI : an algorithm for the constraint
satisfaction problem : application to logical inference", Information
Processing Letters, 48 : 151-158, 1993.
9. H. Bennaceur, G. Plateau. "FAST: Une méthode de résolution du problème
linéaire de satisfaction de contraintes", Technique et Science Informatiques,
11 (3) : 33-57, 1992.
Proceeding Papers in International Conferences and Workshops
7
1. I. Chaari, A. Koubaa, H. Bennaceur, S. Trigui, K. Al-Shalfan, “smartPATH: A
Hybrid ACO-GA Algorithm for Robot Path Planning” proceedings IEEE Congress on
Evolutionary Computation, CEC 2012.
2. H, Bennaceur @ al., “Surveillance Application using Cooperative Robots and Sensor
Networks: Challenges and Solutions “, Poster in the European Conference on Wireless
Sensor Networks, EWSN 2012,
3. H. Bennaceur, M. Bouzegza, “Satisfiability Problem with Prefernces”, proceedings
ICCA2011.
4.
H. Bennaceur, C. Lecoutre, O. Roussel “Decomposition Technique for MaxCSP”, European Conference of Artificial Intelligence (ECAI’2008).
5. M.O.I. Khemmoudj, H. Bennaceur, Valid Inequality Based Lower Bounds for
WCSP, 13th International Conference on Principles and Practice of Constraint
Programming (CP), Springer LNCS 4741, pages: 394-408, Providence, RI, USA
(2007).
6. M.I. Khemmoudj, M. Procheron, H. Bennaceur, “When constraint
programming and local search solve the scheduling problem of Electricité de
France nuclear power plant outages”, International Conference on Principles
and Practice of Constraint Programming-CP’06, (Nantes, 2006), in Lecture
Notes in Computer Science, pages 271-283, Springer 2006.
7. M.I. Khemmoudj, H. Bennaceur, “Clique Inference Process for Solving MaxCSP”, 12th International Conference on Principles and Practice of Constraint
Programming-CP’06, (Nantes, 2006), in Lecture Notes in Computer Science,
pages 246-250, Springer 2006.
8. F. Djerourou, H. Bennaceur, "Inferring inconsistencies to enhance branch and
bound for Max-CSP", Soft 2006 Workshop-Constraint Programming
CP’06, pages 47-62, Nantes, France, 2006.
9. M.I. Khemmoudj, H. Bennaceur, A. Nagih, “Combining Arc-Consistency and
Dual Lagrangean Relaxation for Filtering CSPs”, International Conference on
Integration of AI and OR Techniques in Constraint Programming for
Combinatorial Optimization Problems (CP-AI-OR), (Praha, 2005), pages 258272, Springer 2005.
10. M.I. Khemmoudj, M. Procheron, H. Bennaceur, Using Constraint
Programming and Local Search for Scheduling of Electricite de France
Nuclear Power Plant Outages, International workshop on Combination of
metaheuristic and local search with Constraint Programming techniques,
Nantes, France (2005).
11. M.I. Khemmoudj, H. Bennaceur, M. Porcheron, Application de la
Programmation Logique par Contraintes au problème du placement des arrêts
des réacteurs nucléaires d'EDF, 7th International Symposium on Programming
and Systems, Algiers, Algeria (2005)
12. H. Bennaceur and A. Osmani, “Computing Lower Bound for MAX-CSP
Problems”, The 16th International Conference on Industrial & Engineering
8
Applications of Artificial Intelligence and Expert Systems (IEA/AIE-2003),
June 23-26, 2003 Loughborough, UK.
13. F. Boufares H. Bennaceur and A. Osmani, “ On the Consistency of
Cardinality Constraints in UML Modeling”, 10th International Conference on
Concurrent Engineering, CE’2003, Portugal.
14. F. Boufares and H. Bennaceur, “Checking the validity of ER-schema using
integer linear programming”, International Arab Conference on Information
System, ACIT’2002, Quatar, December 2002.
15. F. Boufares, H. Bennaceur, A. Abdelatif and F. Sahli, “Oracle Designer and
the global coherence of a conceptual data model”, In the proceedings of 9th
European Conference on Information Technology Evaluation, ECITE’2002,
Paris, July 2002.
16. H. Bennaceur, Chu Min Li, ‘’Characterizing SAT Problems with the Row
Convexity Property’’, Eighth International Conference on Principles and
Practice of Constraint Programming, CP’2002, LNCS, pp 720-725.
17. H. Bennaceur, Chu Min Li : " An Empirical Measure for Characterizing 3SAT" , Fifth International Symposium on the Theory and Applications of
Satisfiability Testing, SAT’2002, pp 201-205 May 6-9, 2002,Cincinnati, Ohio,
USA.
18. H. Bennaceur, M.S. Affane : " Partition-k-AC : An Efficient Filtering
Technique Combining Domain Partition and Arc Consistency ", 7th
International Conference on Principles and Practice of Constraint
Programming, CP’2001, Lecture Notes in Computer Science (LNCS 2239),
pp560-564.
19. M.-S. Affane, H. Bennaceur : "Exploiting Integer Programming Tools to solve
MAX-CSP", in the proceedings of the Workshop on Integration of AI and OR
techniques in Constraint Programming for Combinatorial Optimization
Problem (mars 99).
20. M.S. Affane, H. Bennaceur : "A weighted arc consistency technique for
MAX-CSP", in the proceedings of the 13th European Conference on Artificial
Intelligence, ECAI'98, pp 209-213, Brighton, UK.
21. H. Bennaceur, "The satisfiability problem regarded as constraint-satisfaction
problem", in the proceedings of the 12th European Conference on Artificial
Intelligence, ECAI’96, Budapest, Hungary, August 12-16, 1996.
22. M.S. Affane, H. Bennaceur : "A labelling arc consistency method for
functional constraint", CP’96, Lecture Notes in Computer Science (LNCS
1118), pp 16-30, 1996.
23. A. Isli, H. Bennaceur : "Qualitative Interval Networks : Combining Circuit
Consistency and Path Consistency in the Search for a solution", in the
9
proceedings of the Third International Workshop on Temporal Representation
and Reasoning (TIME'96), Florida, USA, 19 - 20 may 1996.
24. H. Bennaceur : "A Boolean approach for representing and solving constraint
satisfaction problems", AIIA’94, Lecture Notes in Artificial Intelligence
(LNIA 992) pp. 163-174, October 1995.
25. H. Bennaceur, "Partial consistency for the constraint-satisfaction problems",
in the proceedings of the 11th European Conference on Artificial Intelligence,
ECAI’94, Amsterdam, August 8-12, 1994.
Proceeding Papers in National Conference
26. F. Djerourou, H. Bennaceur, "Inférence d’inconsistances pour la resolution de
Max-CSP", in the acts of the National conference on Constraints
Programming (JFPC’06), pages 129-138, Alès, France (2006).
27. M.I.. Khemmoudj, H. Bennaceur, "Inférence de cliques la resolution de MaxCSP", in the acts of the National conference on Constraints Programming
(JFPC’06), pages 229-238, Alès, France (2006).
28. M.I. Khemmoudj, F. Djerourou, H. Bennaceur, Resolution de Max-CSP par
Recherche Locale guidée par la Relaxation Lagrangienne, in the acts of the
National conference on Constraints Programming (JFPC’05), Lens, France
(2005)
29. H. Bennaceur, Min Chu Li : "Caractérisation des problèmes SAT avec la
convexité par ligne", in the acts of the National conference on Constraints
Programming, JNPC’02, pp 31-42.
30. M.S. Affane, H. Bennaceur : "A parametric lower bound for MAX-CSP", in
the acts of the National conference on Constraints Programming, JNPC'98, pp
55-62.
31. M.S. Affane, H. Bennaceur, T. Schiex : "Comparaison de deux minorants
pour le Max-CSP", in the acts of the National conference on Constraints
Programming, JNPC'00.
32. H. Bennaceur et al. : "Partie II de l'étude comparative des trois formalismes en
calcul propositionnel" in the Acts of 4th National Days of PRC-GDR artificial
intelligence, pp.239-318, Éditions Teknea, février 95.
33. A. Belabbas, H. Bennaceur, C. Fouqueré, "Résolution de CSP par
classification de contraintes: application aux logiques attribut-valeur",
Recognition of the Forms and Artificial intelligence, RFIA'94, Paris, France,
1994.
34. H. Bennaceur et al. : "Partie I de l'étude comparative des trois formalismes en
calcul propositionnel", in the Acts of 4th National Days of PRC-GDR
Artificial Intelligence, pp.239-318, Éditions Teknea, Octobre 1992.
10
Talks / Presentations / Conferences
35. H. Bennaceur, F. Djerourou, "Une méthode exacte de résolution du MaxCSP", 5st congress of ROADEF’03 (French Society of Operational Research
and Decision), Constraint Programming session, pages 332-333, Avignon,
France, 2003.
36. H. Bennaceur, F. Djerourou : "Diversification de la recherche locale dans la
résolution du VCSP avec pénalisation des couples", 5st congress of
ROADEF’03 (French Society of Operational Research and Decision) , pages
399-400, Avignon, France, 2003.
37. H. Bennaceur, F. Djerourou : "Une méthode de recherche locale guidée avec
filtrage pour le Max-CSP ", ", 4st congress of ROADEF’02 (French Society of
Operational Research and Decision), Metaheuristic session, EU/ME 2002.
38. H. Bennaceur, G. Plateau : "A new relaxation for Max-CSP", ECCO XIII,
Capri, Italy, 18-20 May 2000.
39. H. Bennaceur, G. Plateau : "Une méthode de résolution exacte pour le
problème de satisfaction de contraintes: applications dans le domaine de
l'informatique", French-Swiss meetings of Operational Research, Paris,
September 1991.
40. H. Bennaceur, G. Plateau: "Theorem proving by integer programming",
EURO XII- TIMS XXXI Joint International Conference, Helsinki, June 29
- July 1, 1992.
41. H. Bennaceur, G. Plateau : "A branch and bound method for the satisfiability
problem", ECCO VI : EURO Working Group, European Chapter on
Combinatorial Optimization, Bruxelles, 26-28 avril 1993.
42. H. Bennaceur, G. Plateau : "Inference engine in propositional logic with 0-1
programming", IFORS 93, XIII World Conference on Operations Research,
Lisbonne (Portugal), 12-16 July 1993.
43. H. Bennaceur, I. Gouachi, G. Plateau : "Un langage pour poser et résoudre les
problèmes de satisfaction de contraintes", FRANCORO French-speaking
meetings of Operational research, Mons, Belgique, June 11-14,1995.
44. H. Bennaceur, G. Plateau : "L'incrémentalité dans la satisfaction des systèmes
de contraintes en nombres entiers", The french contribution selected in the
IFORS’96 congress, Vancouver, Canada, July 8-12, 1996.
Invited Talks
45. H. Bennaceur, G. Plateau : "The exact resolution of inference problems:
impact of the method FAS3T for constraint satisfaction problems", TIMS
XXX-SOBRAPO XXIII congress, Rio de Janeiro (Brazil), July 1991.
11
46. H. Bennaceur, Gérard Plateau : "Logical inference and 0-1 programming",
Graphs and Optimization meeting, Grimentz (CH), August 1992.
47. H. Bennaceur, Gérard Plateau : "Impact of quantitative methods on logical
inference problem", Symposium on Applied Mathematical Programming
and Modeling, Budapest (Hongrie), 6-8 janvier 1993.
48. H. Bennaceur “Links between CSP and SAT models” , Tutorial, JFPC’2008.
Research reports
49. F. Boufares and H. Bennaceur, “Checking the global coherence of ER-schema
using Fourier-Motzkin Elimination”, LIPN research report n° 2002-2, Mars
2002.
50. H. Bennaceur, G. Plateau : "A Graph coloring technique for Max-CSP", LIPN
research report n°2000-01, February 2000.
51. H Bennaceur, G. Plateau, F. Thomasset : "An Exact Algorithm for the
Constraint Satisfaction Problem : Application to Dependence Computing in
Automatic Parallelization", Rapport I.N.R.I.A. 1246.
52. H. Bennaceur, C. Lecoutre, O. Roussel “Decomposition Technique for Max-
CSP”, submitted to the European Conference of Artificial Intelligence
(ECAI’2008).
Thesis Dissertations
53. "Contributions à la résolution de problèmes de satisfaction de contraintes",
habilitation à diriger des recherches HDR (TENURE), Paris 13 university,
January 97.
54. "Le problème de satisfaction de contraintes synthèse et méthode exacte de
résolution". Thèse de doctorat d'Informatique (PhD), Paris 13 university,
December 89.
55. "Résolution des systèmes linéaires de grandes tailles", mémoire de DEA
(Master), Paris 6 university, June 86.
56. "Étude et réalisation d'une machine logique multipostes pour l'interrogation
d'une banque de données documentaires", mémoire d'ingénieur (Engineer
thesis), university USTHB, Algiers 1984.
12
5. Supervision of PhDs and Masters
Supervising PHD and Masters
PhD and Master supervision
PhDs :
I supervised PhDs of :
• M.S. Affane “constraint satisfaction and optimization”, started in September 95 and
defended in February 03, 1999.
• F. Djerourou, “Valued Constraint Satisfaction Problems : metaheuristics and
complete methods” started in September 2001 and defended on May, 2007.
• MI. Khammoudj, “Modelling and solving constraint systems : application to the
planning problem of the stops of the nuclear reactors of The French Electricity
company (EDF)”, started in September 2002 and defended on April 4, 2007.
I have participated to supervise two PhDs. (50 %) of
• I. Gouachi, "Conception of a combinatorial problems solver", started in October
1992 and defended in September 30, 1998,
• Belabbas, “on the second part of this thesis which concerns the application of
constraint satisfaction approaches for checking the consistency of natural language
grammar”, started in February 93 and defended in November 96.
At present, I supervise the PhD :
•
W. Kérada, Distributed Algorithms for Constraint Satisfaction, started in September
2003.
Masters :
Below is the list of Masters which I have supervised. For each master supervision,
the name of the student, the title of the subject, and the year are given.
•
•
•
•
•
•
•
•
•
•
•
F. LeCarré – “An hybrid method for the constraint satisfaction problem”, (1992)
I. Gouachi – “LIRESNE : A language for interpreting and solving integer linear
programs”, (1993)
P. Boucher - “Local search methods”, ( 1994)
M. S. Affane – “Evaluation of constraint satisfaction approaches”, (1995).
S. O. Hamiche – “Evaluation of the filtering techniques for the constraint satisfaction
problem”, (1995).
B. Djalab – “CSP’s models and real applications”, (1996).
F. Zehraoui - “A Graph coloring technique for Max-CSP”(2000).
F. Djerourou – “Metaheuristics for the weighted CSPs”, (2001).
B. Medjahed – “Global consistency of a Database schema”, (2002).
MI. Khemmoudj – “Contribution of the Constraint Logical Programming for solving the
planning problem of the stops of the nuclear reactors of The French Electricity
compagny (EDF)”, (2002).
C. Chérif – “A comparison study between CSP and SAT techniques”, (2004).
13
6. Professional Research Activities
Research professional activities
• Responsibilities
- Since October 1996 : I received special recongnition (including bonuses) for my
research activities and supervision of PHD thesis, renewed twice 2000-2004 and
2004-2008 for a 4 years period each time.
- 1998-2000 : member of the French Association of Operational Research
(ROADEF).
- From February to September 90 : I was involved in the project CAPRAN (Calcul
Parallèle Numérqiue) in INRIA (National research institute in Computing and in
Automatism)
- Since 1994, member of the Computer Science recrutement committee at the
university of Cergy, it is charged to recruit associate professors.
•
Research projects
I was involved in several research projects and researcher groups.
- BAHIA project (Boolean Algorithms and Heuristics for Intelligence Artificial) (93-95)
- RESSAC group (since 1995)
- Algorithm, Language and Programming: group (98-2000)
- Contract between the company EDF ( Electricité De France) and the laboratory LIPN
(2002-2007).
The BAHIA project piloted by Professor Pierre Siégel gathers researchers of Bordeaux,
Dijon, Marseille, Montpelier, Nîmes, Toulouse and Paris 13 universities. It consists in
comparing three families of approaches handling the problem of Satisfiability of a boolean
expression : Logical approach, Constraint satisfaction approach and Linear programming
approach.
The objective of the group RESSAC is to continue the development of the works realized
within the framework of the project BAHIA. Since its creation this group organizes every
year a national conference on Constraint Programming in which I participated as member of
the program committee or for the presentation of my research works.
The research contract EDF-LIPN associates the laboratory LIPN with the company EDF
on the project "contribution of the logical constraint programming to the problem of
placement of the stops of nuclear reactors ". I supervised a PhD thesis which is financed on
this contract.
This contract is renewed for a period of 18 months until the end of 2007.
14
•
Program committees and paper reviewing
I was member of the program committees of the conferences JNPC’97, JNPC’99,
JNPC’2000, JNPC’2003, JFPC’2008 and ISPS’00, Workshop on Preferences and Soft
Constraints, SofT’10.
I reviewed papers for the following journals and conferences.
Journals
Information Systems
Revue d'Intelligence Artificielle
The computer Journal
Artificial Intelligence Journal.
Annals of Mathematics and Artificial Intelligence
Technique et Science Informatiques
Conferences
International Computing Conference in Arabic ICCA’ 2011
Workshop on Preferences and Soft Constraints, SofT’10.
The AAAI Conference on Artificial Intelligence 2008.
French Conference on Constraint Programming 2008.
International Joint Conferences on Artificial Intelligence IJCAI’07.
Recognition of the Forms and Artificial intelligence RFIA'94
Constraint Programming CP'95
International Conference on Tools with Artificial Intelligence IEEE ICTAI'96
National Conference on Constraints Programming JNPC'97, JNPC’99, JNPC’2000
International Symposium on Processing System ISPS'97, ISPS’99.
•
Memberships in Dissertation Committees
Below the subjects and the compositions of the PhD dissertation committees in which I
had participated:
Leonel Paris “ Approaches for solving SAT et CSP : strong backdoor sets" , PhD, University
of Provence, November 9, 2007.
Fayçal Djerourou "Contribution to Exact Solving of Weitghted Constraint Satisfaction
Problems", University Paris 13, May 2007.
Jury : H Bennaceur, G. Plateau, L. Sais, JK Hao, C. Lavault, C. Lecoutre, M. GuignardSpielberg.
M. O. I. Khemmoudj "Modeling and Solving Constraint Systems : Application to
Scheduling and Planning The Nuclear Reactor of the French Electricity Campagny (EDF)" ,
University Paris 13, April 4, 2007.
Jury : A. Aggoun, H. Bennaceur, C. Fouqueré, P. Michelon, G. Plateua, T. Schiex.
15
A. Liret, ‘‘Integration of Rewriting System Mechanism in a Constraint Satisfaction de
System" , PhD, University Paris 6, October 12 2000.
Jury : Y. Caseau, C. Kirchner, J.F. Perrot, H. Bennaceur, P. Codognet, D. Lesaint, F.
Pachet.
M.S Affane "Constaint Networks : satisfaction and optimisation", PhD, university Paris 13,
February 3 1999.
Jury : H. Bennaceur, P. Michelon, G. plateau, J.J. Chabrier, M.C. Villarem.
I. Gouachi, "LIRESNE : A System for Solving Integer Constraint Satisfaction Problems "
PhD, University Paris 13, September 30 1998.
Jury : V. Zissimopoulos, J.J Chabier, P. Michelon, H. Bennaceur, G. Plateau, M. Dincbas.
A. Belabbas, : " Constraint Satisfaction for checking the validity of Natural Langage Syntax",
PhD, University Paris 13, November 25th, 1996.
Jury D. Kayser, C. Fouqueré, H. Bennaceur, B. Levrat, M.C. Villarem.
~
M. Ettaouil ‘‘NonLinear Constraint Satisfaction with 0-1 Variables and tools of quadratic
proramming‘, PhD, University Paris 13, Februry 25 , 1994.
Jury : H. Bennaceur, D. Fayard, A Fréville, G. plateau, P. Tolla.