{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:29:50Z","timestamp":1746289790793,"version":"3.37.3"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976232"],"award-info":[{"award-number":["61976232"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1109\/iccad51958.2021.9643520","type":"proceedings-article","created":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T23:06:46Z","timestamp":1640300806000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae"],"prefix":"10.1109","author":[{"given":"Weilin","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Want","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhen","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ou","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biqing","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotong","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2975585"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_15"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.1996.560739"},{"key":"ref32","first-page":"510","article-title":"Compilation for critically constrained knowledge bases","author":"schrag","year":"1996","journal-title":"AAAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00035-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.1997.632261"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_13"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005721905269"},{"key":"ref35","first-page":"46","article-title":"A new algorithm for incremental prime implicate generation","author":"ngair","year":"1993","journal-title":"IJCAI"},{"key":"ref34","first-page":"46","article-title":"Computing prime implicants","author":"d\u00e9harbe","year":"2013","journal-title":"FMCAD"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb03624.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.11.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02716-1_19"},{"key":"ref14","first-page":"1980","article-title":"Prime compilation of non-clausal formulae","author":"previti","year":"2015","journal-title":"IJCAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/37888.37890"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_19"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11558-0_11"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","article-title":"Temporal induction by incremental sat solving","volume":"89","author":"n e","year":"2003","journal-title":"Electron Notes Theor Comput Sci"},{"key":"ref19","article-title":"Fault tree handbook","author":"vesely","year":"1981","journal-title":"Tech Rep"},{"key":"ref28","first-page":"502","article-title":"An extensible sat-solver","author":"e\u00e9n","year":"2003","journal-title":"SAT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264648"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.172"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240795"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001393"},{"key":"ref29","article-title":"On computing minimum size prime implicants","author":"marques-silva","year":"1997","journal-title":"IWLS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691202"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2017.13"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FAMCAD.2007.15"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_21"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39071-5_3"},{"key":"ref1","first-page":"837","article-title":"Knowledge compilation using theory prime implicates","author":"marquis","year":"1995","journal-title":"IJCAI"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2015.03.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1992.227866"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2008.03.018"},{"key":"ref24","first-page":"898","article-title":"Reduced zbdd construction algorithms for large fault tree analysis","author":"contini","year":"2010","journal-title":"Reliability Risk and Safty Back to the Future"},{"key":"ref23","first-page":"25","article-title":"Anatomy of an efficient fault tree assessment engine","author":"rauzy","year":"2012","journal-title":"PSAM9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2014.6987611"},{"journal-title":"Searching for truth Techniques for satisfiability of Boolean formulas","year":"2003","author":"zhang","key":"ref25"}],"event":{"name":"2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD)","start":{"date-parts":[[2021,11,1]]},"location":"Munich, Germany","end":{"date-parts":[[2021,11,4]]}},"container-title":["2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9643423\/9643432\/09643520.pdf?arnumber=9643520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:15Z","timestamp":1652201715000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9643520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/iccad51958.2021.9643520","relation":{},"subject":[],"published":{"date-parts":[[2021,11,1]]}}}