{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:03:53Z","timestamp":1776438233961,"version":"3.51.2"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Guangdong Province Science and Technology Plan projects","award":["2017B010110011"],"award-info":[{"award-number":["2017B010110011"]}]},{"name":"Guangdong Province Science and Technology Plan projects","award":["2016B030305007"],"award-info":[{"award-number":["2016B030305007"]}]},{"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61573386"],"award-info":[{"award-number":["61573386"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&D Program of China","award":["2018YFC0830600"],"award-info":[{"award-number":["2018YFC0830600"]}]},{"name":"Guangdong Province Natural Science Foundation","award":["2016A030313292"],"award-info":[{"award-number":["2016A030313292"]}]},{"name":"Guangdong Province Natural Science Foundation","award":["2017A070706010"],"award-info":[{"award-number":["2017A070706010"]}]},{"name":"Guangdong Province Natural Science Foundation","award":["2018A030313086"],"award-info":[{"award-number":["2018A030313086"]}]},{"name":"Guangzhou Science and Technology Project","award":["201804010435"],"award-info":[{"award-number":["201804010435"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tr.2020.3014012","type":"journal-article","created":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T20:18:13Z","timestamp":1597436293000},"page":"575-589","source":"Crossref","is-referenced-by-count":8,"title":["SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3733-9361","authenticated-orcid":false,"given":"Weilin","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6744-9994","authenticated-orcid":false,"given":"Ou","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5357-9130","authenticated-orcid":false,"given":"Hai","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1980","article-title":"Prime compilation of non-clausal formulae","author":"previti","year":"0","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11558-0_11"},{"key":"ref33","author":"cadoli","year":"1997","journal-title":"A Survey on Knowledge Compilation"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"2474","DOI":"10.1093\/bioinformatics\/bts423","article-title":"Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks","volume":"28","author":"na","year":"2012","journal-title":"Bioinformatics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2011.23"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/24.765925"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679390"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.1996.560473"},{"key":"ref34","first-page":"1573","article-title":"A judgment set similarity measure based on prime implicants","author":"slavkovik","year":"0","journal-title":"Proc Int Conf Auton Agents Multi-Agent Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FAMCAD.2007.15"},{"key":"ref27","first-page":"167","article-title":"Preferred explanations and relaxations for over-constrained problems","author":"junker","year":"0","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.021"},{"key":"ref2","first-page":"1022","article-title":"Formal correctness, safety, dependability, and performance snalysis of a satellite","author":"esteve","year":"0","journal-title":"Proc 34th Int'l Conf Software Eng"},{"key":"ref1","article-title":"Fault tree handbook","author":"vesely","year":"1981"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040025.89719.f3"},{"key":"ref22","author":"tseitin","year":"1983","journal-title":"Automation of Reasoning"},{"key":"ref21","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"0","journal-title":"Proc 6th Int Conf Theory Appl Satisfiability Testing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/24.31101"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_27"},{"key":"ref25","article-title":"Aralia faulttrees","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2003.10.009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5516\/NET.2008.40.7.571"},{"key":"ref40","first-page":"9","article-title":"COSMOS: A compiled simulator for MOS circuits","author":"bryant","year":"0","journal-title":"Proc 24th ACM\/IEEE Conf Des Autom Conf"},{"key":"ref12","first-page":"898","article-title":"Reduced ZBDD construction algorithms for large fault tree analysis","author":"contini","year":"2010","journal-title":"Reliability Risk and Safety—Back to the Future"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/RAMS.2006.1677414"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1243\/1748006XJRR154"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/24.983400"},{"key":"ref16","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.21236\/ADA360973"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00375-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2015.03.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.anucene.2015.11.002"},{"key":"ref6","first-page":"324","article-title":"A new methodology for obtaining cut sets for fault trees","volume":"15","author":"fussell","year":"1972","journal-title":"Trans Amer Nucl Soc"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNS.1971.4325913"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(97)00034-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/RAMS.1993.296849"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"ref9","first-page":"207","article-title":"Minimal cut set\/sequence generation for dynamic fault trees","author":"tang","year":"0","journal-title":"Proc 50th Annu Rel Maintainability Symp"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695941"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_13"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_13"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2975585"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30494-4_20"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/11560548_19"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2005.69"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2014.22"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/9448244\/09167287.pdf?arnumber=9167287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T20:28:04Z","timestamp":1635280084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9167287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":49,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tr.2020.3014012","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}