{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:40:20Z","timestamp":1768434020735,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,15]],"date-time":"2015-08-15T00:00:00Z","timestamp":1439596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,8,15]],"date-time":"2015-08-15T00:00:00Z","timestamp":1439596800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1049862,OCI-0959097,CCF-1139011"],"award-info":[{"award-number":["CNS 1049862,OCI-0959097,CCF-1139011"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10601-015-9204-z","type":"journal-article","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T10:01:29Z","timestamp":1439546489000},"page":"41-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["On computing minimal independent support and its applications to sampling and counting"],"prefix":"10.1007","volume":"21","author":[{"given":"Alexander","family":"Ivrii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharad","family":"Malik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"9204_CR1","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Previti, A., Liffiton, M., & Marques-Silva, J. (2015). Smallest mus extraction with minimal hitting set dualization. In Proceedings of CP (To Appear).","DOI":"10.1007\/978-3-319-23219-5_13"},{"key":"9204_CR2","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Dalmao, S., & Pitassi, T. (2003). Algorithms and complexity results for #SAT and Bayesian inference. In Proceedings of FOCS (pp. 340\u2013351).","DOI":"10.1109\/SFCS.2003.1238208"},{"key":"9204_CR3","unstructured":"Belov, A., & Marques-Silva, J. (2012). Generalizing redundancy in propositional logic: Foundations and hitting sets duality. CoRR abs\/1207.1257."},{"issue":"3\/4","key":"9204_CR4","first-page":"123","volume":"8","author":"A Belov","year":"2012","unstructured":"Belov, A., & Marques-Silva, J. (2012). Muser2: an efficient MUS extractor. JSAT, 8(3\/4), 123\u2013128.","journal-title":"JSAT"},{"key":"9204_CR5","unstructured":"Carter, J. L., & Wegman, M. N. (1977). Universal classes of hash functions. In Proceedings of ACM symposium on Theory of computing (pp. 106\u2013112). ACM."},{"key":"9204_CR6","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K. S., Seshia, S.A., & Vardi, M.Y. (2014). Distribution-aware sampling and weighted model counting for SAT. In Proceedings of AAAI (pp. 1722\u20131730).","DOI":"10.1609\/aaai.v28i1.8990"},{"key":"9204_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., & Vardi, M.Y. (2013). A scalable and nearly uniform generator of SAT witnesses. In Proceedings of CAV (Vol. 8044 pp. 608\u2013623).","DOI":"10.1007\/978-3-642-39799-8_40"},{"key":"9204_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., & Vardi, M.Y. (2013). A scalable approximate model counter. In Proceedings of CP (Vol. 8124 pp. 200\u2013216). Springer.","DOI":"10.1007\/978-3-642-40627-0_18"},{"key":"9204_CR9","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., & Vardi, M.Y. (2014). Balancing scalability and uniformity in SAT witness generator. In Proceedings of DAC (pp. 1\u20136).","DOI":"10.1145\/2593069.2593097"},{"key":"9204_CR10","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., & Vardi, M.Y. (2015). On parallel scalable uniform sat witness generation. In: Proceedings of TACAS (pp. 304\u2013319)."},{"issue":"1","key":"9204_CR11","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2289","volume":"30","author":"C Domshlak","year":"2007","unstructured":"Domshlak, C., & Hoffmann, J. (2007). Probabilistic planning via heuristic forward search and weighted model counting. Journal of Artificial Intelligence Research, 30(1), 565\u2013620.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9204_CR12","unstructured":"Ermon, S., Gomes, C., Sabharwal, A., & Selman, B. (2014). Low-density parity constraints for hashing-based discrete integration. In Proceedings of ICML (pp. 271\u2013279)."},{"key":"9204_CR13","unstructured":"Ermon, S., Gomes, C., Sabharwal, A., & Selman, B. (2013). Embed and project: Discrete sampling with universal hashing. In Proceedings of NIPS (pp. 2085\u20132093)."},{"key":"9204_CR14","unstructured":"Ermon, S., Gomes, C.P., Sabharwal, A., & Selman, B. (2013). Taming the curse of dimensionality: Discrete integration by hashing and optimization. In Proceedings of ICML (pp. 334\u2013342)."},{"key":"9204_CR15","doi-asserted-by":"crossref","unstructured":"Fu, Z., & Malik, S. (2007). Extracting logic circuit structure from conjunctive normal form descriptions. In Professional of VLSID (pp. 37\u201342).","DOI":"10.1109\/VLSID.2007.81"},{"key":"9204_CR16","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., & Selman, B. (2007). Short xors for model counting: from theory to practice. In Proceedings of SAT (100\u2013106).","DOI":"10.1007\/978-3-540-72788-0_13"},{"issue":"4","key":"9204_CR17","doi-asserted-by":"publisher","first-page":"041905","DOI":"10.1103\/PhysRevE.65.041905","volume":"65","author":"I Grosse","year":"2002","unstructured":"Grosse, I., Bernaola-Galv\u00e1n, P., Carpena, P., Rom\u00e1n-Rold\u00e1n, R., Oliver, J., & Stanley, H.E. (2002). Analysis of symbolic sequences using the Jensen-Shannon divergence. Physical Review E, 65(4), 041905.","journal-title":"Physical Review E"},{"key":"9204_CR18","unstructured":"Jerrum, M., & Sinclair, A. (1996). The Markov Chain Monte Carlo method: an approach to approximate counting and integration. In Approximation algorithms for NP-hard problems (pp. 482\u2013520)."},{"issue":"2\u20133","key":"9204_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L., & Vazirani, V. (1986). Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43 (2\u20133), 169\u2013188.","journal-title":"Theoretical Computer Science"},{"key":"9204_CR20","doi-asserted-by":"crossref","unstructured":"Kitchen, N., & Kuehlmann, A. (2007). Stimulus generation for constrained random simulation. In Proceedings of ICCAD (pp. 258\u2013265).","DOI":"10.1109\/ICCAD.2007.4397275"},{"issue":"2","key":"9204_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.artint.2004.11.002","volume":"163","author":"P Liberatore","year":"2005","unstructured":"Liberatore, P. (2005). Redundancy in logic I: CNF propositional formulae. Artificial Intelligence, 163(2), 203\u2013232.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9204_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10601-008-9058-8","volume":"14","author":"MH Liffiton","year":"2009","unstructured":"Liffiton, M.H., Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques-Silva, J., & Sakallah, K.A. (2009). A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints, 14(4), 415\u2013442.","journal-title":"Constraints"},{"issue":"1","key":"9204_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., & Sakallah, K.A. (2008). Algorithms for computing minimal unsatisfiable subsets of constraints. Journal of Automated Reasoning, 40(1), 1\u201333.","journal-title":"Journal of Automated Reasoning"},{"key":"9204_CR24","volume-title":"The theory of relational databases","author":"D Maier","year":"1983","unstructured":"Maier, D. (1983). The theory of relational databases. Rockville: Computer Science Press."},{"issue":"1\u20133","key":"9204_CR25","first-page":"163","volume":"19","author":"J Marques-Silva","year":"2012","unstructured":"Marques-Silva, J. (2012). Computing minimally unsatisfiable subformulas: State of the art and future directions. Multiple-Valued Logic and Soft Computing, 19(1\u20133), 163\u2013183.","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"9204_CR26","unstructured":"Nadel, A. (2010). Boosting minimal unsatisfiable core extraction. In Proceedings 10th international conference on formal methods in computer-aided design (pp. 221\u2013229)."},{"key":"9204_CR27","unstructured":"Naveh, Y., Rimon, M., Jaeger, I., Katz, Y., Vinov, M., Marcus, E., & Shurek, G. (2006). Constraint-based random stimuli generation for hardware verification. In Proceedings of IAAI (pp. 1720\u20131727)."},{"key":"9204_CR28","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Sabharwal, A., & Selman, B. (2007). Near-uniform sampling of combinatorial spaces using XOR constraints. In Proceedings of NIPS (pp. 670\u2013676).","DOI":"10.7551\/mitpress\/7503.003.0065"},{"key":"9204_CR29","unstructured":"Russell, S., & Norvig, P. (2009). Artificial intelligence: A modern approach (3rd Ed.). Prentice Hall."},{"key":"9204_CR30","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., & Pitassi, T. (2004). Combining component caching and clause learning for effective model counting. In Proceedings of SAT."},{"key":"9204_CR31","unstructured":"Sang, T., Bearne, P., & Kautz, H. (2005). Performing bayesian inference by weighted model counting. In Professional of AAAI (pp. 475\u2013481)."},{"issue":"3","key":"9204_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"9204_CR33","unstructured":"Xue, Y., Choi, A., & Darwiche, A. (2012). Basing decisions on sentences in decision diagrams. In Proceedings of AAAI."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9204-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9204-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9204-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9204-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T05:07:50Z","timestamp":1691903270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9204-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,15]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9204"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9204-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,15]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}