Abstract
Swarm intelligence is a major research field that contributed these last years to solve complex problems. In this paper, we show that bio-inspired approaches augmented with data mining techniques such as clustering, may bring more efficiency to problem solving. In fact, we aim at exploring judiciously the search space before seeking for solutions and hence reducing the complexity of the problem large instances. We consider for this purpose the approach of Bee Swarm Optimization (BSO) and propose two ways to integrate clustering in it. The first one consists in incorporating clustering in the design of BSO. This leads us to suggest an advanced version of BSO. The second one performs clustering on the data before launching BSO. This proposal was implemented for the satisfiability problem known widely as SAT. The complexity of the problem is reduced in this case by clustering clauses and hence variables and afterwards solving the clusters that have a smaller number of variables.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Davis, M., Putnam, H.: A computing procedure for quantification theory. In: CACM, vol. 7, pp. 201–215 (1960)
Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM 5(7), 394–397 (1962)
Drias, H., Khabzaoui, M.: Scatter search with random walk strategy for SAT and MAX-W-SAT problems. In: Monostori, L., Váncza, J., Ali, M. (eds.) IEA/AIE 2001. LNCS (LNAI), vol. 2070, pp. 35–44. Springer, Heidelberg (2001)
Drias, H., Ibri, S.: Parallel ACS for weighted MAX-SAT. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 414–418. Springer, Heidelberg (2003)
Drias, H., Sadeg, S., Yahi, S.: Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem. In: Cabestany, J., Prieto, A.G., Sandoval, F. (eds.) IWANN 2005. LNCS, vol. 3512, pp. 318–325. Springer, Heidelberg (2005)
Drias, H., Mosteghanemi, H.: Bees Swarm Optimization based Approach for Web Information Retrieval. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Toronto Canada, pp. 6–13 (2010)
Djenouri, Y., Drias, H., Mosteghanemi, H.: Bees Swarm Optimization for Web Association Rule Mining. In: Problems and Methodologies in Mathematical Software Production, pp. 142–146. Springer LNCS (2012)
Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability Solvers. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, pp. 89–134. Elsevier (2008)
Han, J., et al.: Data mining Concepts and Techniques. Morgan Kauffman Series (2013)
Le Berre, D., Roussel, O., Simon, L.: SAT competition (2007), http://www.satcompetition.org/
Mazure, B., Sais, L., Grégoire, E.: Tabu Search for SAT. In: AAAI/IAAI, pp. 281–285 (1997)
Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: 10th AAAI, San Jose, CA, pp. 440–446 (1992)
Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 521–532. American Mathematical Society (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drias, H., Douib, A., Hirèche, C. (2013). Swarm Intelligence with Clustering for Solving SAT. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2013. IDEAL 2013. Lecture Notes in Computer Science, vol 8206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41278-3_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-41278-3_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41277-6
Online ISBN: 978-3-642-41278-3
eBook Packages: Computer ScienceComputer Science (R0)