The following pages link to Belaïd Benhamou (Q438579):
Displayed 24 items.
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- Item:Q438579 (redirect page) (← links)
- Tractability through symmetries in propositional calculus (Q1332641) (← links)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
- Local and global symmetry breaking in itemset mining (Q2398272) (← links)
- (Q2723428) (← links)
- (Q2767071) (← links)
- Dynamic and Static Symmetry Breaking in Answer Set Programming (Q2870119) (← links)
- (Q3021904) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Reasoning by Dominance in Not-Equals Binary Constraint Networks (Q3524267) (← links)
- A Boolean Encoding Including SAT and n-ary CSPs (Q3541829) (← links)
- (Q4217950) (← links)
- (Q4264722) (← links)
- (Q4809058) (← links)
- (Q4934139) (← links)
- (Q4942636) (← links)
- (Q5020570) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464710) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5473733) (← links)
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells (Q6059225) (← links)
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)