|
Search the dblp DataBase
Belaid Benhamou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Belaid Benhamou, Amar Isli
Study of Symmetry in Qualitative Temporal Interval Networks. [Citation Graph (0, 0)][DBLP] AIMSA, 1998, pp:88-101 [Conf]
- Lionel Paris, Belaid Benhamou, Pierre Siegel
A Boolean Encoding Including SAT and n-ary CSPs. [Citation Graph (0, 0)][DBLP] AIMSA, 2006, pp:33-44 [Conf]
- Belaid Benhamou, Laurent Henocque
Finite Model Search for Equational Theories (FMSET). [Citation Graph (0, 0)][DBLP] AISC, 1998, pp:84-93 [Conf]
- Mahat Khelfallah, Belaid Benhamou
Two Revision Methods Based on Constraints: Application to a Flooding Problem. [Citation Graph (0, 0)][DBLP] AISC, 2004, pp:265-270 [Conf]
- Gilles Audemard, Belaid Benhamou
Reasoning by Symmetry and Function Ordering in Finite Model Generation. [Citation Graph (0, 0)][DBLP] CADE, 2002, pp:226-240 [Conf]
- Gilles Audemard, Belaid Benhamou, Laurent Henocque
Two Techniques to Improve Finite Model Search. [Citation Graph (0, 0)][DBLP] CADE, 2000, pp:302-308 [Conf]
- Belaid Benhamou, Lakhdar Sais
Theoretical Study of Symmetries in Propositional Calculus and Applications. [Citation Graph (0, 0)][DBLP] CADE, 1992, pp:281-294 [Conf]
- Gilles Audemard, Belaid Benhamou, Pierre Siegel
AVAL: An Enumerative Method for SAT. [Citation Graph (0, 0)][DBLP] Computational Logic, 2000, pp:373-383 [Conf]
- Belaid Benhamou, Mohamed Réda Saïdi
Reasoning by Dominance in Not-Equals Binary Constraint Networks. [Citation Graph (0, 0)][DBLP] CP, 2006, pp:670-674 [Conf]
- Dalila Boughaci, Habiba Drias, Ahmed Bendib, Youcef Bouznit, Belaid Benhamou
Distributed Intrusion Detection Framework based on Autonomous and Mobile Agents. [Citation Graph (0, 0)][DBLP] DepCoS-RELCOMEX, 2006, pp:248-255 [Conf]
- Dalila Boughaci, Habiba Drias, Brahim Oubeka, Abdelkader Aissioui, Belaid Benhamou
A Distributed Firewall using Autonomous Agents. [Citation Graph (0, 0)][DBLP] DepCoS-RELCOMEX, 2006, pp:256-263 [Conf]
- Mahat Khelfallah, Belaid Benhamou
Geographic Information Revision Based on Constraints. [Citation Graph (0, 0)][DBLP] ECAI, 2004, pp:828-832 [Conf]
- Mahat Khelfallah, Belaid Benhamou
A Local Fusion Method of Temporal Information. [Citation Graph (0, 0)][DBLP] ECSQARU, 2005, pp:477-488 [Conf]
- Gilles Audemard, Belaid Benhamou
Etude des symétries dans les modèles finis. [Citation Graph (0, 0)][DBLP] JFPLC, 2001, pp:109-122 [Conf]
- Belaid Benhamou, Lakhdar Sais, Pierre Siegel
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. [Citation Graph (0, 0)][DBLP] STACS, 1994, pp:71-82 [Conf]
- Mahat Khelfallah, Belaid Benhamou
A Local Method for Prioritized Fusion of Temporal Information. [Citation Graph (0, 0)][DBLP] TIME, 2005, pp:35-43 [Conf]
- Belaid Benhamou, Laurent Henocque
A Hybrid Method for Finite Model Search in Equational Theories. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1999, v:39, n:1-2, pp:21-38 [Journal]
- Belaid Benhamou, Lakhdar Sais
Tractability Through Symmetries in Propositional Calculus. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1994, v:12, n:1, pp:89-102 [Journal]
- Gilles Audemard, Belaid Benhamou, Laurent Henocque
Predicting and Detecting Symmetries in FOL Finite Model Search. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2006, v:36, n:3, pp:177-212 [Journal]
- Belaid Benhamou, Mohamed Réda Saïdi
Local Symmetry Breaking During Search in CSPs. [Citation Graph (0, 0)][DBLP] CP, 2007, pp:195-209 [Conf]
A New Incomplete Method for CSP Inconsistency Checking. [Citation Graph (, )][DBLP]
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. [Citation Graph (, )][DBLP]
Consistent Neighborhood for the Satisfiability Problem. [Citation Graph (, )][DBLP]
Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency. [Citation Graph (, )][DBLP]
Detecting and Eliminating Local Symmetry During Search in CSPs. [Citation Graph (, )][DBLP]
IGA: an Improved Genetic Algorithm for MAX-SAT Problems. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
|