research
∙
03/20/2019
Extracting Frequent Gradual Patterns Using Constraints Modeling
In this paper, we propose a constraint-based modeling approach for the p...
share
research
∙
03/31/2018
Efficient Encodings of Conditional Cardinality Constraints
In the encoding of many real-world problems to propositional satisfiabil...
research
∙
06/08/2015
On SAT Models Enumeration in Itemset Mining
Frequent itemset mining is an essential part of data analysis and data m...
research
∙
06/01/2014
On the measure of conflicts: A MUS-Decomposition Based Framework
Measuring inconsistency is viewed as an important issue related to handl...
research
∙
02/09/2014
Revisiting the Learned Clauses Database Reduction Strategies
In this paper, we revisit an important issue of CDCL-based SAT solvers, ...
research
∙
05/14/2013
A Mining-Based Compression Approach for Constraint Satisfaction Problems
In this paper, we propose an extension of our Mining for SAT framework t...
research
∙
05/02/2013
Extending Modern SAT Solvers for Enumerating All Models
In this paper, we address the problem of enumerating all models of a Boo...
research
∙
04/16/2013
Mining to Compact CNF Propositional Formulae
In this paper, we propose a first application of data mining techniques ...
research
∙
10/07/2009
Integrating Conflict Driven Clause Learning to Local Search
This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid appro...
research
∙
03/31/2009
