{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:39Z","timestamp":1763468019925,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1938551.1938574","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"162-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Knowledge compilation meets database theory"],"prefix":"10.1145","author":[{"given":"Abhay","family":"Jha","sequence":"first","affiliation":[{"name":"University of Washington, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00042-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000128"},{"key":"e_1_3_2_1_3_1","first-page":"688","volume-title":"DAC","author":"Bryant R. E.","year":"1985","unstructured":"R. E. Bryant . Symbolic manipulation of boolean functions using a graphical representation . In DAC , pages 688 -- 694 , 1985 . R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In DAC, pages 688--694, 1985."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.73590"},{"key":"e_1_3_2_1_6_1","volume-title":"A survey on knowledge compilation. AI Commun., 10(3,4):137--150","author":"Cadoli M.","year":"1997","unstructured":"M. Cadoli and F. M. Donini . A survey on knowledge compilation. AI Commun., 10(3,4):137--150 , 1997 . M. Cadoli and F. M. Donini. A survey on knowledge compilation. AI Commun., 10(3,4):137--150, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265571"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265531"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807113"},{"key":"e_1_3_2_1_12_1","volume-title":"On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR, cs.AI\/0003044","author":"Darwiche A.","year":"2000","unstructured":"A. Darwiche . On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR, cs.AI\/0003044 , 2000 . A. Darwiche. On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR, cs.AI\/0003044, 2000."},{"issue":"1","key":"e_1_3_2_1_13_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_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00041-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.324545"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.09.016"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514930"},{"key":"e_1_3_2_1_19_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 . V. Gurvich. Repetition-free boolean functions. Uspekhi Mat. Nauk, 32:183--184, 1977.","journal-title":"Uspekhi Mat. Nauk"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87993-0_26"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322221"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920975"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00078-W"},{"key":"e_1_3_2_1_24_1","volume-title":"Cambridge University Press","author":"Stanley R. P.","year":"1997","unstructured":"R. P. Stanley . Enumerative Combinatorics . Cambridge University Press , 1997 . R. P. Stanley. Enumerative Combinatorics. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739043"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719789","volume-title":"Branching programs and binary decision diagrams: theory and applications","author":"Wegener I.","year":"2000","unstructured":"I. Wegener . Branching programs and binary decision diagrams: theory and applications . SIAM , 2000 . I. Wegener. Branching programs and binary decision diagrams: theory and applications. SIAM, 2000."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00297-X"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","acronym":"EDBT\/ICDT '11","location":"Uppsala Sweden"},"container-title":["Proceedings of the 14th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938574","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938574"}},"subtitle":["compiling queries to decision diagrams"],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":27,"alternative-id":["10.1145\/1938551.1938574","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938574","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}