Theoretical Study of Symmetries in Propositional Calculus and Applications. - Belaid Benhamou; Lakhdar Sais (CADE, 1992)

Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. - Belaid Benhamou; Lakhdar Sais; Pierre Siegel (STACS, 1994)

Tractability Through Symmetries in Propositional Calculus. - Belaid Benhamou; Lakhdar Sais (J. Autom. Reason., 1994)

Study of Symmetry in Qualitative Temporal Interval Networks. - Belaid Benhamou; Amar Isli (AIMSA, 1998)

Finite Model Search for Equational Theories (FMSET). - Belaid Benhamou; Laurent Henocque (AISC, 1998)

A Hybrid Method for Finite Model Search in Equational Theories. - Belaid Benhamou; Laurent Henocque (Fundam. Informaticae, 1999)

Two Techniques to Improve Finite Model Search. - Gilles Audemard; Belaid Benhamou; Laurent Henocque (CADE, 2000)

AVAL: An Enumerative Method for SAT. - Gilles Audemard; Belaid Benhamou; Pierre Siegel (Computational Logic, 2000)

Etude des symétries dans les modèles finis. - Gilles Audemard; Belaid Benhamou (JFPLC, 2001)

Reasoning by Symmetry and Function Ordering in Finite Model Generation. - Gilles Audemard; Belaid Benhamou (CADE, 2002)

Two Revision Methods Based on Constraints: Application to a Flooding Problem. - Mahat Khelfallah; Belaid Benhamou (AISC, 2004)

Geographic Information Revision Based on Constraints. - Mahat Khelfallah; Belaid Benhamou (ECAI, 2004)

A Local Fusion Method of Temporal Information. - Mahat Khelfallah; Belaid Benhamou (ECSQARU, 2005)

A Local Method for Prioritized Fusion of Temporal Information. - Mahat Khelfallah; Belaid Benhamou (TIME, 2005)

A Boolean Encoding Including SAT and n-ary CSPs. - Lionel Paris; Belaid Benhamou; Pierre Siegel (AIMSA, 2006)

Reasoning by Dominance in Not-Equals Binary Constraint Networks. - Belaid Benhamou; Mohamed Réda Saïdi (CP, 2006)

Distributed Intrusion Detection Framework based on Autonomous and Mobile Agents. - Dalila Boughaci; Habiba Drias; Ahmed Bendib; Youcef Bouznit; Belaid Benhamou (DepCoS-RELCOMEX, 2006)

A Distributed Firewall using Autonomous Agents. - Dalila Boughaci; Habiba Drias; Brahim Oubeka; Abdelkader Aissioui; Belaid Benhamou (DepCoS-RELCOMEX, 2006)

Predicting and Detecting Symmetries in FOL Finite Model Search. - Gilles Audemard; Belaid Benhamou; Laurent Henocque (J. Autom. Reason., 2006)

Local Symmetry Breaking During Search in CSPs. - Belaid Benhamou; Mohamed Réda Saïdi (CP, 2007)

Consistent Neighborhood for the Satisfiability Problem. - Djamal Habet; Lionel Paris; Belaid Benhamou (ICTAI (2), 2007)

Detecting and Eliminating Local Symmetry During Search in CSPs. - Belaid Benhamou; Mohamed Réda Saïdi (IICAI, 2007)

IGA: an Improved Genetic Algorithm for MAX-SAT Problems. - Dalila Boughaci; Belaid Benhamou; Habiba Drias (IICAI, 2007)

Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency. - Mahat Khelfallah; Belaid Benhamou (IICAI, 2007)

A New Incomplete Method for CSP Inconsistency Checking. - Belaid Benhamou; Mohamed Réda Saïdi (AAAI, 2008)

Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. - Dalila Boughaci; Belaid Benhamou; Habiba Drias (CP, 2008)

Scatter Search and Genetic Algorithms for MAX-SAT Problems. - Dalila Boughaci; Belaid Benhamou; Habiba Drias (J. Math. Model. Algorithms, 2008)

A memetic algorithm for the optimal winner determination problem. - Dalila Boughaci; Belaid Benhamou; Habiba Drias (Soft Comput., 2009)

Enhancing Clause Learning by Symmetry in SAT Solvers. - Belaid Benhamou; Tarek Nabhani; Richard Ostrowski; Mohamed Réda Saïdi (ICTAI (1), 2010)

Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. - Dalila Boughaci; Belaid Benhamou; Habiba Drias (J. Math. Model. Algorithms, 2010)

A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics. - Belaid Benhamou; Pierre Siegel (ICTAI, 2012)

Dealing with Satisfiability and n-ary CSPs in a Logical Framework. - Belaid Benhamou; Lionel Paris; Pierre Siegel (J. Autom. Reason., 2012)

Dynamic and Static Symmetry Breaking in Answer Set Programming. - Belaid Benhamou (LPAR, 2013)

Dynamic Symmetry Breaking in Itemset Mining. - Belaïd Benhamou (AISC, 2014)

Symmetry Breaking in Itemset Mining. - Belaïd Benhamou; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (KDIR, 2014)

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining. - Belaïd Benhamou; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (IC3K (Selected Papers), 2014)

Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment Problem. - Yasmine Lahsinat; Dalila Boughaci; Belaid Benhamou (ICHSA, 2017)

