Belaid Benhamou

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 28

Top Topics

Resource Constraints

Answer Set Programming

Boolean Networks

Variable Neighbourhood Search

Top Venues

Comput. Intell.

Publications

Giang V. Trinh, Belaid Benhamou, Samuel Pastva, Sylvain Soliman
Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. AAAI (2024)
Van-Giang Trinh, Belaid Benhamou
Static Analysis of Logic Programs via Boolean Networks. CoRR (2024)
Van-Giang Trinh, Belaid Benhamou, Loïc Paulevé
mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks. CoRR (2024)
Tarek Khaled, Belaid Benhamou, Van-Giang Trinh
Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells. Ann. Math. Artif. Intell. 91 (5) (2023)
Van-Giang Trinh, Belaid Benhamou, Thomas A. Henzinger, Samuel Pastva
Trap spaces of multi-valued networks: definition, computation, and applications. Bioinform. 39 (Supplement-1) (2023)
Meriem Touat, Belaid Benhamou
Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human Operators. ICNSC (2023)
Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. Theor. Comput. Sci. 971 (2023)
Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. CP (2023)
Larbi Benmezal, Belaid Benhamou, Dalila Boughaci
Evolutionary Iterated Local Search meta-heuristic for the antenna positioning problem in cellular networks. Comput. Intell. 38 (3) (2022)
Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou
A synergy Thompson sampling hyper-heuristic for the feature selection problem. Comput. Intell. 38 (3) (2022)
Meriem Touat, Belaid Benhamou, Fatima Benbouzid-Si Tayeb
A Constraint Programming Model for the Scheduling Problem with Flexible Maintenance under Human Resource Constraints. ICAART (3) (2022)
Meriem Touat, Fatima Benbouzid-Si Tayeb, Belaid Benhamou
Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints. Int. J. Manuf. Res. 17 (1) (2022)
Van-Giang Trinh, Belaid Benhamou, Kunihiko Hiraishi, Sylvain Soliman
Minimal Trap Spaces of Logical Models are Maximal Siphons of Their Petri Net Encoding. CMSB (2022)
Van-Giang Trinh, Kunihiko Hiraishi, Belaid Benhamou
Computing attractors of large-scale asynchronous boolean networks using minimal trap spaces. BCB (2022)
Tarek Khaled, Belaid Benhamou
An ASP-based Approach for Boolean Networks Representation and Attractor Detection. LPAR (2020)
Tarek Khaled, Belaid Benhamou
Dealing with Biology Systems in the Framework of Answer Set Programming. KES (2020)
Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou
A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. Intell. Decis. Technol. 13 (2) (2019)
Meriem Touat, Fatima Benbouzid-Si Tayeb, Belaid Benhamou, Lamia Sadeg, Salima Aklil, Meryem Karaoui
An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance. SMC (2019)
Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou
Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks. Int. J. Appl. Metaheuristic Comput. 10 (3) (2019)
Tarek Khaled, Belaid Benhamou
Symmetry breaking in a new stable model search method. LPAR (Workshop and Short Papers) (2018)
Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou
Breakout variable neighbourhood search for the minimum interference frequency assignment problem. J. Syst. Inf. Technol. 20 (4) (2018)
Tarek Khaled, Belaid Benhamou, Pierre Siegel
A New Method for Computing Stable Models in Logic Programming. ICTAI (2018)
Meriem Touat, Fatima Benbouzid Si-Tayeb, Belaid Benhamou
An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints. KES (2018)
Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou
Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment Problem. ICHSA (2017)
Meriem Touat, Sabrina Bouzidi-Hassini, Fatima Benbouzid-Sitayeb, Belaid Benhamou
A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints. Appl. Soft Comput. 59 (2017)
Meriem Touat, Fatima Benbouzid-Si Tayeb, Sabrina Bouzidi-Hassini, Belaid Benhamou
A Fuzzy Genetic Algorithm for Single-Machine Scheduling and Flexible Maintenance Planning Integration under Human Resource Constraints. ICTAI (2017)
Larbi Benmezal, Belaid Benhamou, Dalila Boughaci
Some Neighbourhood Approaches for the Antenna Positioning Problem. ICTAI (2017)
Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou
A multilevel hyper-heuristic for solving Max-SAT. Int. J. Metaheuristics 6 (3) (2017)
Belaid Benhamou
Dynamic and Static Symmetry Breaking in Answer Set Programming. LPAR (2013)
Belaid Benhamou, Lionel Paris, Pierre Siegel
Dealing with Satisfiability and n-ary CSPs in a Logical Framework. J. Autom. Reason. 48 (3) (2012)
Belaid Benhamou, Pierre Siegel
A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics. ICTAI (2012)
Belaid Benhamou, Tarek Nabhani, Richard Ostrowski, Mohamed Réda Saïdi
Enhancing Clause Learning by Symmetry in SAT Solvers. ICTAI (1) (2010)
Dalila Boughaci, Belaid Benhamou, Habiba Drias
Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. J. Math. Model. Algorithms 9 (2) (2010)
Dalila Boughaci, Belaid Benhamou, Habiba Drias
A memetic algorithm for the optimal winner determination problem. Soft Comput. 13 (8-9) (2009)
Dalila Boughaci, Belaid Benhamou, Habiba Drias
Scatter Search and Genetic Algorithms for MAX-SAT Problems. J. Math. Model. Algorithms 7 (2) (2008)
Dalila Boughaci, Belaid Benhamou, Habiba Drias
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. CP (2008)
Belaid Benhamou, Mohamed Réda Saïdi
A New Incomplete Method for CSP Inconsistency Checking. AAAI (2008)
Djamal Habet, Lionel Paris, Belaid Benhamou
Consistent Neighborhood for the Satisfiability Problem. ICTAI (2) (2007)
Belaid Benhamou, Mohamed Réda Saïdi
Local Symmetry Breaking During Search in CSPs. CP (2007)
Belaid Benhamou, Mohamed Réda Saïdi
Detecting and Eliminating Local Symmetry During Search in CSPs. IICAI (2007)
Mahat Khelfallah, Belaid Benhamou
Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency. IICAI (2007)
Dalila Boughaci, Belaid Benhamou, Habiba Drias
IGA: an Improved Genetic Algorithm for MAX-SAT Problems. IICAI (2007)
Gilles Audemard, Belaid Benhamou, Laurent Henocque
Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. 36 (3) (2006)
Belaid Benhamou, Mohamed Réda Saïdi
Reasoning by Dominance in Not-Equals Binary Constraint Networks. CP (2006)
Lionel Paris, Belaid Benhamou, Pierre Siegel
A Boolean Encoding Including SAT and n-ary CSPs. AIMSA (2006)
Dalila Boughaci, Habiba Drias, Brahim Oubeka, Abdelkader Aissioui, Belaid Benhamou
A Distributed Firewall using Autonomous Agents. DepCoS-RELCOMEX (2006)
Dalila Boughaci, Habiba Drias, Ahmed Bendib, Youcef Bouznit, Belaid Benhamou
Distributed Intrusion Detection Framework based on Autonomous and Mobile Agents. DepCoS-RELCOMEX (2006)
Mahat Khelfallah, Belaid Benhamou
A Local Fusion Method of Temporal Information. ECSQARU (2005)
Mahat Khelfallah, Belaid Benhamou
A Local Method for Prioritized Fusion of Temporal Information. TIME (2005)
Mahat Khelfallah, Belaid Benhamou
Geographic Information Revision Based on Constraints. ECAI (2004)
Mahat Khelfallah, Belaid Benhamou
Two Revision Methods Based on Constraints: Application to a Flooding Problem. AISC (2004)
Gilles Audemard, Belaid Benhamou
Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE (2002)
Gilles Audemard, Belaid Benhamou
Etude des symétries dans les modèles finis. JFPLC (2001)
Gilles Audemard, Belaid Benhamou, Pierre Siegel
AVAL: An Enumerative Method for SAT. Computational Logic (2000)
Gilles Audemard, Belaid Benhamou, Laurent Henocque
Two Techniques to Improve Finite Model Search. CADE (2000)
Belaid Benhamou, Laurent Henocque
A Hybrid Method for Finite Model Search in Equational Theories. Fundam. Informaticae 39 (1-2) (1999)
Belaid Benhamou, Laurent Henocque
Finite Model Search for Equational Theories (FMSET). AISC (1998)
Belaid Benhamou, Amar Isli
Study of Symmetry in Qualitative Temporal Interval Networks. AIMSA (1998)
Belaid Benhamou, Lakhdar Sais
Tractability Through Symmetries in Propositional Calculus. J. Autom. Reason. 12 (1) (1994)
Belaid Benhamou, Lakhdar Sais, Pierre Siegel
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS (1994)
Belaid Benhamou, Lakhdar Sais
Theoretical Study of Symmetries in Propositional Calculus and Applications. CADE (1992)