{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T22:10:02Z","timestamp":1748470202653,"version":"3.41.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196466"},{"type":"electronic","value":"9783319196473"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19647-3_22","type":"book-chapter","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T09:03:08Z","timestamp":1435309388000},"page":"229-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Model Counting via Extension Rule"],"prefix":"10.1007","author":[{"given":"Jinyan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingli","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","volume":"193","author":"J Rintanen","year":"2012","unstructured":"Rintanen, J.: Planning as satisfiability: heuristics. Artif. Intell. 193, 45\u201386 (2012)","journal-title":"Artif. Intell."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.knosys.2012.06.011","volume":"36","author":"D Cai","year":"2012","unstructured":"Cai, D., Yin, M.: On the utility of landmarks in SAT based planning. Knowl.-Based Syst. 36, 146\u2013154 (2012)","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"22_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.3233\/AIC-140603","volume":"27","author":"H Nakhost","year":"2014","unstructured":"Nakhost, H., Mller, M.: Towards a theory of random walk planning: regress factors. fair homogeneous graphs and extensions. AI Communications 27(4), 329\u2013344 (2014)","journal-title":"AI Communications"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for # SAT and bayesian inference. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 340\u2013351 (2003)","DOI":"10.1109\/SFCS.2003.1238208"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1613\/jair.3232","volume":"40","author":"W Li","year":"2011","unstructured":"Li, W., Poupart, P., Beek, P.V.: Exploiting structure in weighted model counting approaches to probabilistic inference. J. Artif. Intell. Res. 40, 729\u2013765 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2289","volume":"30","author":"C Domshlak","year":"2007","unstructured":"Domshlak, C., Hoffmann, J.: Probabilistic planning via heuristic forward search and weighted model counting. J. Artif. Intell. Res. 30, 565\u2013620 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR7","unstructured":"Satish Kumar, T.K.: A model counting characterization of diagnoses. In: 13th International Workshop on Principles of Diagnosis, pp. 70\u201376 (2002)"},{"issue":"7","key":"22_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/S0306-4379(02)00079-0","volume":"28","author":"S Zhang","year":"2003","unstructured":"Zhang, S., Zhang, C., Yan, X.: Post-mining: maintenance of association rules by weighting. Inf. Syst. 28(7), 691\u2013707 (2003)","journal-title":"Inf. Syst."},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TKDE.2003.1185839","volume":"15","author":"X Wu","year":"2003","unstructured":"Wu, X., Zhang, S.: Synthesizing high-frequency rules from different data sources. IEEE Trans. Knowl. Data Eng. 15(2), 353\u2013367 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR10","first-page":"633","volume-title":"Frontiers in Artificial Intelligence and Applications","author":"CP Gomes","year":"2009","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting, handbook of satisfiability. In: Biere, A., et al. (eds.) Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 633\u2013654. IOS Press, Amsterdam (2009)"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.601","volume":"10","author":"E Birnbaum","year":"1999","unstructured":"Birnbaum, E., Lozinskii, E.: The good old davis-putnam procedure helps counting models. J. Artif. Intell. Res. 10, 457\u2013477 (1999)","journal-title":"J. Artif. Intell. Res."},{"issue":"7","key":"22_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"22_CR13","unstructured":"Bayardo Jr., R.J., Pehoushek, J.D.: Counting models using connected components. In: Seventeenth National Conference on Artificial Intelligence (AAAI), pp. 157\u2013162 (2000)"},{"key":"22_CR14","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), pp. 20\u201328 (2004)"},{"key":"22_CR15","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)"},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.2648","volume":"34","author":"F Bacchus","year":"2009","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Solving # SAT and bayesian inference with backtracking search. J. Artif. Intell. Res. 34, 391\u2013442 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR17","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. 3569, pp. 324\u2013339. Springer, Heidelberg (2005)"},{"key":"22_CR18","unstructured":"Wei, W., Erenrich, J., Selman, B.: Towards efficient sampling: exploiting random walk strategies. In: Nineteenth National Conference on Artificial Intelligence (AAAI), pp. 670\u2013676 (2004)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"MR Jweeum","year":"1986","unstructured":"Jweeum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169\u2013188 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR20","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., Selman, B.: From sampling to model counting. In: Twentieth International Joint Conference on Artificial Intelligence (IJCAI), pp. 2293\u20132299 (2007)"},{"key":"22_CR21","unstructured":"Gogate, V., Dechter, R.: Approximate counting by sampling the backtrackfree search space. In: Twenty-Second National Conference on Artificial Intelligence (AAAI), pp. 198\u2013203 (2007)"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-009-0680-7","volume":"184","author":"L Kroc","year":"2011","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Leveraging belief propagation, backtrack search, and statistics for model counting. Ann. Oper. Res. 184(1), 209\u2013231 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1027339205632","volume":"31","author":"H Lin","year":"2003","unstructured":"Lin, H., Sun, J.: Zhang, Y.: Theorem proving based on extension rule. J. Autom. Reasoning 31(1), 11\u201321 (2003)","journal-title":"J. Autom. Reasoning"},{"issue":"2","key":"22_CR24","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/0218026","volume":"18","author":"K Iwama","year":"1989","unstructured":"Iwama, K.: CNF satisfiability test by counting and polynomial average time. SIAM J. Comput. 18(2), 385\u2013391 (1989)","journal-title":"SIAM J. Comput."},{"key":"22_CR25","unstructured":"Yin, M., Sun, J.: Counting models using extension rules. In: Twenty-Second National Conference on Artificial Intelligence (AAAI), pp. 1916\u20131917 (2007)"},{"issue":"7","key":"22_CR26","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.3724\/SP.J.1001.2009.03320","volume":"20","author":"M Yin","year":"2009","unstructured":"Yin, M., Lin, H., Sun, J.: Solving # SAT using extension rules. J. Softw. 20(7), 1714\u20131725 (2009)","journal-title":"J. Softw."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-21581-0_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"H Bennett","year":"2011","unstructured":"Bennett, H., Sankaranarayanan, S.: Model counting using the inclusion-exclusion principle. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 362\u2013363. Springer, Heidelberg (2011)"},{"issue":"4","key":"22_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"N Linial","year":"1990","unstructured":"Linial, N., Nisan, N.: Approximate inclusion-exclusion. Combinatorica 10(4), 349\u2013365 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"22_CR29","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01271266","volume":"16","author":"J Kahn","year":"1996","unstructured":"Kahn, J., Linial, N., Samorodnitsky, A.: Inclusion-exclusion: exact and approximate. Combinatorica 16(4), 465\u2013477 (1996)","journal-title":"Combinatorica"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Trick, M., Johnson, D.S (eds.) Second DIMACS Challenge on Cliques, Coloring and Satisfiability, pp. 521\u2013532 (1993)","DOI":"10.1090\/dimacs\/026\/25"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19647-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T21:48:51Z","timestamp":1748468931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19647-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196466","9783319196473"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19647-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}