ASIG: An all-solution SAT solver for CNF formulas

Abstract

An all-solution Boolean satisfiability (SAT) solver aims to find all the satisfying assignments. In this paper, we introduce ASIG, an all-solution solver for satisfiability problems. ASIG operates on conjunctive normal forms (CNFs) instead of circuits or hybrid representations as most other all-solution solvers did. ASIG prevents the same solution from… (More)
DOI: 10.1109/CADCG.2009.5246850

Topics

4 Figures and Tables

Cite this paper

@article{Zhao2009ASIGAA, title={ASIG: An all-solution SAT solver for CNF formulas}, author={Weinan Zhao and Weimin Wu}, journal={2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics}, year={2009}, pages={508-513} }