Abstract
The phase (also called polarity) selection strategy is an important component of a SAT solver based on conflict-driven DPLL. DPLL algorithm is due to Davis, Putnam, Logemann, Loveland. It is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae. This paper studies the phase selection strategy and presents a new phase selection strategy, called bit-encoding scheme. The basic idea of this new strategy is to let the phase at each decision level correspond to a bit value of the binary representation of a counter. The counter increases in step with the increase of the number of restarts. In general, only the first 6 decision levels use this new scheme. The other levels use an existing scheme. Compared with the existing strategies, the new strategy is simple, and its cost is low. Experimental results show that the performance of the new phase strategy is good, and the new solver Glue_bit based on it can improve Glucose 2.1 which won a Gold Medal for application category at the SAT Challenge 2012. Furthermore, Glue_bit solved a few application instances that were not solved in the SAT Challenge 2012. From the results on the application SAT+UNSAT category at the SAT Competition 2013, Glue_bit was the best improved version of Glucose, and outperformed glucose 2.3 that is the latest improved version of glucose 2.1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007)
Jeroslow, R., Wang, J.: Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence 1, 167–187 (1990)
Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 (2010), http://baldur.iti.uka.de/sat-race-2010/descriptions/solver_1+2+3+6.pdf
Heule, M.: March: towards a look-ahead SAT solver for general purposes, Master thesis (2004)
Chen, J.: Building a Hybrid SAT Solver via Conflict-driven, Look-ahead and XOR Reasoning Techniques. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 298–311. Springer, Heidelberg (2009)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L.T., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conference, DAC (2001)
Han, H., Somenzi, F.: On-the-fly clause improvement. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 209–222. Springer, Heidelberg (2009)
Sörensson, N., Biere, A.: Minimizing Learned Clauses. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 237–243. Springer, Heidelberg (2009)
Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI 2009, pp. 399–404 (2009)
Audemard, G., Lagniez, J.-M., Mazure, B., Saïs, L.: On Freezing and Reactivating Learnt Clauses. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 188–200. Springer, Heidelberg (2011)
Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 121–135. Springer, Heidelberg (1997)
Audemard, G., Simon, L.: Refining Restarts Strategies for SAT and UNSAT. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 118–126. Springer, Heidelberg (2012)
Chen, J.C.: Solvers with a Bit-Encoding Phase Selection Policy and a Decision-Depth-Sensitive Restart Policy. In: Proceedings of the SAT Competition 2013, pp. 44–45 (2013)
SAT 2013 competition web page, http://www.satcompetition.org/2013/
Chen, J.C.: Phase Selection Heuristics for Satisfiability Solvers (2011), http://arxiv.org/abs/1106.1372
Chen, J.C.: A Dynamic Phase Selection Strategy for Satisfiability Solvers (2012), http://arxiv.org/abs/1208.1613
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, J. (2014). A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol 8402. Springer, Cham. https://doi.org/10.1007/978-3-319-06089-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-06089-7_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06088-0
Online ISBN: 978-3-319-06089-7
eBook Packages: Computer ScienceComputer Science (R0)