default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBelaid Benhamou
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Belaïd Benhamou, Vincent Risch, Éric Würbel:
ASP : un devenir de Prolog. Rev. Ouverte Intell. Artif. 5(2-3): 177-202 (2024)- [c45]Giang V. Trinh, Belaid Benhamou, Samuel Pastva, Sylvain Soliman:
Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. AAAI 2024: 10714-10722 - [i2]Van-Giang Trinh, Belaid Benhamou, Loïc Paulevé:
mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks. CoRR abs/2403.06255 (2024) - [i1]Van-Giang Trinh, Belaid Benhamou:
Static Analysis of Logic Programs via Boolean Networks. CoRR abs/2407.09015 (2024) - 2023
- [j19]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): 713-750 (2023) - [j18]Van-Giang Trinh, Belaid Benhamou, Thomas A. Henzinger, Samuel Pastva:
Trap spaces of multi-valued networks: definition, computation, and applications. Bioinform. 39(Supplement-1): 513-522 (2023) - [j17]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: 114073 (2023) - [c44]Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman:
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. CP 2023: 35:1-35:19 - [c43]Meriem Touat, Belaid Benhamou:
Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human Operators. ICNSC 2023: 1-6 - 2022
- [j16]Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou:
A synergy Thompson sampling hyper-heuristic for the feature selection problem. Comput. Intell. 38(3): 1083-1105 (2022) - [j15]Larbi Benmezal, Belaid Benhamou, Dalila Boughaci:
Evolutionary Iterated Local Search meta-heuristic for the antenna positioning problem in cellular networks. Comput. Intell. 38(3): 1183-1214 (2022) - [j14]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): 22-58 (2022) - [c42]Van-Giang Trinh, Kunihiko Hiraishi, Belaid Benhamou:
Computing attractors of large-scale asynchronous boolean networks using minimal trap spaces. BCB 2022: 13:1-13:10 - [c41]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: 158-176 - [c40]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: 195-202 - 2020
- [c39]Tarek Khaled, Belaid Benhamou:
Dealing with Biology Systems in the Framework of Answer Set Programming. KES 2020: 450-459 - [c38]Tarek Khaled, Belaid Benhamou:
An ASP-based Approach for Boolean Networks Representation and Attractor Detection. LPAR 2020: 317-333
2010 – 2019
- 2019
- [j13]Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou:
A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. Intell. Decis. Technol. 13(2): 193-210 (2019) - [j12]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): 134-150 (2019) - [c37]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: 3799-3804 - [c36]Tarek Khaled, Belaïd Benhamou:
An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks. ICLP Technical Communications 2019: 295-301 - 2018
- [j11]Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou:
Breakout variable neighbourhood search for the minimum interference frequency assignment problem. J. Syst. Inf. Technol. 20(4): 468-488 (2018) - [c35]Tarek Khaled, Belaid Benhamou, Pierre Siegel:
A New Method for Computing Stable Models in Logic Programming. ICTAI 2018: 800-807 - [c34]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: 1395-1404 - [c33]Tarek Khaled, Belaid Benhamou:
Symmetry breaking in a new stable model search method. LPAR (Workshop and Short Papers) 2018: 58-74 - 2017
- [j10]Belaïd Benhamou:
Local and global symmetry breaking in itemset mining. Ann. Math. Artif. Intell. 80(1): 91-112 (2017) - [j9]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: 556-573 (2017) - [j8]Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou:
A multilevel hyper-heuristic for solving Max-SAT. Int. J. Metaheuristics 6(3): 133-159 (2017) - [c32]Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou:
Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment Problem. ICHSA 2017: 179-189 - [c31]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: 551-558 - [c30]Larbi Benmezal, Belaid Benhamou, Dalila Boughaci:
Some Neighbourhood Approaches for the Antenna Positioning Problem. ICTAI 2017: 1001-1007 - 2014
- [c29]Belaïd Benhamou:
Dynamic Symmetry Breaking in Itemset Mining. AISC 2014: 132-146 - [c28]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Symmetry Breaking in Itemset Mining. KDIR 2014: 86-96 - [c27]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A Generic and Declarative Method for Symmetry Breaking in Itemset Mining. IC3K (Selected Papers) 2014: 143-160 - 2013
- [c26]Belaid Benhamou:
Dynamic and Static Symmetry Breaking in Answer Set Programming. LPAR 2013: 112-126 - 2012
- [j7]Belaid Benhamou, Lionel Paris, Pierre Siegel:
Dealing with Satisfiability and n-ary CSPs in a Logical Framework. J. Autom. Reason. 48(3): 391-417 (2012) - [c25]Belaid Benhamou, Pierre Siegel:
A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics. ICTAI 2012: 572-579 - 2010
- [j6]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. J. Math. Model. Algorithms 9(2): 165-180 (2010) - [c24]Belaid Benhamou, Tarek Nabhani, Richard Ostrowski, Mohamed Réda Saïdi:
Enhancing Clause Learning by Symmetry in SAT Solvers. ICTAI (1) 2010: 329-335
2000 – 2009
- 2009
- [j5]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
A memetic algorithm for the optimal winner determination problem. Soft Comput. 13(8-9): 905-917 (2009) - 2008
- [j4]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Scatter Search and Genetic Algorithms for MAX-SAT Problems. J. Math. Model. Algorithms 7(2): 101-124 (2008) - [c23]Belaid Benhamou, Mohamed Réda Saïdi:
A New Incomplete Method for CSP Inconsistency Checking. AAAI 2008: 229-234 - [c22]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. CP 2008: 593-597 - 2007
- [c21]Belaid Benhamou, Mohamed Réda Saïdi:
Local Symmetry Breaking During Search in CSPs. CP 2007: 195-209 - [c20]Djamal Habet, Lionel Paris, Belaid Benhamou:
Consistent Neighborhood for the Satisfiability Problem. ICTAI (2) 2007: 497-501 - [c19]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
IGA: an Improved Genetic Algorithm for MAX-SAT Problems. IICAI 2007: 132-150 - [c18]Belaid Benhamou, Mohamed Réda Saïdi:
Detecting and Eliminating Local Symmetry During Search in CSPs. IICAI 2007: 151-166 - [c17]Mahat Khelfallah, Belaid Benhamou:
Local Search-based Method for Restoring Disjunctive Temporal Problem Consistency. IICAI 2007: 167-179 - 2006
- [j3]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. 36(3): 177-212 (2006) - [c16]Lionel Paris, Belaid Benhamou, Pierre Siegel:
A Boolean Encoding Including SAT and n-ary CSPs. AIMSA 2006: 33-44 - [c15]Belaid Benhamou, Mohamed Réda Saïdi:
Reasoning by Dominance in Not-Equals Binary Constraint Networks. CP 2006: 670-674 - [c14]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 - [c13]Dalila Boughaci, Habiba Drias, Brahim Oubeka, Abdelkader Aissioui, Belaid Benhamou:
A Distributed Firewall using Autonomous Agents. DepCoS-RELCOMEX 2006: 256-263 - 2005
- [c12]Mahat Khelfallah, Belaid Benhamou:
A Local Fusion Method of Temporal Information. ECSQARU 2005: 477-488 - [c11]Mahat Khelfallah, Belaid Benhamou:
A Local Method for Prioritized Fusion of Temporal Information. TIME 2005: 35-43 - 2004
- [c10]Mahat Khelfallah, Belaid Benhamou:
Two Revision Methods Based on Constraints: Application to a Flooding Problem. AISC 2004: 265-270 - [c9]Mahat Khelfallah, Belaid Benhamou:
Geographic Information Revision Based on Constraints. ECAI 2004: 828-832 - 2002
- [c8]Gilles Audemard, Belaid Benhamou:
Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002: 226-240 - [e1]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. Lecture Notes in Computer Science 2385, Springer 2002, ISBN 3-540-43865-3 [contents] - 2001
- [c7]Gilles Audemard, Belaid Benhamou:
Etude des symétries dans les modèles finis. JFPLC 2001: 109-122 - 2000
- [c6]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Two Techniques to Improve Finite Model Search. CADE 2000: 302-308 - [c5]Gilles Audemard, Belaid Benhamou, Pierre Siegel:
AVAL: An Enumerative Method for SAT. Computational Logic 2000: 373-383
1990 – 1999
- 1999
- [j2]Belaid Benhamou, Laurent Henocque:
A Hybrid Method for Finite Model Search in Equational Theories. Fundam. Informaticae 39(1-2): 21-38 (1999) - 1998
- [c4]Belaid Benhamou, Amar Isli:
Study of Symmetry in Qualitative Temporal Interval Networks. AIMSA 1998: 88-101 - [c3]Belaid Benhamou, Laurent Henocque:
Finite Model Search for Equational Theories (FMSET). AISC 1998: 84-93 - 1994
- [j1]Belaid Benhamou, Lakhdar Sais:
Tractability Through Symmetries in Propositional Calculus. J. Autom. Reason. 12(1): 89-102 (1994) - [c2]Belaid Benhamou, Lakhdar Sais, Pierre Siegel:
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS 1994: 71-82 - 1992
- [c1]Belaid Benhamou, Lakhdar Sais:
Theoretical Study of Symmetries in Propositional Calculus and Applications. CADE 1992: 281-294
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
