z-logo
open-access-imgOpen Access
Whose side are you on?1
Author(s) -
Marijn J. H. Heule,
Hans van Maaren
Publication year - 2008
Publication title -
journal on satisfiability boolean modeling and computation
Language(s) - English
Resource type - Journals
eISSN - 1875-5011
pISSN - 1574-0617
DOI - 10.3233/sat190041
Subject(s) - heuristics , satisfiability , boolean satisfiability problem , jump , computer science , solver , tree (set theory) , mathematics , value (mathematics) , variable (mathematics) , algorithm , mathematical optimization , combinatorics , machine learning , mathematical analysis , physics , quantum mechanics
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior on unsatisfiable instances. Direction heuristics select which Boolean value to assign to a decision variable. They are used in various state-of-the-art Sat solvers and may bias the distribution of solutions in the search-tree. This bias can clearly be observed on hard random k-Sat formulae. While alternative jump / restart strategies are based on exploring a random new part of the search-tree, the proposed one examines a part that is more likely to contain a solution based on these observations. Experiments with - so-called distribution jumping - in the march ks Sat solver, show that this new technique boosts the number of satisfiable formulae it can solve. Moreover, it proved essential for winning the satisfiable crafted category during the Sat 2007 competition.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom