Belaid Benhamou - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 59 from 59

2024

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set ProgrammingGiang V. Trinh, Belaid Benhamou, Samuel Pastva, Sylvain Soliman. AAAI 2024: 10714-10722 [doi]

2023

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cellsTarek Khaled, Belaid Benhamou, Van-Giang Trinh. AMAI, 91(5):713-750, October 2023. [doi]

Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human OperatorsMeriem Touat, Belaid Benhamou. icnsc 2023: 1-6 [doi]

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set ProgrammingVan-Giang Trinh, Belaid Benhamou, Sylvain Soliman. cp 2023: [doi]

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encodingVan-Giang Trinh, Belaid Benhamou, Sylvain Soliman. TCS, 971:114073, September 2023. [doi]

Trap spaces of multi-valued networks: definition, computation, and applicationsVan-Giang Trinh, Belaid Benhamou, Thomas A. Henzinger, Samuel Pastva. bioinformatics, 39(Supplement-1):513-522, 2023. [doi]

2022

Evolutionary Iterated Local Search meta-heuristic for the antenna positioning problem in cellular networksLarbi Benmezal, Belaid Benhamou, Dalila Boughaci. ci, 38(3):1183-1214, 2022. [doi]

A synergy Thompson sampling hyper-heuristic for the feature selection problemMourad Lassouaoui, Dalila Boughaci, Belaid Benhamou. ci, 38(3):1083-1105, 2022. [doi]

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraintsMeriem Touat, Fatima Benbouzid-Si Tayeb, Belaid Benhamou. ijmr, 17(1):22-58, 2022. [doi]

A Constraint Programming Model for the Scheduling Problem with Flexible Maintenance under Human Resource ConstraintsMeriem Touat, Belaid Benhamou, Fatima Benbouzid-Si Tayeb. icaart 2022: 195-202

Computing attractors of large-scale asynchronous boolean networks using minimal trap spacesVan-Giang Trinh, Kunihiko Hiraishi, Belaid Benhamou. bcb 2022: [doi]

Minimal Trap Spaces of Logical Models are Maximal Siphons of Their Petri Net EncodingVan-Giang Trinh, Belaid Benhamou, Kunihiko Hiraishi, Sylvain Soliman. cmsb 2022: 158-176 [doi]

2020

Dealing with Biology Systems in the Framework of Answer Set ProgrammingTarek Khaled, Belaid Benhamou. kes 2020: 450-459 [doi]

An ASP-based Approach for Boolean Networks Representation and Attractor DetectionTarek Khaled, Belaid Benhamou. lpar 2020: 317-333 [doi]

2019

2018

2017

Some Neighbourhood Approaches for the Antenna Positioning ProblemLarbi Benmezal, Belaid Benhamou, Dalila Boughaci. ictai 2017: 1001-1007 [doi]

Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment ProblemYasmine Lahsinat, Dalila Boughaci, Belaid Benhamou. ichsa 2017: 179-189 [doi]

A multilevel hyper-heuristic for solving Max-SATMourad Lassouaoui, Dalila Boughaci, Belaid Benhamou. ijmheur, 6(3):133-159, 2017. [doi]

A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraintsMeriem Touat, Sabrina Bouzidi-Hassini, Fatima Benbouzid-Sitayeb, Belaid Benhamou. asc, 59:556-573, 2017. [doi]

A Fuzzy Genetic Algorithm for Single-Machine Scheduling and Flexible Maintenance Planning Integration under Human Resource ConstraintsMeriem Touat, Fatima Benbouzid-Si Tayeb, Sabrina Bouzidi-Hassini, Belaid Benhamou. ictai 2017: 551-558 [doi]

2013

Dynamic and Static Symmetry Breaking in Answer Set ProgrammingBelaid Benhamou. lpar 2013: 112-126 [doi]

2012

