{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:10:36Z","timestamp":1744902636217},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030028367"},{"type":"electronic","value":"9783030028374"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02837-4_8","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T05:21:45Z","timestamp":1546233705000},"page":"95-106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast and Efficient Method for #2SAT via Graph Transformations"],"prefix":"10.1007","author":[{"given":"Marco A.","family":"L\u00f3pez","sequence":"first","affiliation":[]},{"given":"J. Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"De Ita","sequence":"additional","affiliation":[]},{"given":"Rosa M.","family":"Valdovinos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-30498-2_43","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2004","author":"G Ita Luna","year":"2004","unstructured":"Ita Luna, G.: Polynomial classes of boolean formulas for computing the degree of belief. In: Lema\u00eetre, C., Reyes, C.A., Gonz\u00e1lez, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 430\u2013440. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30498-2_43"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/s00453-015-0030-x","volume":"76","author":"D Paulusma","year":"2016","unstructured":"Paulusma, D., Slivovsky, F., Szeider, S.: Model counting for cnf formulas of bounded modular treewidth. Algorithmica 76(1), 168\u2013194 (2016)","journal-title":"Algorithmica"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-79723-4_19","volume-title":"Parameterized and Exact Computation","author":"M Wahlstr\u00f6m","year":"2008","unstructured":"Wahlstr\u00f6m, M.: A tighter bound for counting max-weight solutions to 2SAT instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202\u2013213. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79723-4_19"},{"issue":"9","key":"8_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ipl.2013.02.013","volume":"113","author":"M Schmitt","year":"2013","unstructured":"Schmitt, M., Wanka, R.: Exploiting independent subformulas: a faster approximation scheme for #k-sat. Inf. Process. Lett. 113(9), 337\u2013344 (2013)","journal-title":"Inf. Process. Lett."},{"key":"8_CR6","unstructured":"Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world sat instances. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, AAAI 1997\/IAAI 1997, pp. 203\u2013208. AAAI Press (1997)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 424\u2013429. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11814948_38"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-24318-4_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"J Burchard","year":"2015","unstructured":"Burchard, J., Schubert, T., Becker, B.: Laissez-faire caching for parallel #SAT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 46\u201361. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_5"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188\u2013202. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24605-3_15"},{"key":"8_CR10","unstructured":"De Ita, G., Bello L\u00f3pez, P., Gonz\u00e1lez, M.C.: New polynomial classes for #2SAT established via graph-topological structure. Eng. Lett. 15, 250\u2013258 (2007)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-27060-9_16","volume-title":"Advances in Artificial Intelligence and Soft Computing","author":"JR Marcial-Romero","year":"2015","unstructured":"Marcial-Romero, J.R., De Ita Luna, G., Hern\u00e1ndez, J.A., Valdovinos, R.M.: A parametric polynomial deterministic algorithm for #2SAT. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 202\u2013213. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27060-9_16"},{"key":"8_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J. A. Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, 3rd printing edn. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02837-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T05:24:16Z","timestamp":1546233856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02837-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030028367","9783030028374"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02837-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enseneda","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}