4 citations · 14 across the 10 of their papers we have counts for
11 papers
Extracting Frequent Gradual Patterns Using Constraints Modeling
Jerry Lonlac, Saïdd Jabbour, Engelbert Mephu Nguifo +2
In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach…
Efficient Encodings of Conditional Cardinality Constraints
Abdelhamid Boudane, Said Jabbour, Badran Raddaoui +1
In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several effi…
On SAT Models Enumeration in Itemset Mining
Said Jabbour, Lakhdar Sais, Yakoub Salhi
Frequent itemset mining is an essential part of data analysis and data mining. Recent works propose interesting SAT-based encodings for the problem of discovering frequent itemsets…
On the measure of conflicts: A MUS-Decomposition Based Framework
Said Jabbour, Yue Ma, Badran Raddaoui +2
Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining s…
Revisiting the Learned Clauses Database Reduction Strategies
Said Jabbour, Jerry Lonlac, Lakhdar Sais +1
In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple obser…
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…