Set-Based SAT-Solving
نویسندگان
چکیده
Abstract: The 3-SAT problem is one of the most important and interesting NP-complete problems with many applications in different areas. In several previous papers we showed the use of ternary vectors and set-theoretic considerations as well as binary codings and bit-parallel vector operations in order to solve this problem. Lists of orthogonal ternary vectors have been the main data structure, the intersection of ternary vectors (representing sets of binary solution candidates) was the most important settheoretic operation. The parallelism of the solution process has been established on the register level, i.e. related to the existing hardware, by using a binary coding of the ternary vectors, and it was also possible to transfer the solution process to a hierarchy of processors working in parallel. This paper will show further improvements of the existing algorithms which are easy to understand and result in very efficient algorithms and implementations. Some examples will be presented that will show the recent results.
منابع مشابه
Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints
This letter discusses the applicability of boolean satisfiability (SAT) solving to pairwise testing in practice. Due to its recent rapid advance, using SAT solving seems a promising approach for search-based testing and indeed has already been practiced in test generation for pairwise testing. The previous approaches use SAT solving either for finding a small test set in the absence of paramete...
متن کاملStructure-based satisfiability checking : analyzing and harnessing the potential
Constraint satisfaction deals with developing automated techniques for solving computationally hard problems in a declarative fashion. The main emphasis of this thesis is on constraint satisfaction techniques for the propositional satisfiability problem (SAT). As solving techniques for propositional satisfiability have rapidly progressed during the last 15 years, implementations of decision pro...
متن کاملConflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply ad...
متن کاملSymbolic Decision Procedures for QBF
Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most competitive QBF solvers are search-based. In this work we explore an alternative approach to QBF solving, based on symbolic quantifier elimination. We extend some recent symbolic approaches for SAT solving to symbolic Q...
متن کاملA SAT-based Method for Solving the Two-dimensional Strip Packing Problem
We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangle called a strip. The goal of the problem is to pack all rectangles without overlap, into the strip by minimizing the overall height of the packing. We show the method solves a 2SPP by translating it ...
متن کاملCharacterizing ASP Inferences by Unit Propagation
Computational approaches to Satisfiability Checking (SAT) and Answer Set Programming (ASP) have many aspects in common. In fact, the basic algorithms of ASP solvers are very similar to the Davis-Logemann-Loveland procedure (DLL) for SAT. The major difference lies in the inference rules, which are more complex in ASP. In this paper, we provide a generic framework, based on concepts from Constrai...
متن کامل