| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Belaid Benhamou 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 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 Gilles Audemard , Belaid Benhamou: Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002 : 226-240 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 , Pierre Siegel : Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS 1994 : 71-82 Belaid Benhamou, Lakhdar Sais : Tractability Through Symmetries in Propositional Calculus. J. Autom. Reasoning 12 (1): 89-102 (1994) Belaid Benhamou, Lakhdar Sais : Theoretical Study of Symmetries in Propositional Calculus and Applications. CADE 1992 : 281-294 1 [ 16 ] 2 [ 7 ] [ 8 ] [ 9 ] [ 10 ] 3 [ 17 ] 4 [ 16 ] [ 17 ] 5 [ 17 ] 6 [ 11 ] 7 [ 11 ] 8 [ 16 ] [ 17 ] 9 [ 4 ] [ 6 ] [ 8 ] [ 11 ] 10 [ 5 ] 11 [ 12 ] [ 13 ] [ 14 ] [ 15 ] 12 [ 16 ] 13 [ 1 ] [ 2 ] [ 3 ] 14 [ 3 ] [ 7 ] 15 [ 11 ]  ©2006 Association for Computing Machinery |
