The Internet Archive has a preservation copy of this work in our general collections.
The file type is
A new stream of research was born in the last decade with the goal of mining itemsets of interest using Constraint Programming (CP). This has promoted a natural way to combine complex constraints in a highly flexible manner. Although CP state-of-the-art solutions formulate the task using Boolean variables, the few attempts to adopt propositional Satisfiability (SAT) provided an unsatisfactory performance. This work deepens the study on when and how to use SAT for the frequent itemset miningarXiv:1207.6253v1 fatcat:s5a3igmhtzb67cmiber6wqmge4