{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:22:11Z","timestamp":1742937731000,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042430"},{"type":"electronic","value":"9783642042447"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04244-7_27","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"335-343","source":"Crossref","is-referenced-by-count":7,"title":["Exploiting Problem Structure for Solution Counting"],"prefix":"10.1007","author":[{"given":"Aur\u00e9lie","family":"Favier","sequence":"first","affiliation":[]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"J\u00e9gou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/BF02944784","volume":"19","author":"L. Aceto","year":"2004","unstructured":"Aceto, L., Hansen, J.A., Ing\u00f3lfsd\u00f3ttir, A., Johnsen, J., Knudsen, J.: The complexity of checking consistency of pedigree information and related problems. Journal of Computer Science Technology\u00a019(1), 42\u201359 (2004)","journal-title":"Journal of Computer Science Technology"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal of Discrete Mathematics\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"27_CR3","unstructured":"Bayardo, R., Pehoushek, J.: Counting models using connected components. In: AAAI 2000, pp. 157\u2013162 (2000)"},{"key":"27_CR4","unstructured":"Choi, A., Darwiche, A.: An edge deletion semantics for belief propagation and its practical impact on approximation quality. In: Proc. of AAAI, pp. 1107\u20131114 (2006)"},{"key":"27_CR5","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, 11\u201334 (2001)","journal-title":"Journal of Applied Non-classical Logic"},{"key":"27_CR6","unstructured":"Darwiche, A.: New advances in compiling cnf to decomposable negation normal form. In: Proc. of ECAI, pp. 328\u2013332 (2004)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(88)90075-3","volume":"20","author":"P.M. Dearing","year":"1988","unstructured":"Dearing, P.M., Shier, D.R., Warner, D.D.: Maximal chordal subgraphs. Discrete Applied Mathematics\u00a020(3), 181\u2013190 (1988)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Dechter, R., Mateescu, R.: The impact of and\/or search spaces on constraint satisfaction and counting. In: Proc. of CP, Toronto, CA, pp. 731\u2013736 (2004)","DOI":"10.1007\/978-3-540-30201-8_56"},{"issue":"2-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2006.11.003","volume":"171","author":"R. Dechter","year":"2007","unstructured":"Dechter, R., Mateescu, R.: And\/or search spaces for graphical models. Artif. Intell.\u00a0171(2-3), 73\u2013106 (2007)","journal-title":"Artif. Intell."},{"key":"27_CR10","unstructured":"Gogate, V., Dechter, R.: Approximate counting by sampling the backtrack-free search space. In: Proc. of AAAI 2007, Vancouver, CA, pp. 198\u2013203 (2007)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gogate, V., Dechter, R.: Approximate solution sampling ( and counting) on and\/or search spaces. In: Proc. of CP 2008, Sydney, AU, pp. 534\u2013538 (2008)","DOI":"10.1007\/978-3-540-85958-1_37"},{"key":"27_CR12","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., Selman, B.: From sampling to model counting. In: Proc. of IJCAI, pp. 2293\u20132299 (2007)"},{"key":"27_CR13","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting: A new strategy for obtaining good bounds. In: Proc. of AAAI-06, Boston, MA (2006)"},{"key":"27_CR14","unstructured":"Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Selman, B.: Counting CSP solutions using generalized XOR constraints. In: Proc. of AAAI 2007, Vancouver, BC, pp. 204\u2013209 (2007)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P. J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence\u00a0146, 43\u201375 (2003)","journal-title":"Artificial Intelligence"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Kask, K., Dechter, R., Gogate, V.: New look-ahead schemes for constraint satisfaction. In: Proc. of AI&M (2004)","DOI":"10.1007\/978-3-540-30201-8_25"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-68155-7_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"L. Kroc","year":"2008","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Leveraging belief propagation, backtrack search, and statistics for model counting. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 127\u2013141. Springer, Heidelberg (2008)"},{"key":"27_CR18","unstructured":"Satish Kumar, T.K.: A model counting characterization of diagnoses. In: Proc. of the 13th International Workshop on Principles of Diagnosis (2002)"},{"key":"27_CR19","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Last conflict based reasoning. In: Proc. of ECAI 2006, Trento, Italy, pp. 133\u2013137 (2006)"},{"issue":"7","key":"27_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00236-007-0056-x","volume":"44","author":"N. Nishimura","year":"2007","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Solving #sat using vertex covers. Acta Inf.\u00a044(7), 509\u2013523 (2007)","journal-title":"Acta Inf."},{"key":"27_CR21","unstructured":"Pesant, G.: Counting solutions of CSPs: A structural approach. In: Proc. of IJCAI, pp. 260\u2013265 (2005)"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Algorithms"},{"issue":"1-2","key":"27_CR23","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 reasonning. Artificial Intelligence\u00a082(1-2), 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"key":"27_CR24","unstructured":"Samer, M., Szeider, S.: A fixed-parameter algorithm for #sat with parameter incidence treewidth (2006)"},{"issue":"1","key":"27_CR25","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10601-007-9029-5","volume":"13","author":"M. Sanchez","year":"2008","unstructured":"Sanchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints\u00a013(1), 130\u2013154 (2008)","journal-title":"Constraints"},{"key":"27_CR26","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: SAT 2004, Vancouver, Canada (2004)"},{"key":"27_CR27","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 Sciences\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Sciences"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/11499107_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"W. Wei","year":"2005","unstructured":"Wei, W., Selman, B.: A new approach to model counting. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 324\u2013339. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:34:24Z","timestamp":1558269264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}