The following pages link to Lakhdar Saïs (Q427559):
Displaying 24 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- (Q511755) (redirect page) (← 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)
- Boosting complete techniques thanks to local search methods (Q1267775) (← links)
- Tractability through symmetries in propositional calculus (Q1332641) (← links)
- Quantifying conflicts in propositional logic through prime implicates (Q1680686) (← links)
- Towards a compact SAT-based encoding of itemset mining tasks (Q2117214) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- (Q2738997) (← links)
- (Q2786913) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- On Freezing and Reactivating Learnt Clauses (Q3007683) (← links)
- (Q3457225) (← links)
- (Q3457246) (← links)
- A Generalized Framework for Conflict Analysis (Q3502689) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Using Boolean Constraint Propagation for Sub-clauses Deduction (Q3524222) (← links)
- SAT graph-based representation: A new perspective (Q3527692) (← links)
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes (Q4645742) (← links)
- Efficient SAT-Based Encodings of Conditional Cardinality Constraints (Q5222954) (← links)
