4 citations · 14 across the 10 of their papers we have counts for
Showing 2013 · cs.AIShow all
3 papers · 2 filters
cs.AI2013★ 2 cited
A Mining-Based Compression Approach for Constraint Satisfaction Problems
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our…
cs.AI2013★ 1 cited
Extending Modern SAT Solvers for Enumerating All Models
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF). We propose an extension of CDCL-based SAT solvers to deal wit…
cs.AI2013
Mining to Compact CNF Propositional Formulae
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed Mining4SAT approach aims to discover and to exploit hidden str…