{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:39:02Z","timestamp":1648759142677},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> The counting exact satisfiablity problem (#XSAT) is a problem that computes the number of truth assignments satisfying only one literal in each clause. This paper presents an algorithm that solves the #XSAT problem in O(1.1995<jats:sup>n<\/jats:sup>), which is faster than the best algorithm running in O(1.2190<jats:sup>n<\/jats:sup>), where n denotes the number of variables. To increase the efficiency of the algorithm, a new principle, called common literals principle, is addressed to simplify formulae. This allows us to further eliminate literals. In addition, we firstly apply the resolution principles into solving #XSAT problem, and therefore it improves the efficiency of the algorithm further. <\/jats:p>","DOI":"10.1142\/s0129054114500270","type":"journal-article","created":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T07:47:17Z","timestamp":1414482437000},"page":"667-678","source":"Crossref","is-referenced-by-count":2,"title":["NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY"],"prefix":"10.1142","volume":"25","author":[{"given":"JUNPING","family":"ZHOU","sequence":"first","affiliation":[{"name":"School of Computer Science, Northeast Normal University, Renmin Street, Changchun, 130117, P. R. China"}]},{"given":"WEIHUA","family":"SU","sequence":"additional","affiliation":[{"name":"School of Computer Science, Northeast Normal University, Renmin Street, Changchun, 130117, P. R. China"}]},{"given":"JIANAN","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Computer Science, Northeast Normal University, Renmin Street, Changchun, 130117, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2014,10,28]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9741-4"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"p_3","first-page":"388","author":"Park","year":"2002","journal-title":"Canada"},{"key":"p_4","first-page":"475","author":"Sang","year":"2005","journal-title":"USA"},{"key":"p_5","first-page":"292","author":"Dahll\u00f6f","year":"2002","journal-title":"USA"},{"key":"p_6","first-page":"278","author":"Porschen","year":"2005","journal-title":"Slovakia"},{"key":"p_7","first-page":"50","author":"Porschen","year":"2006","journal-title":"Italy"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.02.035"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-005-0096-0"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.023"},{"key":"p_12","first-page":"624","author":"Li Xin","year":"2007","journal-title":"China"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.12.004"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.11.002"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.001"},{"key":"p_16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"Xu Ke","year":"2000","journal-title":"J Artif Intell Res."},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.001"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114500270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:01:38Z","timestamp":1565114498000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114500270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":16,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2014,10,28]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S0129054114500270"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114500270","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}