Design of parallel portfolios for SAT-based solving of Hamiltonian cycle problems
نویسندگان
چکیده
We study portfolios of parallel strategies for Boolean Satisfiability (SAT) based solving of Hamiltonian Cycle Problems (HCPs). The strategies are based on our techniques for relative SAT encoding of permutations with constraints, and exploit: 1) encodings that eliminate half of the ordering Boolean variables and two-thirds of the transitivity constraints; 2) 12 triangulation heuristics for minimal enumeration of transitivity; 3) 11 heuristics for selecting the first node in the Hamiltonian cycle; 4) inverse transitivity constraints; and 5) exclusivity successor constraints between neighbors. We achieve up to 3 orders of magnitude speedup on random graphs that have Hamiltonian cycles and are in the phase transition
منابع مشابه
Parallel SAT Solver Selection and Scheduling
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the paralle...
متن کاملAutomatic construction of parallel portfolios via algorithm configuration
Since 2004, increases in computational power described by Moore’s law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for proposit...
متن کاملEfficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented as a permutation of n objects, subject to additional constraints. In the case of the Hamiltonian Cycle Problem (HCP), these constraints are that two adjacent nodes in a permutation should also be neighbors in the grap...
متن کاملThe Solution of SAT Problems Using Ternary Vectors and Parallel Processing
This paper will show a new approach to the solution of SAT-problems. It has been based on the isomorphism between the Boolean algebras of finite sets and the Boolean algebras of logic functions depending on a finite number of binary variables. Ternary vectors are the main data structure representing sets of Boolean vectors. The respective set operations (mainly the complement and the intersecti...
متن کاملAlgorithms for the Satisfiability ( Sat
The satissability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, co...
متن کامل