{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:39:25Z","timestamp":1725752365635},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412776"},{"type":"electronic","value":"9783642412783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41278-3_71","type":"book-chapter","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T13:41:50Z","timestamp":1381930910000},"page":"585-593","source":"Crossref","is-referenced-by-count":2,"title":["Swarm Intelligence with Clustering for Solving SAT"],"prefix":"10.1007","author":[{"given":"Habiba","family":"Drias","sequence":"first","affiliation":[]},{"given":"Ameur","family":"Douib","sequence":"additional","affiliation":[]},{"given":"C\u00e9lia","family":"Hir\u00e8che","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"71_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"issue":"3","key":"71_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"Martin Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. In: CACM, vol.\u00a07, pp. 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"issue":"7","key":"71_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"71_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45517-5_5","volume-title":"Engineering of Intelligent Systems","author":"H. Drias","year":"2001","unstructured":"Drias, H., Khabzaoui, M.: Scatter search with random walk strategy for SAT and MAX-W-SAT problems. In: Monostori, L., V\u00e1ncza, J., Ali, M. (eds.) IEA\/AIE 2001. LNCS (LNAI), vol.\u00a02070, pp. 35\u201344. Springer, Heidelberg (2001)"},{"key":"71_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-44868-3_53","volume-title":"Computational Methods in Neural Modeling","author":"H. Drias","year":"2003","unstructured":"Drias, H., Ibri, S.: Parallel ACS for weighted MAX-SAT. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWANN 2003. LNCS, vol.\u00a02686, pp. 414\u2013418. Springer, Heidelberg (2003)"},{"key":"71_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11494669_39","volume-title":"Computational Intelligence and Bioinspired Systems","author":"H. Drias","year":"2005","unstructured":"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.\u00a03512, pp. 318\u2013325. Springer, Heidelberg (2005)"},{"key":"71_CR7","doi-asserted-by":"crossref","unstructured":"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\u201313 (2010)","DOI":"10.1109\/WI-IAT.2010.179"},{"key":"71_CR8","doi-asserted-by":"crossref","unstructured":"Djenouri, Y., Drias, H., Mosteghanemi, H.: Bees Swarm Optimization for Web Association Rule Mining. In: Problems and Methodologies in Mathematical Software Production, pp. 142\u2013146. Springer LNCS (2012)","DOI":"10.1109\/WI-IAT.2012.148"},{"key":"71_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013134. Elsevier (2008)","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"71_CR10","unstructured":"Han, J., et al.: Data mining Concepts and Techniques. Morgan Kauffman Series (2013)"},{"key":"71_CR11","unstructured":"Le Berre, D., Roussel, O., Simon, L.: SAT competition (2007), http:\/\/www.satcompetition.org\/"},{"key":"71_CR12","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, E.: Tabu Search for SAT. In: AAAI\/IAAI, pp. 281\u2013285 (1997)"},{"key":"71_CR13","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: 10th AAAI, San Jose, CA, pp. 440\u2013446 (1992)"},{"key":"71_CR14","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 521\u2013532. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/25"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41278-3_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T22:15:01Z","timestamp":1564524901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41278-3_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412776","9783642412783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41278-3_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}