Comparison between two declarative approaches to solve the problem of Pattern Mining in Sequences

Abstract

Declarative approaches to solving the problem of Pattern Mining in Sequences (EMS) constitute an interesting technique transforming the EMS problem into another equivalent NP-Complete problem and trying to solve it by using specialized solvers. In this paper, we will present two existing declarative approaches the first transforms EMS problems into SAT problems (Boolean Satisfiability problems) and the second into CSP (Constraint Satisfaction Problems). We will focus on the frequent and closed pattern mining in sequences (F-CPS) and we will compare the obtained results for these problems.