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

Please sign up or login with your details

Forgot password? Click here to reset