Abstract
Portfolio approach for parallel SAT solvers is known as the standard parallelisation technique. In portfolio, diversification is one of the important factors in order to enable workers (solvers) to conduct a vast search. The diversification is implemented by setting different parameters for each worker in the state-of-the-art parallel portfolio SAT solvers. However, it is difficult to combine the search parameters properly in order to avoid overlaps of search spaces between the workers For this issue, we propose a novel diversification technique, called community branching. In this method, we assign a different set (or sets) of variables (called a community) to each worker and force them to select these variables as decision variables in early decision levels. In this manner, we can avoid the overlaps of the search spaces between the workers more vigorously than the existing method. We create a graph, where a vertex corresponds to a variable and an edge stands for a relation between two variables in a same clause, and we apply a modularity-based community detection algorithm to it. The variables in a community have strong relationships, and a distributed search for different communities can benefit the whole search. Experimental results show that we could speedup an existing parallel SAT solver with our proposal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ansótegui, C., Giráldez-Cru, J., Levy, J.: The Community Structure of SAT Formulas. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 410–423. Springer, Heidelberg (2012)
Balint, A., Belov, A., Heule, M.J.H., Jrvisalo, M.: Proceedings of SAT Competition 2013; Solver and Benchmark Descriptions (2013)
Blondel, V.D., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10), 10008 (2008)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6), 066111 (2004)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5(7), 394–397 (1962)
Eriksen, K.A., Simonsen, I., Maslov, S., Sneppen, K.: Modularity and Extreme Edges of the Internet. Physical Review 90, 148701 (2003)
Gil, L., Flores, P.F., Silveira, L.M.: PMSat: A parallel version of MiniSAT. JSAT 6(1-3), 71–98 (2009)
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Gomes, C.P., Selman, B.: Algorithm Portfolio Design: Theory vs. Practice. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, UAI 1997, pp. 190–197 (1997)
Guo, L., Hamadi, Y., Jabbour, S., Sais, L.: Diversification and Intensification in Parallel SAT Solving. In: Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming, CP 2010, pp. 252–265 (2010)
Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: A Parallel SAT Solver. JSAT 6(4), 245–262 (2009)
Lewis, M., Schubert, T., Becker, B.: Multithreaded SAT Solving. In: Proceedings of the 2007 Asia and South Pacific Design Automation Conference, ASP-DAC 2007, pp. 926–931 (2007)
Martins, R., Manquinho, V., Lynce, I.: Community-Based Partitioning for MaxSAT Solving. In: Järvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 182–191. Springer, Heidelberg (2013)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, pp. 530–535 (2001)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76(3), 036106 (2007)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences 105(4), 1118–1123 (2008)
Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: A Distributed Propositional Prover and its Application to Quasigroup Problems. J. Symb. Comput. 21, 543–560 (1996)
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
Sonobe, T., Kondoh, S., Inaba, M. (2014). Community Branching for Parallel Portfolio SAT Solvers. In: Sinz, C., Egly, U. (eds) Theory and Applications of Satisfiability Testing – SAT 2014. SAT 2014. Lecture Notes in Computer Science, vol 8561. Springer, Cham. https://doi.org/10.1007/978-3-319-09284-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-09284-3_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09283-6
Online ISBN: 978-3-319-09284-3
eBook Packages: Computer ScienceComputer Science (R0)