Implementing Efficient All Solutions SAT Solvers
Data Structures and Algorithms
2016-11-10 v1 Artificial Intelligence
Logic in Computer Science
Abstract
All solutions SAT (AllSAT for short) is a variant of propositional satisfiability problem. Despite its significance, AllSAT has been relatively unexplored compared to other variants. We thus survey and discuss major techniques of AllSAT solvers. We faithfully implement them and conduct comprehensive experiments using a large number of instances and various types of solvers including one of the few public softwares. The experiments reveal solver's characteristics. Our implemented solvers are made publicly available so that other researchers can easily develop their solver by modifying our codes and compare it with existing methods.
Keywords
Cite
@article{arxiv.1510.00523,
title = {Implementing Efficient All Solutions SAT Solvers},
author = {Takahisa Toda and Takehide Soh},
journal= {arXiv preprint arXiv:1510.00523},
year = {2016}
}