The following pages link to Lakhdar Saïs (Q427559):
Displaying 7 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- SAT-based models for overlapping community detection in networks (Q783048) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Quantifying conflicts in propositional logic through prime implicates (Q1680686) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900329) (← links)
