The following pages link to Saïd Jabbour (Q427558):
Displaying 18 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- (Q511754) (redirect page) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- SAT-based models for overlapping community detection in networks (Q783048) (← 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)
- (Q2786913) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- (Q3457225) (← links)
- (Q3457246) (← links)
- A Generalized Framework for Conflict Analysis (Q3502689) (← links)
- SAT graph-based representation: A new perspective (Q3527692) (← links)
- (Q3639756) (← links)
- (Q4576226) (← links)
- (Q4576231) (← links)
- Efficient SAT-Based Encodings of Conditional Cardinality Constraints (Q5222954) (← links)
- Measuring Inconsistency through Minimal Proofs (Q5326427) (← links)
