{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:25:17Z","timestamp":1763724317688,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/icm.2015.7438045","type":"proceedings-article","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T16:21:53Z","timestamp":1458836513000},"page":"287-290","source":"Crossref","is-referenced-by-count":3,"title":["A new FPGA-based DPLL algorithm to improve SAT solvers"],"prefix":"10.1109","author":[{"given":"Khadija","family":"Bousmar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zineb","family":"Habbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofiene","family":"Dellagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abbas","family":"Dandache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"ref11","article-title":"Aspects parallèles des problèmes de satisfaisabilité","author":"vander-swalmen","year":"2009","journal-title":"Phd Thesis of University of Reims Champagne-Ardenne"},{"key":"ref12","article-title":"Hybridation des méthodes de résolution pour SAT","author":"fourdrinoy","year":"2005","journal-title":"7e Rencontres Jeunes Chercheurs en Intelligence Artificielle"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCI.2015.7275665"},{"article-title":"MiniSAT(ID) for satisfiability checking and constraint solving","year":"2014","author":"de cat","key":"ref4"},{"key":"ref3","article-title":"A novel approach of solving the CNF-SAT problem","volume":"abs 1307 6291","author":"wang","year":"2013","journal-title":"Computer Research Repository-CORR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"ref5","article-title":"Boolean Satisfiability Solvers: Techniques, Implementations and Analysis","volume":"5","author":"lima","year":"2010","journal-title":"Electronica e Telecominicacoes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2005.1515693"},{"key":"ref2","article-title":"The P versus NP complet","author":"cook","year":"2000","journal-title":"The P versus NP Problem"},{"key":"ref1","first-page":"2681","article-title":"The P versus NP-complete dichotomy of some challenging problems in graph theory","volume":"160","year":"2012","journal-title":"Journal Discrete archive"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.015"}],"event":{"name":"2015 27th International Conference on Microelectronics (ICM)","start":{"date-parts":[[2015,12,20]]},"location":"Casablanca","end":{"date-parts":[[2015,12,23]]}},"container-title":["2015 27th International Conference on Microelectronics (ICM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433554\/7437967\/07438045.pdf?arnumber=7438045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T02:11:00Z","timestamp":1489803060000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7438045\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icm.2015.7438045","relation":{},"subject":[],"published":{"date-parts":[[2015,12]]}}}