{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:48Z","timestamp":1773481788294,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FWO","award":["G042815N"],"award-info":[{"award-number":["G042815N"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER IIS-1762268"],"award-info":[{"award-number":["CAREER IIS-1762268"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319900","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1295-1312","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Anytime Approximation in Probabilistic Databases via Scaled Dissociations"],"prefix":"10.1145","author":[{"given":"Maarten","family":"Van den Heuvel","sequence":"first","affiliation":[{"name":"University of Antwerp, Antwerp, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ivanov","sequence":"additional","affiliation":[{"name":"Northeastern Unversity, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[{"name":"Northeastern Unversity, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Floris","family":"Geerts","sequence":"additional","affiliation":[{"name":"University of Antwerp, Antwerp, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Theobald","sequence":"additional","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.369042"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0080-z"},{"key":"e_1_3_2_1_4_1","volume-title":"Nonlinear programming. Athena scientific","author":"Bertsekas D. P.","year":"1999","unstructured":"D. P. Bertsekas . Nonlinear programming. Athena scientific , 1999 . D. P. Bertsekas. Nonlinear programming. Athena scientific, 1999."},{"key":"e_1_3_2_1_5_1","first-page":"738","volume-title":"AAAI","author":"Boddy M. S.","year":"1991","unstructured":"M. S. Boddy . Anytime problem solving using dynamic programming . In AAAI , pages 738 -- 743 , 1991 . M. S. Boddy. Anytime problem solving using dynamic programming. In AAAI, pages 738--743, 1991."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066277"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395119"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15675-5_2"},{"issue":"1","key":"e_1_3_2_1_11_1","first-page":"229","article-title":"A knowledge compilation map","volume":"17","author":"Darwiche A.","year":"2002","unstructured":"A. Darwiche and P. Marquis . A knowledge compilation map . J. Artif. Int. Res. , 17 ( 1 ): 229 -- 264 , 2002 . A. Darwiche and P. Marquis. A knowledge compilation map. J. Artif. Int. Res., 17(1):229--264, 2002.","journal-title":"J. Artif. Int. Res."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3164891"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544819"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140445"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0310-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938575"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/239041.239045"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532641"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735494"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0434-5"},{"key":"e_1_3_2_1_22_1","first-page":"256","volume-title":"UAI","author":"Gogate V.","year":"2011","unstructured":"V. Gogate and P. M. Domingos . Probabilistic theorem proving . In UAI , pages 256 -- 265 , 2011 . V. Gogate and P. M. Domingos. Probabilistic theorem proving. In UAI, pages 256--265, 2011."},{"key":"e_1_3_2_1_23_1","volume-title":"Read-once functions","author":"Golumbic M. C.","year":"2010","unstructured":"M. C. Golumbic and V. Gurvich . Read-once functions , chapter 10. Boolean Functions : Theory, Algorithms and Applications. Cambridge University Press , 2010 . M. C. Golumbic and V. Gurvich. Read-once functions, chapter 10. Boolean Functions: Theory, Algorithms and Applications. Cambridge University Press, 2010."},{"key":"e_1_3_2_1_24_1","first-page":"633","volume-title":"Handbook of Satisfiability","author":"Gomes C. P.","year":"2009","unstructured":"C. P. Gomes , A. Sabharwal , and B. Selman . Model counting . In Handbook of Satisfiability , pages 633 -- 654 . IOS Press , 2009 . C. P. Gomes, A. Sabharwal, and B. Selman. Model counting. In Handbook of Satisfiability, pages 633--654. IOS Press, 2009."},{"key":"e_1_3_2_1_25_1","first-page":"183","article-title":"Repetition-free Boolean functions","volume":"32","author":"Gurvich V.","year":"1977","unstructured":"V. Gurvich . Repetition-free Boolean functions . Uspekhi Mat. Nauk , 32 : 183 -- 184 , 1977 . (in Russian). V. Gurvich. Repetition-free Boolean functions. Uspekhi Mat. Nauk, 32:183--184, 1977. (in Russian).","journal-title":"Uspekhi Mat. Nauk"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350236"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989411"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497596"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1795555"},{"key":"e_1_3_2_1_31_1","volume-title":"CIDR","author":"Mahdisoltani F.","year":"2015","unstructured":"F. Mahdisoltani , J. Biega , and F. M. Suchanek . YAGO3: A knowledge base from multilingual wikipedias . In CIDR , 2015 . F. Mahdisoltani, J. Biega, and F. M. Suchanek. YAGO3: A knowledge base from multilingual wikipedias. In CIDR, 2015."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87993-0_26"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559887"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.123"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447826"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7687-1_786"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367934"},{"issue":"1","key":"e_1_3_2_1_38_1","first-page":"25","article-title":"Query evaluation on probabilistic databases","volume":"29","author":"R\u00e9 C.","year":"2006","unstructured":"C. R\u00e9 , N. N. Dalvi , and D. Suciu . Query evaluation on probabilistic databases . IEEE Data Eng. Bull. , 29 ( 1 ): 25 -- 31 , 2006 . C. R\u00e9, N. N. Dalvi, and D. Suciu. Query evaluation on probabilistic databases. IEEE Data Eng. Bull., 29(1):25--31, 2006.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453943"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87993-0_3"},{"key":"e_1_3_2_1_42_1","first-page":"475","volume-title":"AAAI","author":"Sang T.","year":"2005","unstructured":"T. Sang , P. Bearne , and H. Kautz . Performing Bayesian inference by weighted model counting . In AAAI , pages 475 -- 481 , 2005 . T. Sang, P. Bearne, and H. Kautz. Performing Bayesian inference by weighted model counting. In AAAI, pages 475--481, 2005."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453944"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920975"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809991"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031527"},{"key":"e_1_3_2_1_47_1","unstructured":"TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/.  TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_3_2_1_48_1","volume-title":"Carreira-Perpi n \u00e1 n. Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application. CoRR, abs\/1309.1541","author":"Wang W.","year":"2013","unstructured":"W. Wang and M. \u00c1. Carreira-Perpi n \u00e1 n. Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application. CoRR, abs\/1309.1541 , 2013 . W. Wang and M. \u00c1. Carreira-Perpi n \u00e1 n. Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application. CoRR, abs\/1309.1541, 2013."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213891"},{"issue":"3","key":"e_1_3_2_1_50_1","first-page":"73","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"Zilberstein S.","year":"1996","unstructured":"S. Zilberstein . Using anytime algorithms in intelligent systems . AI Magazine , 17 ( 3 ): 73 -- 83 , 1996 . S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73--83, 1996.","journal-title":"AI Magazine"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319900","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:22Z","timestamp":1750207402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":49,"alternative-id":["10.1145\/3299869.3319900","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319900","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}