Belaïd Benhamou

Available identifiers

zbMath Open benhamou.belaidMaRDI QIDQ438579

List of research outcomes

Publication	Date of Publication	Type
Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells	2023-11-02	Paper
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding	2023-08-18	Paper
Minimal trap spaces of logical models are maximal siphons of their Petri net encoding	2023-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q5020570	2022-01-06	Paper
Local and global symmetry breaking in itemset mining	2017-08-15	Paper
Dynamic and static symmetry breaking in answer set programming	2014-01-17	Paper
Dealing with satisfiability and \(n\)-ary CSPs in a logical framework	2012-07-31	Paper
A Boolean Encoding Including SAT and n-ary CSPs	2008-11-27	Paper
Reasoning by Dominance in Not-Equals Binary Constraint Networks	2008-09-09	Paper
Local Symmetry Breaking During Search in CSPs	2008-09-02	Paper
Scatter search and genetic algorithms for MAX-SAT problems	2008-06-11	Paper
Predicting and detecting symmetries in FOL finite model search	2007-01-30	Paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty	2006-06-23	Paper
Artificial Intelligence and Symbolic Computation	2005-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q3021904	2005-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4809058	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q2767071	2002-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q2723428	2001-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q4942636	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4934139	2000-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4264722	1999-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4217950	1998-11-11	Paper
Tractability through symmetries in propositional calculus	1994-08-31	Paper

Research outcomes over time

This page was built for person: Belaïd Benhamou