Hachémi Bennaceur

 

Centre de Recherche en Informatique de Lens (CRIL).

CNRS - UMR 8188.

 

 Computer Science Department

I.U.T de Lens

Email : bennaceur@cril.univ-artois.fr

 

 

 

 

Teaching                  Research                               Publications

 

 


-------------------------------------------------------------------------------------------------------------



Teaching

My main teachings concerns the following areas: 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 :

Data and Process Models,

Relational Algebra.

Structured Query Language (SQL, PLSQL).

Database management systems (ACCESS).

 

Data structures and graph algorithms

Algorithmic and Programming Languages

Languages C, C++.

Object-Oriented programming JAVA

 

Knowledge representation and reasoning

Knowledge representation : Constraint, Relation, Constraint Programming.

Constraint-based reasoning, Constraint Satisfaction.

 

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,…).

 

 

Research

Knowledge representation and reasoning is an important research subject in the Intelligence Artificial field. Relation (Constraint) is a powerful tool to describe the 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 based-reasoning is the strategy to infer 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 :

 

Key words :

Constraint Programming, Local Consistency, Branch and Bound, Local Search, Metaheuristics.

 

 

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.I. Khemmoudj, H. Bennaceur “M.O.I. Khemmoudj, H. Bennaceur, Clique Inference Process for Solving Max-CSP, special issue of European Journal of Operational Reaserch on "Cooperative Combinatorial Optimization" ( to appear in 2008).

 

  1. H. Bennaceur . "A comparison between CSP and SAT techniques", CONSTRAINT Journal, 9 (2) : 123-138, 2004.

 

  1. F. Boufares, H. Bennaceur. "Consistency Problems in ER-Schemas for Database Systems", Information Sciences Journal, 163 (4) : 263-274, 2004.

 

  1. H. Bennaceur, I. Gouachi, G. Plateau. "An Incremental Branch-and-Bound Method for the Satisfiability Problem", Journal on Computing, 10 (3) : 301-308, 1998.

 

  1. H. Bennaceur, G. Plateau. "Impact of quantitative methods for the satisfiability problem", Investigation Operativa Journal, 4  (3), 1994.

 

  1. H. Bennaceur, G. Plateau. "Constraint Satisfaction and Combinatorial Optimization", JORBEL Belgian Journal of Operational Research, 35 (4), 1995.

 

  1. H. Bennaceur, G. Plateau. "FASTLI : an algorithm for the constraint satisfaction problem : application to logical inference", Information Processing Letters, 48 : 151-158, 1993.

 

  1. 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

 

 

  1. H. Bennaceur, C. Lecoutre, O. Roussel “Decomposition Technique for Max-CSP”, accepted in the European Conference of Artificial Intelligence (ECAI’2008).

 

 

  1. 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).

 

  1. 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.

 

  1. M.I. Khemmoudj, H. Bennaceur, “Clique Inference Process for Solving Max-CSP”, 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.

 

  1. 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.

 

  1. 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 258-272, Springer 2005.

 

  1. 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).

 

  1. 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)

 

  1. H. Bennaceur and  A. Osmani,  “Computing Lower Bound for MAX-CSP Problems”, The 16th International Conference on Industrial & Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-2003), June 23-26, 2003 Loughborough, UK.

 

18.                    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.

 

19.                    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.

 

 

20.                    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.

 

21.                    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.

 

  1. H. Bennaceur, Chu Min Li : " An Empirical Measure for Characterizing 3-SAT" , Fifth International Symposium on the Theory and Applications of Satisfiability Testing, SAT’2002, pp 201-205 May 6-9, 2002,Cincinnati, Ohio, USA.

 

  1. 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.

 

  1. 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).

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

  1. A. Isli, H. Bennaceur : "Qualitative Interval Networks : Combining Circuit Consistency and Path Consistency in the Search for a solution", in the proceedings of the Third International Workshop on Temporal Representation and Reasoning (TIME'96), Florida, USA, 19 - 20 may 1996.

 

  1. 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.

 

  1. 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

 

  1. 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).

 

  1. M.I.. Khemmoudj, H. Bennaceur, "Inférence de cliques la resolution de Max-CSP", in the acts of the National conference on Constraints Programming (JFPC’06), pages 229-238, Alès, France (2006).

 

  1. 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)

 

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

 

Talks / Presentations / Conferences

 

  1. H. Bennaceur, F. Djerourou, "Une méthode exacte de résolution du Max-CSP", 5st congress of ROADEF’03 (French Society of Operational Research and Decision), Constraint Programming session, pages 332-333, Avignon, France, 2003.

 

  1. 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.

 

  1. 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.

 

  1. H. Bennaceur, G. Plateau : "A new relaxation for Max-CSP", ECCO XIII, Capri, Italy, 18-20 May 2000.

 

  1. 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.

 

  1. H. Bennaceur, G. Plateau: "Theorem proving by integer programming", EURO XII- TIMS XXXI Joint International Conference, Helsinki, June 29 -  July 1, 1992.

 

  1. 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.

 

  1. 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.

 

  1. 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.

 

  1. 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

 

  1. 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.

 

  1. H. Bennaceur, Gérard Plateau : "Logical inference and 0-1 programming", Graphs and Optimization meeting, Grimentz (CH), August 1992.

 

  1. 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.

 

  1. H. Bennaceur “Links between CSP and SAT models” , Tutorial, JFPC’2008.

 

 

Research reports and Submitted Papers

 

54.                    F. Boufares and H. Bennaceur, “Checking the global coherence of ER-schema using Fourier-Motzkin Elimination”,  LIPN research report n° 2002-2, Mars 2002.

 

55.                    H. Bennaceur, G. Plateau : "A Graph coloring technique for Max-CSP", LIPN research report n°2000-01, February 2000.

 

56.                    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.

 

 

 

Thesis Dissertations

 

  1. "Contributions à la résolution de problèmes de satisfaction de contraintes", habilitation à diriger des recherches (HDR), university Paris 13, January 97.

 

  1. "Le problème de satisfaction de contraintes synthèse et méthode exacte de résolution". Thèse de doctorat d'Informatique (PhD), university Paris 13, December 89.

 

  1. "Résolution des systèmes linéaires de grandes tailles", mémoire de DEA (Master), university Paris 6, June 86.

 

  1. "É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.