Search Results for author:
Found 6 papers, 0 papers with code
On SAT Models Enumeration in Itemset Mining
We then conduct an experimental evaluation on SAT-Based itemset mining instances to show how SAT solvers can be adapted to obtain an efficient SAT model enumerator.
On the measure of conflicts: A MUS-Decomposition Based Framework
One particular MUS-decomposition, named distributable MUS-decomposition leads to an interesting partition of inconsistencies in a knowledge base such that multiple experts can check inconsistencies in parallel, which is impossible under existing measures.
Revisiting the Learned Clauses Database Reduction Strategies
In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies.
A Mining-Based Compression Approach for Constraint Satisfaction Problems
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP).
Extending Modern SAT Solvers for Enumerating All Models
In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF).
Mining to Compact CNF Propositional Formulae
In this paper, we propose a first application of data mining techniques to propositional satisfiability.
