{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:48:16Z","timestamp":1729648096079,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/icaci.2015.7184740","type":"proceedings-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T22:54:27Z","timestamp":1439506467000},"page":"407-410","source":"Crossref","is-referenced-by-count":2,"title":["Application and analysis of unsatisfiable cores on circuits synthesis"],"prefix":"10.1109","author":[{"given":"Jianmin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiejun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sikun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"221","article-title":"Boosting minimal unsatisfiable core extraction","author":"nadel","year":"2010","journal-title":"Proc 10th Inti Conf Formal Methods in Computer Aided Design"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21581-0_15"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.3233\/AIC-2012-0523","article-title":"Towards efficient MUS extraction","volume":"25","author":"belov","year":"2012","journal-title":"Journal AI Communications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679410"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2003.1253717"},{"key":"ref3","first-page":"56","article-title":"Algorithms for Deriving minimum unsatisfiable Boolean subformulae","volume":"37","author":"zhang","year":"2009","journal-title":"Acta Electronica Sinica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-005-0418-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996710"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0051-z"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/11499107_13","article-title":"On finding all minimally unsatisfiable subformulas","author":"liffiton","year":"2005","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9058-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2049152"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.066"}],"event":{"name":"2015 Seventh International Conference on Advanced Computational Intelligence (ICACI)","start":{"date-parts":[[2015,3,27]]},"location":"Wuyi, China","end":{"date-parts":[[2015,3,29]]}},"container-title":["2015 Seventh International Conference on Advanced Computational Intelligence (ICACI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7174268\/7184712\/07184740.pdf?arnumber=7184740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T05:19:14Z","timestamp":1599455954000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7184740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icaci.2015.7184740","relation":{},"subject":[],"published":{"date-parts":[[2015,3]]}}}