| 2008 |
|---|
| 27 | | Belaid Benhamou,
Mohamed Réda Saïdi:
A New Incomplete Method for CSP Inconsistency Checking.
AAAI 2008: 229-234 |
| 26 | EE | Dalila Boughaci,
Belaid Benhamou,
Habiba Drias:
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions.
CP 2008: 593-597 |
| 2007 |
|---|
| 25 | EE | Belaid Benhamou,
Mohamed Réda Saïdi:
Local Symmetry Breaking During Search in CSPs.
CP 2007: 195-209 |
| 24 | EE | Djamal Habet,
Lionel Paris,
Belaid Benhamou:
Consistent Neighborhood for the Satisfiability Problem.
ICTAI (2) 2007: 497-501 |
| 23 | | Dalila Boughaci,
Belaid Benhamou,
Habiba Drias:
IGA: an Improved Genetic Algorithm for MAX-SAT Problems.
IICAI 2007: 132-150 |
| 22 | | Belaid Benhamou,
Mohamed Réda Saïdi:
Detecting and Eliminating Local Symmetry During Search in CSPs.
IICAI 2007: 151-166 |
| 21 | | Mahat Khelfallah,
Belaid Benhamou:
Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency.
IICAI 2007: 167-179 |
| 2006 |
|---|
| 20 | EE | Lionel Paris,
Belaid Benhamou,
Pierre Siegel:
A Boolean Encoding Including SAT and n-ary CSPs.
AIMSA 2006: 33-44 |
| 19 | EE | Belaid Benhamou,
Mohamed Réda Saïdi:
Reasoning by Dominance in Not-Equals Binary Constraint Networks.
CP 2006: 670-674 |
| 18 | EE | 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 |
| 17 | EE | Dalila Boughaci,
Habiba Drias,
Brahim Oubeka,
Abdelkader Aissioui,
Belaid Benhamou:
A Distributed Firewall using Autonomous Agents.
DepCoS-RELCOMEX 2006: 256-263 |
| 16 | EE | Gilles Audemard,
Belaid Benhamou,
Laurent Henocque:
Predicting and Detecting Symmetries in FOL Finite Model Search.
J. Autom. Reasoning 36(3): 177-212 (2006) |
| 2005 |
|---|
| 15 | EE | Mahat Khelfallah,
Belaid Benhamou:
A Local Fusion Method of Temporal Information.
ECSQARU 2005: 477-488 |
| 14 | EE | Mahat Khelfallah,
Belaid Benhamou:
A Local Method for Prioritized Fusion of Temporal Information.
TIME 2005: 35-43 |
| 2004 |
|---|
| 13 | EE | Mahat Khelfallah,
Belaid Benhamou:
Two Revision Methods Based on Constraints: Application to a Flooding Problem.
AISC 2004: 265-270 |
| 12 | | Mahat Khelfallah,
Belaid Benhamou:
Geographic Information Revision Based on Constraints.
ECAI 2004: 828-832 |
| 2002 |
|---|
| 11 | | Jacques Calmet,
Belaid Benhamou,
Olga Caprotti,
Laurent Henocque,
Volker Sorge:
Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings
Springer 2002 |
| 10 | EE | Gilles Audemard,
Belaid Benhamou:
Reasoning by Symmetry and Function Ordering in Finite Model Generation.
CADE 2002: 226-240 |
| 2001 |
|---|
| 9 | | Gilles Audemard,
Belaid Benhamou:
Etude des symétries dans les modèles finis.
JFPLC 2001: 109-122 |
| 2000 |
|---|
| 8 | | Gilles Audemard,
Belaid Benhamou,
Laurent Henocque:
Two Techniques to Improve Finite Model Search.
CADE 2000: 302-308 |
| 7 | EE | Gilles Audemard,
Belaid Benhamou,
Pierre Siegel:
AVAL: An Enumerative Method for SAT.
Computational Logic 2000: 373-383 |
| 1999 |
|---|
| 6 | | Belaid Benhamou,
Laurent Henocque:
A Hybrid Method for Finite Model Search in Equational Theories.
Fundam. Inform. 39(1-2): 21-38 (1999) |
| 1998 |
|---|
| 5 | EE | Belaid Benhamou,
Amar Isli:
Study of Symmetry in Qualitative Temporal Interval Networks.
AIMSA 1998: 88-101 |
| 4 | EE | Belaid Benhamou,
Laurent Henocque:
Finite Model Search for Equational Theories (FMSET).
AISC 1998: 84-93 |
| 1994 |
|---|
| 3 | | Belaid Benhamou,
Lakhdar Sais,
Pierre Siegel:
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus.
STACS 1994: 71-82 |
| 2 | | Belaid Benhamou,
Lakhdar Sais:
Tractability Through Symmetries in Propositional Calculus.
J. Autom. Reasoning 12(1): 89-102 (1994) |
| 1992 |
|---|
| 1 | | Belaid Benhamou,
Lakhdar Sais:
Theoretical Study of Symmetries in Propositional Calculus and Applications.
CADE 1992: 281-294 |
