Belaid Benhamou

66 papers A* 2A 9B 11C 2Misc 5Journal 21Unranked 16

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