Name
Title | ||
|---|---|---|
A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. |
Abstract | ||
|---|---|---|
In this paper we propose a satisfiability-based approach for enumerating all frequent, closed and maximal patterns with wildcards in a given sequence. In this context, since frequency is the most used criterion, we introduce a new polynomial inductive formulation of the cardinality constraint as a Boolean formula. A nogood-based formulation of the anti-monotonicity property is proposed and dynamically used for pruning. This declarative framework allows us to exploit the efficiency of modern SAT solvers and particularly their clause learning component. The experimental evaluation on real world data shows the feasibility of our proposed approach in practice. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3233/978-1-61499-098-7-258 | Frontiers in Artificial Intelligence and Applications |
Field | DocType | Volume |
Polynomial,Wildcard character,Computer science,Satisfiability,Algorithm,Cardinality,Exploit,True quantified Boolean formula | Conference | 242 |
ISSN | Citations | PageRank |
0922-6389 | 20 | 0.79 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emmanuel Coquery | 1 | 92 | 12.61 |
| Saïd Jabbour | 2 | 175 | 12.44 |
| Lakhdar Saïs | 3 | 170 | 11.98 |
| Yakoub Salhi | 4 | 137 | 22.77 |