Belaid Benhamou - researchr alias

researchr

You are not signed in
Sign in
Sign up

2010

Enhancing Clause Learning by Symmetry in SAT SolversBelaid Benhamou, Tarek Nabhani, Richard Ostrowski, Mohamed Réda Saïdi. ictai 2010: 329-335 [doi]

Local Search Methods for the Optimal Winner Determination Problem in Combinatorial AuctionsDalila Boughaci, Belaid Benhamou, Habiba Drias. jmma, 9(2):165-180, 2010. [doi]

2009

A memetic algorithm for the optimal winner determination problemDalila Boughaci, Belaid Benhamou, Habiba Drias. soco, 13(8-9):905-917, 2009. [doi]

2008

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

Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial AuctionsDalila Boughaci, Belaid Benhamou, Habiba Drias. cp 2008: 593-597 [doi]

Scatter Search and Genetic Algorithms for MAX-SAT ProblemsDalila Boughaci, Belaid Benhamou, Habiba Drias. jmma, 7(2):101-124, 2008. [doi]

2007

2006

2005

A Local Fusion Method of Temporal InformationMahat Khelfallah, Belaid Benhamou. ecsqaru 2005: 477-488 [doi]

A Local Method for Prioritized Fusion of Temporal InformationMahat Khelfallah, Belaid Benhamou. time 2005: 35-43 [doi]

2004

Two Revision Methods Based on Constraints: Application to a Flooding ProblemMahat Khelfallah, Belaid Benhamou. AISC 2004: 265-270 [doi]

Geographic Information Revision Based on ConstraintsMahat Khelfallah, Belaid Benhamou. ecai 2004: 828-832

2002

Reasoning by Symmetry and Function Ordering in Finite Model GenerationGilles Audemard, Belaid Benhamou. cade 2002: 226-240 [doi]

Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, ProceedingsJacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, Volker Sorge, editors, Volume 2385 of Lecture Notes in Computer Science, Springer, 2002.

2001

Etude des symétries dans les modèles finisGilles Audemard, Belaid Benhamou. jfplc 2001: 109-122

2000

AVAL: An Enumerative Method for SATGilles Audemard, Belaid Benhamou, Pierre Siegel. cl 2000: 373-383 [doi]

Two Techniques to Improve Finite Model SearchGilles Audemard, Belaid Benhamou, Laurent Henocque. cade 2000: 302-308

1999

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

1998

Study of Symmetry in Qualitative Temporal Interval NetworksBelaid Benhamou, Amar Isli. aimsa 1998: 88-101 [doi]

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

1994

Tractability Through Symmetries in Propositional CalculusBelaid Benhamou, Lakhdar Sais. JAR, 12(1):89-102, 1994.

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

1992

Theoretical Study of Symmetries in Propositional Calculus and ApplicationsBelaid Benhamou, Lakhdar Sais. cade 1992: 281-294