{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:57Z","timestamp":1759638717253},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_6","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:35:03Z","timestamp":1283974503000},"page":"81-95","source":"Crossref","is-referenced-by-count":13,"title":["Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Ola","family":"Angelsmark","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-46135-3_22","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"O. Angelsmark","year":"2002","unstructured":"Angelsmark, O., Jonsson, P., Linusson, S., Thapper, J.: Determining the number of solutions to a binary csp instance. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 327. Springer, Heidelberg (2002)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"key":"6_CR3","unstructured":"Bayardo Jr, R.J., Pehoushek, J.D.: Counting models using connected components. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence AAAI\/IAAI, pp. 157\u2013162 (2000)"},{"key":"6_CR4","unstructured":"Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-1999), pp. 856\u2013857 (1999)"},{"key":"6_CR5","unstructured":"Bulatov, A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. Technical report, Computing Laboratory, Oxford University (2003), Available from web.comlab.ox.ac.uk\/oucl\/work\/andrei.bulatov\/counting.ps"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0016","volume":"125","author":"N. Creignou","year":"1996","unstructured":"Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation\u00a0125, 1\u201312 (1996)","journal-title":"Information and Computation"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-45655-4_57","volume-title":"Computing and Combinatorics","author":"V. Dahll\u00f6f","year":"2002","unstructured":"Dahll\u00f6f, V., Jonsson, P., Wahlstr\u00f6m, M.: Counting satisfying assignments in 2-SAT and 3-SAT. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 535\u2013543. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"6_CR8","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 tractable counting of theory models and its applications to truth maintenance and belief revision. Journal of Applied Non-Classical Logic\u00a011(1\u20132), 11\u201334 (2001)","journal-title":"Journal of Applied Non-Classical Logic"},{"issue":"1","key":"6_CR9","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. Theoretical Computer Science\u00a081(1), 49\u201364 (1991)","journal-title":"Theoretical Computer Science"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W","volume":"17","author":"M. Dyer","year":"2000","unstructured":"Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. Random Structures and Algorithms\u00a017, 260\u2013289 (2000)","journal-title":"Random Structures and Algorithms"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018941030227","volume":"24","author":"P.G. Jeavons","year":"1998","unstructured":"Jeavons, P.G., Cohen, D.A., Pearson, J.K.: Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence\u00a024, 51\u201367 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR12","unstructured":"J\u00e9gou, P.: Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In: Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI 1993), Washington DC, USA, July 1993, pp. 731\u2013736; American Association for Artificial Intelligence (1993)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O. Kullman","year":"1999","unstructured":"Kullman, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical. Computer Science\u00a0223, 1\u201372 (1999)","journal-title":"Theoretical. Computer Science"},{"issue":"1","key":"6_CR14","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint-satisfaction problems: A survey. AI Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"AI Magazine"},{"key":"6_CR15","unstructured":"Littman, M.L., Pitassi, T., Impagliazzo, R.: On the complexity of counting satisfying assignments (2001) (unpublished manuscript)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"6_CR17","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. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"key":"6_CR18","unstructured":"Satish Kumar, T.K.: A model counting characterization of diagnoses. In: Proceedings of the Thirteenth International Workshop on Principles of Diagnosis, pp. 70\u201376 (2002)"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR21","unstructured":"Wahlstr\u00f6m, M.: An algorithm for #2SAT. Technical report, Department of Computer Science, Link\u00f6ping, Sweden. In preparation. Preliminary version (2003), available from \n                    \n                      http:\/\/www.ida.liu.se\/~magwa\/research\/num2sat.ps"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:01:38Z","timestamp":1553047298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}