Belaid Benhamou

Belaid Benhamou, Lionel Paris, Pierre Siegel: Dealing with Satisfiability and n-ary CSPs in a Logical Framework. J. Autom. Reasoning 48(3): 391-417 (2012)

Belaid Benhamou, Pierre Siegel: A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics. ICTAI 2012: 572-579

Dalila Boughaci, Belaid Benhamou, Habiba Drias: Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. J. Math. Model. Algorithms 9(2): 165-180 (2010)

Belaid Benhamou, Tarek Nabhani, Richard Ostrowski, Mohamed Réda Saïdi: Enhancing Clause Learning by Symmetry in SAT Solvers. ICTAI (1) 2010: 329-335

Dalila Boughaci, Belaid Benhamou, Habiba Drias: A memetic algorithm for the optimal winner determination problem. Soft Comput. 13(8-9): 905-917 (2009)

Dalila Boughaci, Belaid Benhamou, Habiba Drias: Scatter Search and Genetic Algorithms for MAX-SAT Problems. J. Math. Model. Algorithms 7(2): 101-124 (2008)

Belaid Benhamou, Mohamed Réda Saïdi: A New Incomplete Method for CSP Inconsistency Checking. AAAI 2008: 229-234

Dalila Boughaci, Belaid Benhamou, Habiba Drias: Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. CP 2008: 593-597

Belaid Benhamou, Mohamed Réda Saïdi: Local Symmetry Breaking During Search in CSPs. CP 2007: 195-209

Djamal Habet, Lionel Paris, Belaid Benhamou: Consistent Neighborhood for the Satisfiability Problem. ICTAI (2) 2007: 497-501

Dalila Boughaci, Belaid Benhamou, Habiba Drias: IGA: an Improved Genetic Algorithm for MAX-SAT Problems. IICAI 2007: 132-150

Belaid Benhamou, Mohamed Réda Saïdi: Detecting and Eliminating Local Symmetry During Search in CSPs. IICAI 2007: 151-166

Mahat Khelfallah, Belaid Benhamou: Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency. IICAI 2007: 167-179

Gilles Audemard, Belaid Benhamou, Laurent Henocque: Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reasoning 36(3): 177-212 (2006)

Lionel Paris, Belaid Benhamou, Pierre Siegel: A Boolean Encoding Including SAT and n-ary CSPs. AIMSA 2006: 33-44

Belaid Benhamou, Mohamed Réda Saïdi: Reasoning by Dominance in Not-Equals Binary Constraint Networks. CP 2006: 670-674

Dalila Boughaci, Habiba Drias, Ahmed Bendib, Youcef Bouznit, Belaid Benhamou: Distributed Intrusion Detection Framework based on Autonomous and Mobile Agents. DepCoS-RELCOMEX 2006: 248-255

Dalila Boughaci, Habiba Drias, Brahim Oubeka, Abdelkader Aissioui, Belaid Benhamou: A Distributed Firewall using Autonomous Agents. DepCoS-RELCOMEX 2006: 256-263

Mahat Khelfallah, Belaid Benhamou: A Local Fusion Method of Temporal Information. ECSQARU 2005: 477-488

Mahat Khelfallah, Belaid Benhamou: A Local Method for Prioritized Fusion of Temporal Information. TIME 2005: 35-43

Mahat Khelfallah, Belaid Benhamou: Two Revision Methods Based on Constraints: Application to a Flooding Problem. AISC 2004: 265-270

Mahat Khelfallah, Belaid Benhamou: Geographic Information Revision Based on Constraints. ECAI 2004: 828-832

Gilles Audemard, Belaid Benhamou: Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002: 226-240

Jacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, Volker Sorge (Eds.): Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings. Lecture Notes in Computer Science 2385, Springer 2002, isbn 3-540-43865-3

Gilles Audemard, Belaid Benhamou: Etude des symétries dans les modèles finis. JFPLC 2001: 109-122

Gilles Audemard, Belaid Benhamou, Laurent Henocque: Two Techniques to Improve Finite Model Search. CADE 2000: 302-308

Gilles Audemard, Belaid Benhamou, Pierre Siegel: AVAL: An Enumerative Method for SAT. Computational Logic 2000: 373-383

Belaid Benhamou, Laurent Henocque: A Hybrid Method for Finite Model Search in Equational Theories. Fundam. Inform. 39(1-2): 21-38 (1999)

Belaid Benhamou, Amar Isli: Study of Symmetry in Qualitative Temporal Interval Networks. AIMSA 1998: 88-101

Belaid Benhamou, Laurent Henocque: Finite Model Search for Equational Theories (FMSET). AISC 1998: 84-93

Belaid Benhamou, Lakhdar Sais: Tractability Through Symmetries in Propositional Calculus. J. Autom. Reasoning 12(1): 89-102 (1994)

Belaid Benhamou, Lakhdar Sais, Pierre Siegel: Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS 1994: 71-82

Belaid Benhamou, Lakhdar Sais: Theoretical Study of Symmetries in Propositional Calculus and Applications. CADE 1992: 281-294