Some Neighbourhood Approaches for the Antenna Positioning Problem. - Larbi Benmezal; Belaid Benhamou; Dalila Boughaci (ICTAI, 2017)

A Fuzzy Genetic Algorithm for Single-Machine Scheduling and Flexible Maintenance Planning Integration under Human Resource Constraints. - Meriem Touat; Fatima Benbouzid-Si Tayeb; Sabrina Bouzidi-Hassini; Belaid Benhamou (ICTAI, 2017)

Local and global symmetry breaking in itemset mining. - Belaïd Benhamou (Ann. Math. Artif. Intell., 2017)

A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints. - Meriem Touat; Sabrina Bouzidi-Hassini; Fatima Benbouzid-Sitayeb; Belaid Benhamou (Appl. Soft Comput., 2017)

A multilevel hyper-heuristic for solving Max-SAT. - Mourad Lassouaoui; Dalila Boughaci; Belaid Benhamou (Int. J. Metaheuristics, 2017)

A New Method for Computing Stable Models in Logic Programming. - Tarek Khaled; Belaid Benhamou; Pierre Siegel (ICTAI, 2018)

An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints. - Meriem Touat; Fatima Benbouzid Si-Tayeb; Belaid Benhamou (KES, 2018)

Symmetry breaking in a new stable model search method. - Tarek Khaled; Belaid Benhamou (LPAR (Workshop and Short Papers), 2018)

Breakout variable neighbourhood search for the minimum interference frequency assignment problem. - Yasmine Lahsinat; Dalila Boughaci; Belaid Benhamou (J. Syst. Inf. Technol., 2018)

An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance. - Meriem Touat; Fatima Benbouzid-Si Tayeb; Belaid Benhamou; Lamia Sadeg; Salima Aklil; Meryem Karaoui (SMC, 2019)

An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks. - Tarek Khaled; Belaïd Benhamou (ICLP Technical Communications, 2019)

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. - Mourad Lassouaoui; Dalila Boughaci; Belaid Benhamou (Intell. Decis. Technol., 2019)

Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks. - Yasmine Lahsinat; Dalila Boughaci; Belaid Benhamou (Int. J. Appl. Metaheuristic Comput., 2019)

Dealing with Biology Systems in the Framework of Answer Set Programming. - Tarek Khaled; Belaid Benhamou (KES, 2020)

An ASP-based Approach for Boolean Networks Representation and Attractor Detection. - Tarek Khaled; Belaid Benhamou (LPAR, 2020)

Computing attractors of large-scale asynchronous boolean networks using minimal trap spaces. - Van-Giang Trinh; Kunihiko Hiraishi; Belaid Benhamou (BCB, 2022)

Minimal Trap Spaces of Logical Models are Maximal Siphons of Their Petri Net Encoding. - Van-Giang Trinh; Belaid Benhamou; Kunihiko Hiraishi; Sylvain Soliman (CMSB, 2022)

A Constraint Programming Model for the Scheduling Problem with Flexible Maintenance under Human Resource Constraints. - Meriem Touat; Belaid Benhamou; Fatima Benbouzid-Si Tayeb (ICAART (3), 2022)

Evolutionary Iterated Local Search meta-heuristic for the antenna positioning problem in cellular networks. - Larbi Benmezal; Belaid Benhamou; Dalila Boughaci (Comput. Intell., 2022)

A synergy Thompson sampling hyper-heuristic for the feature selection problem. - Mourad Lassouaoui; Dalila Boughaci; Belaid Benhamou (Comput. Intell., 2022)

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints. - Meriem Touat; Fatima Benbouzid-Si Tayeb; Belaid Benhamou (Int. J. Manuf. Res., 2022)

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman (CP, 2023)

Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human Operators. - Meriem Touat; Belaid Benhamou (ICNSC, 2023)

Trap spaces of multi-valued networks: definition, computation, and applications. - Van-Giang Trinh; Belaid Benhamou; Thomas A. Henzinger; Samuel Pastva (Bioinform., 2023)

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman (Theor. Comput. Sci., 2023)

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells. - Tarek Khaled; Belaid Benhamou; Van-Giang Trinh (Ann. Math. Artif. Intell., 2023)

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. - Giang V. Trinh; Belaid Benhamou; Samuel Pastva; Sylvain Soliman (AAAI, 2024)

mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks. - Van-Giang Trinh; Belaid Benhamou; Loïc Paulevé (CoRR, 2024)

Static Analysis of Logic Programs via Boolean Networks. - Van-Giang Trinh; Belaid Benhamou (CoRR, 2024)

ASP : un devenir de Prolog. - Belaïd Benhamou; Vincent Risch; Éric Würbel (Rev. Ouverte Intell. Artif., 2024)

Graphical Conditions for the Existence, Unicity and Number of Regular Models. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman; François Fages (ICLP, 2024)

Graphical Analysis of Abstract Argumentation Frameworks via Boolean Networks. - Van-Giang Trinh; Belaid Benhamou; Vincent Risch (ICAART (2), 2025)

On the Boolean Network Theory of Datalog¬. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman; François Fages (CoRR, 2025)