A New Semantics for Logic Programs Capturing and Extending the Stable Model SemanticsBelaid Benhamou, Pierre Siegel. ictai 2012: 572-579 [doi]

Dealing with Satisfiability and n-ary CSPs in a Logical FrameworkBelaid Benhamou, Lionel Paris, Pierre Siegel. JAR, 48(3):391-417, 2012. [doi]

2010

Enhancing Clause Learning by Symmetry in SAT SolversBelaid Benhamou, Tarek Nabhani, Richard Ostrowski, Mohamed Réda Saïdi. ictai 2010: 329-335 [doi]

Local Search Methods for the Optimal Winner Determination Problem in Combinatorial AuctionsDalila Boughaci, Belaid Benhamou, Habiba Drias. jmma, 9(2):165-180, 2010. [doi]

2009

A memetic algorithm for the optimal winner determination problemDalila Boughaci, Belaid Benhamou, Habiba Drias. soco, 13(8-9):905-917, 2009. [doi]

2008

A New Incomplete Method for CSP Inconsistency CheckingBelaid Benhamou, Mohamed Réda Saïdi. AAAI 2008: 229-234

Scatter Search and Genetic Algorithms for MAX-SAT ProblemsDalila Boughaci, Belaid Benhamou, Habiba Drias. jmma, 7(2):101-124, 2008. [doi]

Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial AuctionsDalila Boughaci, Belaid Benhamou, Habiba Drias. cp 2008: 593-597 [doi]

2007

2006

2005

A Local Fusion Method of Temporal InformationMahat Khelfallah, Belaid Benhamou. ecsqaru 2005: 477-488 [doi]

A Local Method for Prioritized Fusion of Temporal InformationMahat Khelfallah, Belaid Benhamou. time 2005: 35-43 [doi]

2004

Geographic Information Revision Based on ConstraintsMahat Khelfallah, Belaid Benhamou. ecai 2004: 828-832

Two Revision Methods Based on Constraints: Application to a Flooding ProblemMahat Khelfallah, Belaid Benhamou. AISC 2004: 265-270 [doi]

2002

Reasoning by Symmetry and Function Ordering in Finite Model GenerationGilles Audemard, Belaid Benhamou. cade 2002: 226-240 [doi]

2001

Etude des symétries dans les modèles finisGilles Audemard, Belaid Benhamou. jfplc 2001: 109-122

2000

Two Techniques to Improve Finite Model SearchGilles Audemard, Belaid Benhamou, Laurent Henocque. cade 2000: 302-308

AVAL: An Enumerative Method for SATGilles Audemard, Belaid Benhamou, Pierre Siegel. cl 2000: 373-383 [doi]

1999

A Hybrid Method for Finite Model Search in Equational TheoriesBelaid Benhamou, Laurent Henocque. FUIN, 39(1-2):21-38, 1999.

1998

Study of Symmetry in Qualitative Temporal Interval NetworksBelaid Benhamou, Amar Isli. aimsa 1998: 88-101 [doi]

Finite Model Search for Equational Theories (FMSET)Belaid Benhamou, Laurent Henocque. AISC 1998: 84-93 [doi]

1994

Two Proof Procedures for a Cardinality Based Language in Propositional CalculusBelaid Benhamou, Lakhdar Sais, Pierre Siegel. STACS 1994: 71-82

Tractability Through Symmetries in Propositional CalculusBelaid Benhamou, Lakhdar Sais. JAR, 12(1):89-102, 1994.

1992

Theoretical Study of Symmetries in Propositional Calculus and ApplicationsBelaid Benhamou, Lakhdar Sais. cade 1992: 281-294

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Belaid Benhamou'

Viewing Publication 1 - 59 from 59

2024

2023

2022

2020

2019

2018

2017

2013

2012

2010

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1998

1994

1992

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Belaid Benhamou'

Viewing Publication 1 - 59 from 59

2024

2023

2022

2020

2019

2018

2017

2013

2012

2010

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1998

1994

1992

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1