Extending Modern SAT Solvers for Enumerating All Models

05/02/2013
by   Said Jabbour, et al.
0

In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF). We propose an extension of CDCL-based SAT solvers to deal with this fundamental problem. Then, we provide an experimental evaluation of our proposed SAT model enumeration algorithms on both satisfiable SAT instances taken from the last SAT challenge and on instances from the SAT-based encoding of sequence mining problems.

READ FULL TEXT
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
07/02/2018

A SAT Encoding for the n-Fractions Problem

This note describes a SAT encoding for the n-fractions puzzle which is p...
research
06/24/2013

Proteus: A Hierarchical Portfolio of Solvers and Transformations

In recent years, portfolio approaches to solving SAT problems and CSPs h...
research
08/05/2019

Learned Clause Minimization in Parallel SAT Solvers

Learned clauses minimization (LCM) let to performance improvements of mo...
research
06/27/2014

Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem

On the one hand, Constraint Satisfaction Problems allow one to declarati...
research
03/11/2016

Solving MaxSAT by Successive Calls to a SAT Solver

The Maximum Satisfiability (MaxSAT) problem is the problem of finding a ...
research
03/08/2019

Generating Difficult SAT Instances by Preventing Triangles

When creating benchmarks for SAT solvers, we need SAT instances that are...

Please sign up or login with your details

Forgot password? Click here to reset