{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:46Z","timestamp":1773481786478,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"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"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-233599"],"award-info":[{"award-number":["FP7-ICT-233599"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1938551.1938575","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"174-185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["On the optimal approximation of queries using tractable propositional languages"],"prefix":"10.1145","author":[{"given":"Robert","family":"Fink","sequence":"first","affiliation":[{"name":"Oxford University Computing Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Olteanu","sequence":"additional","affiliation":[{"name":"Oxford University Computing Laboratory"}],"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.1145\/1247480.1247559"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538810"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_3_2_1_4_1","first-page":"17","author":"Darwiche A.","year":"2002","unstructured":"A. Darwiche and P. Marquis . \"A knowlege compilation map\". Journal of AI Research , 17 , 2002 . A. Darwiche and P. Marquis. \"A knowlege compilation map\". Journal of AI Research, 17, 2002.","journal-title":"Journal of AI Research"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02882-3_49"},{"key":"e_1_3_2_1_6_1","volume-title":"On the Optimal Approximation of Queries Using Tractable Propositional Languages. {Extended version, available on author's homepage}","author":"Fink R.","year":"2011","unstructured":"R. Fink and D. Olteanu . On the Optimal Approximation of Queries Using Tractable Propositional Languages. {Extended version, available on author's homepage} . 2011 . R. Fink and D. Olteanu. On the Optimal Approximation of Queries Using Tractable Propositional Languages. {Extended version, available on author's homepage}. 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767912"},{"key":"e_1_3_2_1_8_1","volume-title":"VLDB","author":"Garofalakis M.","year":"2001","unstructured":"M. Garofalakis and P. Gibbon . Approximate query processing: Taming the terabytes . In VLDB , 2001 . M. Garofalakis and P. Gibbon. Approximate query processing: Taming the terabytes. In VLDB, 2001."},{"key":"e_1_3_2_1_9_1","first-page":"01","volume":"10","author":"Gatterbauer W.","year":"2010","unstructured":"W. Gatterbauer , A. K. Jha , and D. Suciu . Dissociation and propagation for efficient query evaluation over probabilistic databases. TR UW-CSE- 10-04 - 01 , U. Washington, 2010 . W. Gatterbauer, A. K. Jha, and D. Suciu. Dissociation and propagation for efficient query evaluation over probabilistic databases. TR UW-CSE-10-04-01, U. Washington, 2010.","journal-title":"TR UW-CSE-"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2005.06.076"},{"key":"e_1_3_2_1_11_1","volume-title":"Handbook of Satisfiability","author":"Gomes C. P.","year":"2009","unstructured":"C. P. Gomes , A. Sabharwal , and B. Selman . Handbook of Satisfiability , chapter Model Counting. IOS Press , 2009 . C. P. Gomes, A. Sabharwal, and B. Selman. Handbook of Satisfiability, chapter Model Counting. IOS Press, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_3_2_1_13_1","volume-title":"Soviet math. dolk., 43(3)","author":"Gurvich V.","year":"1991","unstructured":"V. Gurvich . Criteria for repetition-freeness of functions in the algebra of logic . In Soviet math. dolk., 43(3) , 1991 . V. Gurvich. Criteria for repetition-freeness of functions in the algebra of logic. In Soviet math. dolk., 43(3), 1991."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/552553"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87993-0_26"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559887"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447826"},{"issue":"4","key":"e_1_3_2_1_20_1","volume":"65","author":"Otto M.","year":"2000","unstructured":"M. Otto . Epsilon Logic is More Expressive than First-Order Logic over Finite Structures. J. Symb. Log. , 65 ( 4 ), 2000 . M. Otto. Epsilon Logic is More Expressive than First-Order Logic over Finite Structures. J. Symb. Log., 65(4), 2000.","journal-title":"Finite Structures. J. Symb. Log."},{"key":"e_1_3_2_1_21_1","volume-title":"IFIP Workshop on Logic and Architecture Synthesis","author":"Pe'er J.","year":"1995","unstructured":"J. Pe'er and R. Y. Pinter . Minimal decomposition of boolean functions using non-repeating literal trees . In IFIP Workshop on Logic and Architecture Synthesis , 1995 . J. Pe'er and R. Y. Pinter. Minimal decomposition of boolean functions using non-repeating literal trees. In IFIP Workshop on Logic and Architecture Synthesis, 1995."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322221"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226644"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920975"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321602"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","location":"Uppsala Sweden","acronym":"EDBT\/ICDT '11"},"container-title":["Proceedings of the 14th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938575","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.1938575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":26,"alternative-id":["10.1145\/1938551.1938575","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938575","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"}}]}}