no code implementations • 31 Mar 2018 • Abdelhamid Boudane, Said Jabbour, Badran Raddaoui, Lakhdar Sais
In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively.
no code implementations • 8 Jun 2015 • Said Jabbour, Lakhdar Sais, Yakoub Salhi
We then conduct an experimental evaluation on SAT-Based itemset mining instances to show how SAT solvers can be adapted to obtain an efficient SAT model enumerator.
no code implementations • 1 Jun 2014 • Said Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi
One particular MUS-decomposition, named distributable MUS-decomposition leads to an interesting partition of inconsistencies in a knowledge base such that multiple experts can check inconsistencies in parallel, which is impossible under existing measures.
no code implementations • 9 Feb 2014 • Said Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi
In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies.
no code implementations • 14 May 2013 • Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP).
no code implementations • 2 May 2013 • 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).
no code implementations • 16 Apr 2013 • Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose a first application of data mining techniques to propositional satisfiability.