Ceci est une ancienne révision du document !


SATMiner is a library for searching interesting patterns using constraint programming/SAT backend. It is developed as a prototype for the DAG project, in collaboration with people at CRIL.

It is currently used as a basis for experiments on SAT/pseudo boolean based pattern mining on:

  • sequences
  • attributes sets in relational data (RLT language)

The current version is coded in Java and uses SAT4J and a modified version of MiniSat as backends. It also uses BoolVar/PB for translation of some pseudo-boolean constraints to SAT.


Upcoming …

Involved people

  • Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi: A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. ECAI 2012: 258-263 pdf
  • Emmanuel Coquery, Jean-Marc Petit, Lakhdar Sais: Using SAT and SQL for Pattern Mining in relational databases. First workshop on COmbining COnstraint solving with MIning and LEarning, 2012. pdf
  • Emmanuel Coquery, Saïd Jabbour, Lakhdar Sais: A Constraint Programming Approach for Enumerating Motifs in a Sequence. ICDM Workshops 2011: 1091-1097 (pdf)