Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem
In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. We suggest the approach based on the Monte Carlo method for estimating time of processing of an arbitrary partitioning. We solve the problem of search for a partitioning with good effectiveness via the optimization of the special predictive function over the finite search space. For this purpose we use the tabu search strategy. In our computational experiments we found partitionings for SAT instances encoding problems of inversion of some cryptographic functions. Several of these SAT instances with realistic predicted solving time were successfully solved on a computing cluster and in the volunteer computing project SAT@home. The solving time agrees well with estimations obtained by the proposed method.
KeywordsMonte carlo method SAT Partitioning Tabu search Cryptanalysis
The authors wish to thank Stepan Kochemazov for numerous valuable comments. This work was partly supported by Russian Foundation for Basic Research (grants 14-07-00403-a and 15-07-07891-a) and by the President of Russian Federation grant for young scientists SP-1184.2015.5.
- 1.Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)Google Scholar
- 6.Hyvärinen, A.E.J.: Grid Based Propositional Satisfiability Solving. Ph.d. thesis, Aalto University (2011)Google Scholar
- 7.Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere et al. , pp. 131–153Google Scholar
- 9.Otpuschennikov, I., Semenov, A., Kochemazov, S.: Transalg: a tool for translating procedural descriptions of discrete functions to SAT (tool paper). CoRR abs/1405.1544 (2014)Google Scholar