Towards Cross-fertilization Between Propositional Satisfiability and Data Mining

Опубликовано 13 июня 2016, 20:24

In this talk, we overview our contribution to data mining and more generally to the cross-fertilization between data mining and propositional satisfiability (cril.univ-artois.fr/decMining/... We will focus on two contributions. First, we show how propositional satisfiability can be used to model and solve problems in data mining. As an illustration, we present a SAT-based declarative approach for enumerating top-k (closed, frequent) itemsets in transactional databases. Secondly, we discuss the potential contribution of data mining to propositional satisfiability. In this context, we present a first application of data mining to compress Boolean formulas conjunctive normal form.