{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:41:38Z","timestamp":1729651298396,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1109\/date.2008.4484921","type":"proceedings-article","created":{"date-parts":[[2008,4,15]],"date-time":"2008-04-15T22:15:51Z","timestamp":1208297751000},"page":"1087-1090","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Approximation Algorithm for MIN-ONE SAT"],"prefix":"10.1109","author":[{"given":"Lei","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael S.","family":"Hsiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_24"},{"key":"2","first-page":"642","article-title":"distance-sat: complexity and algorithms","author":"bailleux","year":"1999","journal-title":"Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-06) and the collocated 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-06)"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.246"},{"key":"1","first-page":"46","article-title":"pbs: a backtrack search pseudo-boolean solver","author":"aloul","year":"2002","journal-title":"Proceedings of the 5th International Conference on the Theory and Applications of Satisfiability Testing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2006.320089"},{"key":"6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"translating pseudo-boolean constraints into sat","volume":"2","author":"ee?n","year":"2006","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"5","first-page":"502","article-title":"an extensible sat-solver","author":"ee?n","year":"2003","journal-title":"Proceedings of the 6th International Conferenceson Theory and Applications of Satisfiability Testing"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"journal-title":"Worst case voltage drops in power and ground buses of CMOS VLSI circuits","year":"1994","author":"kriplani","key":"9"},{"key":"8","first-page":"377","article-title":"solving optimization problems with dll","author":"giunchiglia","year":"2006","journal-title":"Proceedings of the 17th European Conference on Artificial Intelligence"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0049419"},{"key":"12","first-page":"10880","article-title":"validating sat solvers using an independent resolution-based checker: practical implementations and other applications","author":"zhang","year":"2003","journal-title":"Proc Design Automation and Test in Europe"}],"event":{"name":"2008 Design, Automation and Test in Europe","start":{"date-parts":[[2008,3,10]]},"location":"Munich, Germany","end":{"date-parts":[[2008,3,14]]}},"container-title":["2008 Design, Automation and Test in Europe"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4475437\/4484624\/04484921.pdf?arnumber=4484921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T10:45:45Z","timestamp":1588589145000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4484921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/date.2008.4484921","relation":{},"subject":[],"published":{"date-parts":[[2008,3]]}}}