| Accueil |
 |
|
|
 |
| Équipes |
|
|
|
 |
| Projets struct. |
|
|
|
|
| Vie du laboratoire |
|
|
|
|
|
 |
Belaïd BENHAMOU
|
 |
|
|
|
Membre de l'équipe INCA |
| |
| Fonction : |
Maître de conférences (MCF) |
| UFR : |
Université de Provence (U1) |
| |
| Tél. : |
04 91 11 36 22 |
| E-mail : |
belaid benhamou cmiuniv-mrsfr |
| |
| Adresse : |
LSIS - UMR CNRS 6168
Domaine Universitaire de Saint-Jérôme
Avenue Escadrille Normandie-Niemen
13397 MARSEILLE CEDEX 20 |
|
PUBLICATIONS
|
|
|
[1] D. Boughaci, B. Benhamou, Drias Habiba., “Une recherche locale stochastique pour le problème de la détermination du gagnant dans les enchères combinatoires”, in: JFPC 2008, 2008.[bib] |
|
|
|
[2] B. Benhamou, Mohamed Réda Saidi, “Une nouvelle méthode basée sur la dominance et la coloration pour le test d'inconsistance de CSPs”, in: JFPC'08, 2008.[bib] |
|
|
|
[3] B. Benhamou, Gilles Audemard, “Symétries”, in: Hermes, Lavoisier (Ed.), ``Problème SAT : progrès et défis'', 2008.[bib] |
|
|
|
[4] D. Boughaci, B. Benhamou, Habiba Drias, “Stochastic Local Search for the Optimal Winner Determination Problem”, in: Méta 2008, 2008.[bib] |
|
|
|
[5] D. Boughaci, B. Benhamou, Habiba Drias, “A memetic algorithm for the optimal winner determination problem”, in: Soft Computing, octobre 2008. à paraître.[bib] |
|
|
|
[6] D. Boughaci, B. Benhamou, Habiba Drias, “Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions”, in: CP 2008, septembre 2008. à paraître.[bib] |
|
|
|
[7] B. Benhamou, P. Siegel, “Symmetry and Non-monotonic Inference”, in: Symcon'08, septembre 2008. à paraître.[bib] |
|
|
|
[8] B. Benhamou, M. R. Saïdi, “A new incomplete method for CSP inconsistency checking”, in: Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08), AAAI Press, Chicago, Illinois, USA, juillet 2008. à paraître.[bib] |
|
|
|
[9] D. Boughaci, Brahim Oubeka, Abdelkader Aissioui, Habiba Drias, B. Benhamou, “Design and Implementation of a Distributed Firewall using Autonomous Agents”, in: Idea Group Inc , USA , 2008 (Ed.), ``Handbook of Research on Information Security and Assurance'', Jatinder N. D. Gupta and Sushil K Sharma, avril 2008. à paraître.[bib] |
|
|
|
[10] D. Boughaci, B. Benhamou, H. Drias, “Genetic algorithms and scatter search for MAX-SAT problems”, in: Journal of Mathematical modelling and Algorithms (JMMA), vol. Springer, avril 2008. à paraître.[bib] |
|
|
|
[11] D. Boughaci, B. Benhamou, H. Drias, “Approches évolutionnaires pour le problème MAX-SAT”, in: 2008, 7 ème Conféerence Francophone de MOdélisation et SIMulation, - MOSIM'08 - du 31 mars au 2 avril 2008, mars 2008. à paraître.[bib] |
|
|
|
[12] D. Boughaci, B. Benhamou, H. Drias, “IGA: an Improved Genetic Algorithm for MAX-SAT Problems”, in: Indian International Conference on Artificial Intelligence (IICAI)-07, décembre 2007. à paraître.[bib] |
|
|
|
[13] B. Benhamou, M. R. Saïdi, “Detecting and Eliminating Local Symmetry During Search in CSPs”, in: 3rd Indian International Conference on Artificial Intelligence (IICAI-07), Bhanu Prasad, n° ISBN 978-0-9727412-2-4, pp. 151-166, Pune, India, décembre 2007.[bib] |
|
|
|
[14] Mahat Kelfallah, Belaid Benhamou, “A local search-based method for restoring disjunctive temporal problem consistency”, in: IICAI'07, 2007.[bib] |
|
|
|
[15] D. Habet, L. Paris, Belaid Benhamou, “Consistent Neighborhood for the Satisfiability Problem”, in: Proceedings of the 19th International Conference on Tools with Artificial Intelligence (ICTAI'07), pp. 497-501, IEEE, Patras, Greece, novembre 2007.[bib] |
|
|
|
[16] B. Benhamou, M. R. Saïdi, “Local Symmetry Breaking During Search in CSPs”, in: The 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Springer, LNCS, vol. 4741, pp. 195-209, Providence, USA, septembre 2007.[bib] |
|
|
|
[17] B. Benhamou, M. R. Saïdi, “Dynamic Detection and Elimination of Local Symmetry in CSPs”, in: The CP 2007 Workshop on Symmetry and Constraint Satisfaction Problems (SymCon'07), B. Benhamou, B.Y. Choueiry, and B. Hnich (Eds.), pp. 22-29, Providence, USA, septembre 2007.[bib] |
|
|
|
[18] Stéphane Zampelli, Yves Deville, M. R. Saïdi, B. Benhamou, “Symmetry Breaking in Subgraph Isomorphism”, in: The CP 2007 Workshop on Symmetry and Constraint Satisfaction Problems (SymCon'07), Providence, USA, septembre 2007. à paraître.[bib] |
|
|
|
[19] D. Boughaci, B. Benhamou, H. Drias, “Une recherche dispersée pour le problème MAX-SAT”, in: 8e Rencontres nationales des Jeunes Chercheurs en Intelligence Artificielle RJCIA 2007, juillet 2007. à paraître.[bib] |
|
|
|
[20] L. Paris, D. Habet, B. Benhamou, “Voisinage consistant pour le problème de satisfaisabilité”, in: Actes des troisièmes Journées Francophones de Programmation par Contraintes (JFPC’2007), pp. 58-66, Rocquencourt, France, juin 2007.[bib] |
|
|
|
[21] B. Benhamou, M. R. Saïdi, “Elimination des symétries locales durant la résolution des CSPs”, in: Actes des troisièmes Journées Francophones de Programmation par Contraintes (JFPC’2007), pp. 245-254, Rocquencourt, France, juin 2007.[bib] |
|
|
|
[22] D. Boughaci, B. Benhamou, H. Drias,, “Solving MAX-SAT Problems using a Scatter Search Metaheuristic”, in: Colloque sur l'Optimisation et les Systèmes d'Information COSI'07, 11-13 juin 2007 - Oran Algérie, juin 2007. à paraître.[bib] |
|
|
|
[23] D. Boughaci, Habiba Drias, Belaid Benhamou, “An ebXML-based Multiagent System for B2B eCommerce”, in: the E-Commerce Technologies Track of the 22nd ACM Symposium on Applied Computing, pp. 659- 663, ACM Press, Seoul, Korea,, 11- 15 mars 2007.[bib] |
|
|
|
[24] B. Benhamou, M. R. Saïdi, “Eliminating Local Symmetry in CSPs”, in: The International Symmetry Conference (ISC 2007), Edinburgh, SCOTLAND, janvier 2007.[bib] |
|
|
|
[25] Stéphane Zampelli, Yves Deville, M. R. Saïdi, B. Benhamou, Pierre Dupont, “Breaking Local Symmetries in Subgraph Pattern Matching”, in: The International Symmetry Conference (ISC 2007), Edinburgh, SCOTLAND, janvier 2007.[bib] |
|
|
|
[26] D. Boughaci, Habiba Drias, Belaid Benhamou, “Approches Métaheuristiques pour les problèmes max-SAT difficiles”, in: 7ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision "Roadef06", 6, 7, 8 Février 2006. à LILLE.[bib] |
|
|
|
[27] D. Boughaci, Belaid Benhamou, Habiba Drias, “A Specific Genetic Algorithm for MAX-SAT problems”, in: META'06 workshop and school on Metaheuristics, 2-3-4 Novembre 2006. Hamammat, Tunisie.[bib] |
|
|
|
[28] Mahat Kelfallah, B. Benhamou, “A minimal method for restoring temporal information consistency”, in: Journal of Research in Computing Seance, vol. 19, pp. 43-56, 2006.[bib] |
|
|
|
[29] L. Paris, B. Benhamou, P. Siegel, “A Boolean encoding including SAT and n-ary CSPs”, in: Proceedings of The Twelfth International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA 2006), Springer, LNAI, n° 4183, pp. 33-44, Varna, Bulgaria, Septembre 2006.[bib] |
|
|
|
[30] B. Benhamou, M. R. Saïdi, “Reasoning by dominance in Not-Equals binary constraint networks”, in: Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006 ), Springer, LNCS, vol. 4204, pp. 670-674, Cité des Congrès - Nantes, France, septembre 2006.[bib] |
|
|
|
[31] B. Benhamou, L. Paris, P. Siegel, “Dealing with SAT and CSPs in a single framework”, in: Proceedings of the The CP 2006 Workshop on the Integration of SAT and CP techniques, pp. 65-79, Nantes, France, September 25 2006.[bib] |
|
|
|
[32] B. Benhamou, M. R. Saïdi, “Reasoning by dominance in Not-Equals binary constraint networks”, in: The CP 2006 Workshop on Symmetry and Constraint Satisfaction Problems (SymCon'06), pp. 9-16, Cité des Congrès - Nantes, France, septembre 2006.[bib] |
|
|
|
[33] Gilles Audemard, B. Benhamou, L. Henocque, “Predicting and detecting Symmetry in FOL Finite Model search”, in: Journal of Automated Reasoning, juillet 2006. à paraître.[bib] |
|
|
|
[34] B. Benhamou, M. R. Saïdi, “Etude de la dominance dans les CSPs à contraintes de différence”, in: Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC'2006), pp. 63-70, juin 2006.[bib] |
|
|
|
[35] M. R. Saïdi, B. Benhamou, “Dealing with symmetry in Not-Equals binary constraint networks: application to graph coloring”, in: Colloque sur l'Optimisation et les Systèmes d'Information (COSI'06), Alger, Algérie, juin 2006.[bib] |
|
|
|
[36] D. Boughaci, Habiba Drias, B. Benhamou, “Two Hybrid Tabu Scatter Search Meta-heuristic for Solving MAX-SAT Problems”, in: Alexander Gelbukh, Raul Monroy (Eds.), a special issue on Advances in Artificial Intelligence Theory, Journal of Research on Computing Sciences (RCS), ISSN 1665 - 9899, n° 16, pp. 45 - 54, 2005.[bib] |
|
|
|
[37] D. Boughaci, Habiba Drias, B. Benhamou, “Two Hybrid Tabu Scatter Search Meta-heuristics for solving MAX-SAT Problems”, in: Fourth Mexican International Conference on Artificial Intelligence, MICAI-05, Poster, Monterry, Nuevo Leôn, Mexico, novembre 2005.[bib] |
|
|
|
[38] D. Boughaci, Habiba Drias, B. Benhamou, “Combining a Unit Propagation with Genetic Algorithms to Solve max-SAT”, in: Workshop of Combination of Metaheuristic and Local Search with Constraint Programming (MLS+CP), University of Nantes, France., novembre 2005.[bib] |
|
|
|
[39] D. Boughaci, Habiba Drias, B. Benhamou, “A Scatter Search Variant to solve max-SAT Problems”, in: Workshop, Combination of Methaeuristic and Local Search with Constraint Programming (MLS+CP), University of Nantes, France., novembre 2005.[bib] |
|
|
|
[40] B. Benhamou, M. R. Saïdi, “Some improvements in symmetry elimination in not-equals binary constraint networks”, in: Proceedings of the satelite workshop of CP 2005, Symmetry and Constraint Satisfaction Problems (SymCon'05), pp. 1-7, Sitges, Spain, October 2005.[bib] |
|
|
|
[41] M. Khelfallah, B. Benhamou, “A local Fusion Method of Temporal Information”, in: Proc. of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'05), pp. 477- 488, Springer-Verlag, Barcelona, Spain, juillet 2005.[bib] |
|
|
|
[42] M. Khelfallah, B. Benhamou, “Fusion locale de contraintes temporelles avec priorité”, in: 7ème Rencontres Jeunes Chercheurs en Intelligence Artificielle, RJCIA'05, Emmanuel Guéré, Plate-forme AFIA, pp. 211-224, Nice, France, 1-3 juin 2005.[bib] |
|
|
|
[43] M. Khelfallah, B. Benhamou, “A local Method Prioritized Fusion of Temporal Information”, in: Proc. of the 12th International Symposium on Temporal Representation and Reasoning, TIME'05, Jan Chomiki and David Toman, pp. 35-43, IEEE Computer Society, Burlington, Vermont, USA, 23-25 june 2005.[bib] |
|
|
|
[44] M. R. Saïdi, B. Benhamou, “Symétries dans les réseaux de contraintes de différence”, in: 7ème Rencontres Jeunes Chercheurs en Intelligence Artificielle, RJCIA'05, Emmanuel Guéré, Plate-Forme AFIA, pp. 239-252, Nice, France, juin 1-3 2005.[bib] |
|
|
|
[45] L. Paris, B. Benhamou, P. Siegel, “Un cadre théorique et pratique commun aux formalismes SAT et CSP n-aires”, in: 7e Rencontres Jeunes Chercheurs en Intelligence Artificielle (RJCIA'05), pp. 169-182, Nice, France, juin 1-3 2005.[bib] |
|
|
|
[46] L. Paris, B. Benhamou, P. Siegel, “A Cardinality General Normal Form (CGNF) in propositional logic including n-ary CSPs.”, in: Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming (CSCLP'05), pp. 89-100, Uppsala, Sweden, June 20-22 2005.[bib] |
|
|
|
[47] B. Benhamou, “Satisfiability and matchings in bipartite graphs: relationship and tractability”, in: The journal of Spanish Royal Academy of sciences (RACSAM), a special issu on Symbolic Computation and Artificial Intelligence, vol. 98, n° (1-2), pp. 55 - 63, 2004.[bib] |
|
|
|
[48] D. Boughaci, Habiba Drias, B. Benhamou, “Solving MAX-SAT problems using a Memetic Evolutionary Meta-Heuristic”, in: Proceedings of the IEEE International conference on Cybernetics and Intelligent Systems, CIS-2004, pp. 480 - 484, December 2004.[bib] |
|
|
|
[49] M. Khelfallah, B. Benhamou, “Two Revision Methods Based on Constraints: Application to a Flooding Problem”, in: Proc of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC'04, B. Buchberger and J. Campbell, vol. LNAI 3249, pp. 265-270, Springer-Verlag, Linz, Austria, September 22-24 2004.[bib] |
|
|
|
[50] Belaid Benhamou, “Symmetry in Not-equals Binary Constraint Networks”, in: Proceedings of the satelite workshop of CP 2004, Symmetry in Constraints (SymCon'04), pp. 2-8, Toronto, september 2004.[bib] |
|
|
|
[51] M. Khelfallah, B. Benhamou, “Geographic information revision based on constraints”, in: 16th European Conference on Artificial Intelligence ECAI'04, pp. 828-832, IOS Press, Valencia, Spain, August 23-27 2004.[bib] |
|
|
|
[52] Gilles Audemard, B. Benhamou, L. Henocque, “Predecting and detecting symmetry in Finite Model Search”, LSIS, n° LSIS.RR.2004.003, Juin 2004. (Accepted for publication in JAR).[bib] |
|
|
|
[53] B. Benhamou, “Symmetry in Alldifferent constraint networks”, LSIS, n° LSIS.RR.2004.002, mai 2004.[bib] |
|
|
|
[54] Mahat Khalfellah, B. Benhamou, “Geographic information revision based on constraints”, LSIS, n° LSIS.RR.2004.001, avril 2004.[bib] |
|
|
|
[55] M. Khelfallah, B. Benhamou, R. Jeansoulin, “Révision de contraintes temporelles : application au problème de l'inondation”, in: 14ème Congrès Francophone de Reconnaissance des Formes et Intelligence Artificielle, RFIA, AFRIF-AFIA, pp. 295-303, Toulouse, France, Janvier, 28-30, 2004.[bib] |
|
|
|
[56] M. Khelfallah, B. Benhamou, R. Jeansoulin, “Révision d'informations géographiques à base de contraintes”, in: Journées Nationales sur les Modèles de Raisonnement, JNMR'03, Paris, France, Novembre, 27-28, 2003.[bib] |
|
|
|
[57] G. Audemard, B. Benhamou, “Reasoning by symmetry and function ordering in Finite model generation”, in: Proceedings of the 18th International Conference on Automated Deduction (CADE18), juillet 2002.[bib] |
|
|
|
[58] G. Audemard, B. Benhamou, “Etude des Symétries dans les modèles finis”, in: Journées Francophones de Programmation en Logique et Programmation par Contraintes, JFPLC, pp. 109-122, 2001.[bib] |
|
|
|
[59] B. Benhamou, HDR : “Contribution à la résolution de contraintes: contraintes booléennes et le problème SAT, satisfaction de contraintes au sens CSP et CSP temporel, et génération de modèles finis en logique du premier ordre”, Université de Provence, 2001.[bib] |
|
|
|
[60] G. Audemard, B. Benhamou, “Symmetry in finite model of first order theory”, in: Symmetry in Constraint - CP01, décembre 2001.[bib] |
|
|
|
[61] G. Audemard, B. Benhamou, L. Henocque, “Two techniques to improve Finite Model Search”, in: 17th International Conference on Automated Deduction CADE17, pp. 302-308, Pittsburgh, 2000.[bib] |
|
|
|
[62] G. Audemard, B. Benhamou, P. Siegel, “AVAL: an enumerative Method for SAT”, in: Proceedings of the conference on Computational Logic (CL00), pp. 373-383, Londres, 2000.[bib] |
|
|
|
[63] B. Benhamou, “Symmetry and Dominance in CSPs”, LIM, 2000.[bib] |
|
|
|
[64] B. Benhamou, L. Henocque, “A Hybrid Method for finite Model Search in Equational theories”, in: Fundamenta Informaticae, n° 39, pp. 21-38, 1999.[bib] |
|
|
|
[65] G. Audemard, B. Benhamou, P. Siegel, “La méthode d'avalanche AVAL : une méthode énumérative pour SAT”, in: Journée nationale des problèmes NP Complets, JNPC 99, pp. 17-25, Lyon, 1999.[bib] |
|
|
|
[66] G. Audemard, B. Benhamou, L. Henocque, “Two techniques to improve Finite Model Search.”, Rapport de recherche, Laboratoire d'Informatique de Marseille, n° 339, 1999.[bib] |
|
|
|
[67] Gilles Audemard, B. Benhamou, P. Siegel, “La méthode d'avalanche AVAL: une méthode énumérative pour SAT”, LIM, n° 309, 1999.[bib] |
|
|
|
[68] B. Benhamou, L. Henocque, “Finite model search for equational theories”, in: 4th International Conference Artificial Intelligence and Symbolic Computation, AISC'98, LNCS, pp. 84-93, Springer Verlag, Plattsburgh, USA, 1998.[bib] |
|
|
|
[69] B. Benhamou, A. Isli, “Study of symmetry in Qualitative Temporal Interval Networks”, in: 8th International Conference on Artificial Intelligence : Methodology, Systems, Applications, AIMSA'98, pp. 88-101, Springer Verlag, Sozopol, Bulgaria, 1998.[bib] |
|
|
|
[70] B. Benhamou, L. Henocque, “Vers un système de recherche de modèles finis pour les théories équationnelles”, in: 4èmes journées Nationales Résolution Pratique de Problèmes NP-complets, JNPC'98, pp. 47-54, Nantes, 1998.[bib] |
|
|
|
[71] B. Benhamou, L. Henocque, “A Finite model search for equational theories and Applications”, in: 2th International Theorem Workshop, Linz, Austria, 1998.[bib] |
|
|
|
[72] B. Benhamou, L. Henocque, “Study of a finite model search system for equational theories and applications”, Rapport de Recherche, LIM, 1998.[bib] |
|
|
|
[73] B. Benhamou, Amar Isli, “Study of Symmetry in Qualitative Temporal Interval Networks”, in: Proccedings of ECAI'98 Workshop on Spatial and Temporal Interval networks, pp. 41-50, UK, 1998.[bib] |
|
|
|
|
|
|
| Recherche |
|
|
|
|
| Enseignement |
|
|
|
|
| Liens |
|
|
|
|
|
