{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:37:24Z","timestamp":1730284644578,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/nabic.2013.6617862","type":"proceedings-article","created":{"date-parts":[[2013,10,10]],"date-time":"2013-10-10T19:27:30Z","timestamp":1381433250000},"page":"200-206","source":"Crossref","is-referenced-by-count":3,"title":["Datamining techniques and swarm intelligence for problem solving: Application to SAT"],"prefix":"10.1109","author":[{"given":"Habiba","family":"Drias","sequence":"first","affiliation":[]},{"given":"Celia","family":"Hireche","sequence":"additional","affiliation":[]},{"given":"Ameur","family":"Douib","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","first-page":"193","article-title":"Symbolic Model checking without BDDs","volume-title":"proc of TACAS\u201999, LNCS 1579, Springer","author":"Biere"},{"key":"ref2","first-page":"3","article-title":"A history of Satisfiability","volume-title":"Handbook of Satisfiability","author":"Biere","year":"2009"},{"key":"ref3","first-page":"151","article-title":"The Complexity of Theorem-Proving Procedures","volume-title":"Proceeding 3rd Annual ACM Symposium on the Theory of Computing","author":"Cook"},{"key":"ref4","first-page":"201","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"CACM"},{"issue":"7","key":"ref5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A Machine Program for Theorem Proving","volume":"5","author":"Davis","year":"1962","journal-title":"Communications of the ACM"},{"key":"ref6","first-page":"35","article-title":"Scatter search with random walk strategy for solving hard MAX-W-SAT problems","volume-title":"proc of IEA-AIE\u20192001, LNAI 2070, Springer, Budapest Hungary","author":"Drias"},{"key":"ref7","first-page":"414","article-title":"Parallel ACS for weighted MAX-SAT","volume-title":"proc of Iwann\u20192003, LNCS 2686, Springer Verlag, Iles Baleares","author":"Drias"},{"key":"ref8","first-page":"318","article-title":"Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiabity Problem","volume-title":"Proceedings of Iwann\u20192005, LNCS 3512, Springer Verlag","author":"Drias"},{"key":"ref9","first-page":"x+338","article-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","volume-title":"A Series of Books in the Mathematical Sciences","author":"Garey","year":"1979"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1574-6526(07)03002-7","article-title":"Satisfiability Solvers","volume-title":"Handbook of Knowledge Representation","author":"Gomes","year":"2008"},{"article-title":"Data mining Concepts and Techniques","year":"2013","author":"Han","key":"ref11"},{"article-title":"SAT competition","year":"2007","author":"Le Berre","key":"ref12"},{"key":"ref13","article-title":"Handbook of Satisfiability","author":"Marques-Silva","year":"2009","journal-title":"chapter 4"},{"key":"ref14","first-page":"281","article-title":"Tabu Search for SAT","author":"Mazure","year":"1997","journal-title":"AAAI\/IAAI"},{"key":"ref15","first-page":"530","article-title":"Engineering an efficient SAT solver","volume-title":"proceedings of DAC","author":"Moskewicz"},{"issue":"2","key":"ref16","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","article-title":"A survey of recent advances in SAT-based formal verification","volume":"7","author":"Prasad","year":"2005","journal-title":"journal on Software Tools for Technology Transfer"},{"key":"ref17","first-page":"440","article-title":"A new method for solving hard satisfiability problems","volume-title":"10th AAAI","author":"Selman"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","article-title":"Local search strategies for satisfiability testing","volume-title":"Cliques, Coloring, and Satisfiability: the Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"26","author":"Selman","year":"1996"},{"key":"ref19","first-page":"50","article-title":"Ten challenges in propositional reasoning and search","volume-title":"proceedings of IJCAI","author":"Selman"},{"key":"ref20","first-page":"279","article-title":"Efficient conflict driven learning in a boolean satisfiability solver","volume-title":"proceedings of ICCAD","author":"Zhang"}],"event":{"name":"2013 World Congress on Nature and Biologically Inspired Computing (NaBIC)","start":{"date-parts":[[2013,8,12]]},"location":"Fargo, ND, USA","end":{"date-parts":[[2013,8,14]]}},"container-title":["2013 World Congress on Nature and Biologically Inspired Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6603433\/6617834\/06617862.pdf?arnumber=6617862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T11:54:18Z","timestamp":1710417258000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6617862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/nabic.2013.6617862","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}