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.

本文介绍 AllSAT 问题及其重要意义，探讨解决方案，实施大量实验并公开开发的求解器以及该问题的特征。

实现高效的全解 SAT 求解器

Implementing Efficient All Solutions SAT Solvers

It is well known that different solution strategies work well for different
types of instances of hard combinatorial problems. As a consequence, most
solvers for the propositional satisfiability problem (SAT) expose parameters
that allow them to be customized to a particular family of instances. In the
international SAT competition series, these parameters are ignored: solvers are
run using a single default parameter setting (supplied by the authors) for all
benchmark instances in a given track. While this competition format rewards
solvers with robust default settings, it does not reflect the situation faced
by a practitioner who only cares about performance on one particular
application and can invest some time into tuning solver parameters for this
application. The new Configurable SAT Solver Competition (CSSC) compares
solvers in this latter setting, scoring each solver by the performance it
achieved after a fully automated configuration step. This article describes the
CSSC in more detail, and reports the results obtained in its two instantiations
so far, CSSC 2013 and 2014.

Configurable SAT Solver Competition (CSSC) compares solvers by the performance they achieved after a fully automated configuration step to solve combinatorial problems, particularly propositional satisfiability problem (SAT), by tuning solver parameters, with CSSC 2013 and 2014 being reported.