{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:28:20Z","timestamp":1725730100247},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389887"},{"type":"electronic","value":"9783642389894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38989-4_28","type":"book-chapter","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T15:17:56Z","timestamp":1370445476000},"page":"274-283","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"De Ita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Bello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meliza","family":"Contreras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-45193-8_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Angelsmark","year":"2003","unstructured":"Angelsmark, O., Jonsson, P.: Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 81\u201395. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2004.10.037","volume":"332","author":"V. Dahll\u00f6f","year":"2005","unstructured":"Dahll\u00f6f, V., Jonsonn, P., Wahlstr\u00f6m, M.: Counting models for 2SAT and 3SAT formulae. J. Theoretical Computer Sciences\u00a0332(1-3), 265\u2013291 (2005)","journal-title":"J. Theoretical Computer Sciences"},{"issue":"1-2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: On the Tractability of Counting Theory Models and its Application to Belief Revision and Truth Maintenance. J. of Applied Non-classical Logics\u00a011(1-2), 11\u201334 (2001)","journal-title":"J. of Applied Non-classical Logics"},{"key":"28_CR4","first-page":"159","volume":"19","author":"G. Ita De","year":"2006","unstructured":"De Ita, G., Tovar, M.: Applying Counting Models of Boolean Formulas to Propositional Inference. J. Advances in Computer Science and Engineering Researching in Computing Science\u00a019, 159\u2013170 (2006)","journal-title":"J. Advances in Computer Science and Engineering Researching in Computing Science"},{"issue":"2","key":"28_CR5","first-page":"250","volume":"15","author":"G. Ita De","year":"2007","unstructured":"De Ita, G., Bello, P., Contreras, M.: New Polynomial Classes for #2SAT Established via Graph-Topological Structure. Engineering Letters\u00a015(2), 250\u2013258 (2007)","journal-title":"Engineering Letters"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","volume":"81","author":"O. Dubois","year":"1991","unstructured":"Dubois, O.: Counting the number of solutions for instances of satisfiability. J. Theoretical Computer Sciences\u00a081(1), 49\u201364 (1991)","journal-title":"J. Theoretical Computer Sciences"},{"key":"28_CR7","unstructured":"F\u00fcrer, M., Prasad, S.K.: Algorithms for Counting 2-SAT Solutions and Coloring with Applications. Technical Report No. 33, Electronic Colloqium on Comp. Complexity (2005)"},{"key":"28_CR8","unstructured":"Littman, M.L., Pitassi, T., Impagliazzo, R.: On the Complexity of counting satisfying assignments. Technical Report Unpublished manuscript"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. J. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"J. Artificial Intelligence"},{"key":"28_CR10","unstructured":"Russ, B.: Randomized Algorithms: Approximation, Generation, and Counting, Distingished dissertations. Springer (2001)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(95)00144-1","volume":"155","author":"W. Zhang","year":"1996","unstructured":"Zhang, W.: Number of models and satisfiability of set of clauses. J. Theoretical Computer Sciences\u00a0155(1), 277\u2013288 (1996)","journal-title":"J. Theoretical Computer Sciences"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38989-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T15:47:37Z","timestamp":1557762457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38989-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389887","9783642389894"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38989-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}