{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:06:10Z","timestamp":1729634770328,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/fcst.2010.13","type":"proceedings-article","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T16:58:44Z","timestamp":1285001924000},"page":"271-275","source":"Crossref","is-referenced-by-count":0,"title":["Solving SAT Problem with Boolean Algebra"],"prefix":"10.1109","author":[{"given":"Youjun","family":"Xu","sequence":"first","affiliation":[]},{"given":"Dantong","family":"Ouyang","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Jialiang","family":"He","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/11554554_12"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1027339205632","article-title":"Theorem proving based on the extension rule","volume":"31","author":"lin","year":"2003","journal-title":"Journal of Automated Reasoning"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.3724\/SP.J.1001.2009.03420"},{"key":"ref13","first-page":"919","article-title":"The computation of hitting sets with Boolean formulas","volume":"26","author":"jiang","year":"2003","journal-title":"Chinese Journal of Computers"},{"key":"ref14","article-title":"Directional resolution: The Davis Putnam procedure, revisited","author":"dechter","year":"1994","journal-title":"Proc of 4th International Conference on Principles of KR&R"},{"key":"ref4","first-page":"669","article-title":"Solving SQL constraints by incremental translation to SAT","author":"robin","year":"2008","journal-title":"New Frontiers in Applied Artificial Intelligence"},{"key":"ref3","first-page":"20","article-title":"Industrial strength SAT-based alignability algorithm for hardware equivalence verification","author":"daher","year":"2007","journal-title":"Proc Formal Methods Comput -Aided Des"},{"key":"ref6","first-page":"804","article-title":"Deriving all minimal conflict sets using satisfiability algorithms","volume":"37","author":"zhao","year":"2009","journal-title":"Acta Electronica Sinica"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/dimacs\/035\/02","article-title":"Algorithms for the satisfiability(SAT) problem: a survey","author":"gu","year":"1997","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref8","first-page":"399","article-title":"A counterexample of RUE-NRF resolution in strong form","volume":"17","author":"ouyang","year":"1994","journal-title":"Chinese Journal of Computers"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/321250.321253"},{"key":"ref2","first-page":"13","article-title":"Improved design debugging using maximum satisfiability","author":"sean","year":"2007","journal-title":"Proc - Form Methods Comput Aided Des FMCAD 2007"},{"year":"1995","author":"freeman","journal-title":"Improvements to Propositional Satisfiability Search Algorithms","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/368273.368557"}],"event":{"name":"2010 Fifth International Conference on Frontier of Computer Science and Technology (FCST)","start":{"date-parts":[[2010,8,18]]},"location":"Changchun, TBD, China","end":{"date-parts":[[2010,8,22]]}},"container-title":["2010 Fifth International Conference on Frontier of Computer Science and Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5575320\/5575458\/05575738.pdf?arnumber=5575738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:20:32Z","timestamp":1559676032000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5575738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/fcst.2010.13","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}