{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:24:23Z","timestamp":1725528263800},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/cadcg.2009.5246850","type":"proceedings-article","created":{"date-parts":[[2009,9,21]],"date-time":"2009-09-21T12:01:42Z","timestamp":1253534502000},"page":"508-513","source":"Crossref","is-referenced-by-count":6,"title":["ASIG: An all-solution SAT solver for CNF formulas"],"prefix":"10.1109","author":[{"given":"Weinan","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Weimin","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2004.1329499"},{"journal-title":"Efficient Algorithms for Finding all Satisfying Assignment of a Prepositional Formula","year":"2005","author":"jin","key":"13"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2006.1692903"},{"key":"12","first-page":"272","article-title":"a novel sat allsolutions solver for efficient preimage computation","author":"li","year":"2004","journal-title":"Design Automation and Test in Europe"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2003.1240948"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1999.781333"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2001.156196"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/1278480.1278629","article-title":"ehsat: an efficient rtl satisfiability solver using an extended dpll procedure","author":"shujun deng","year":"2007","journal-title":"2007 44th ACM\/IEEE Design Automation Conference DAC"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/775832.776043"},{"key":"5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","article-title":"applying sat methods in unbounded symbolic model checking","author":"mcmillan","year":"2002","journal-title":"Computer Aided Verification"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/43.108614"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1023\/B:AMAI.0000012872.46214.11"},{"key":"8","first-page":"442","article-title":"conflict driven learning in a quantified boolean satisfiability solver","author":"zhang","year":"2002","journal-title":"International Conference on Computer Aided Design"}],"event":{"name":"2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics (CAD\/Graphics)","start":{"date-parts":[[2009,8,19]]},"location":"Huangshan, China","end":{"date-parts":[[2009,8,21]]}},"container-title":["2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5234369\/5246805\/05246850.pdf?arnumber=5246850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:56:08Z","timestamp":1497815768000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5246850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/cadcg.2009.5246850","relation":{},"subject":[],"published":{"date-parts":[[2009,8]]}}}