Abstract:
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 Conflict Driven Clause L...Show MoreMetadata
Abstract:
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 Conflict Driven Clause Learning (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.
Published in: Proceedings of the 2014 IEEE 15th International Conference on Information Reuse and Integration (IEEE IRI 2014)
Date of Conference: 13-15 August 2014
Date Added to IEEE Xplore: 02 March 2015
Electronic ISBN:978-1-4799-5880-1