Applications Of Satisfiability Research Articles

Satisfiability-based Set Membership Filters

Introduced here is a novel application of Satisfiability (SAT) to the set membership problem with specific focus on efficiently testing whether large sets contain a given element. Such tests can be greatly enhanced via the use of filters, probabilistic algorithms that can quickly decide whether or not a given element is in a given set. This article proposes SAT filters (i.e., filters based on SAT) and their use in the set membership problem. Both the theoretical advantages of SAT filters and experimental results show that this technique yields significant performance improvements over previous techniques. Specifically, a SAT filter is a filter construction that is simple yet efficient in terms of both query time and filter size; i.e., SAT filters asymptotically achieve the information-theoretic limit while providing fast querying. As well, this is the first application that makes use of the random k-SAT phase transition results and may drive research into efficient solvers for this and similar applications.

HYBRID INCREMENTAL ALGORITHMS FOR BOOLEAN SATISFIABILITY

Boolean Satisfiability (SAT) solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. SAT solvers are also the building block of more sophisticated decision procedures, including Satisfiability Modulo Theory (SMT) solvers. The large number of applications of SAT yields ever more challenging problem instances, and motivate the development of more efficient algorithms. Recent work studied hybrid approaches for SAT, which involves integrating incomplete and complete SAT solvers. This paper proposes a number of improvements to hybrid SAT solvers. Experimental results demonstrate that the proposed optimizations are effective. The resulting algorithms in general perform better and, more importantly, are significantly more robust.