{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:23Z","timestamp":1750308623353,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0905276"],"award-info":[{"award-number":["IIS-0905276"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,26]]},"DOI":"10.1145\/2274576.2274596","type":"proceedings-article","created":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T15:32:03Z","timestamp":1339774323000},"page":"182-195","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Learning schema mappings"],"prefix":"10.1145","author":[{"given":"Balder","family":"ten Cate","sequence":"first","affiliation":[{"name":"UC Santa Cruz"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Dalmau","sequence":"additional","affiliation":[{"name":"Universitat Pompeu Fabra"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[{"name":"UC Santa Cruz & IBM Research--Almaden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.011"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497409"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807120"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989338"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022821128753"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022692615781"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992675"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1026"},{"key":"e_1_3_2_1_9_1","volume-title":"An Introduction to Computational Learning Theory","author":"Anthony M.","year":"1992","unstructured":"M. Anthony and N. Biggs . An Introduction to Computational Learning Theory . Cambridge University Press , 1992 . M. Anthony and N. Biggs. An Introduction to Computational Learning Theory. Cambridge University Press, 1992."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1558334.1558341"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0059-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90114-1"},{"key":"e_1_3_2_1_13_1","first-page":"1267","volume-title":"VLDB","author":"Bonifati A.","year":"2005","unstructured":"A. Bonifati , E. Q. Chang , T. Ho , V. S. Lakshmanan , and R. Pottinger . HePToX: Marrying XML and Heterogeneity in Your P2P Databases . In VLDB , pages 1267 -- 1270 , 2005 . A. Bonifati, E. Q. Chang, T. Ho, V. S. Lakshmanan, and R. Pottinger. HePToX: Marrying XML and Heterogeneity in Your P2P Databases. In VLDB, pages 1267--1270, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00034-4"},{"key":"e_1_3_2_1_17_1","volume-title":"PAC-learning recursive logic programs: Efficient algorithms. J. Artif. Intell. Res. (JAIR), 2:501--539","author":"Cohen W. W.","year":"1995","unstructured":"W. W. Cohen . PAC-learning recursive logic programs: Efficient algorithms. J. Artif. Intell. Res. (JAIR), 2:501--539 , 1995 . W. W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. J. Artif. Intell. Res. (JAIR), 2:501--539, 1995."},{"key":"e_1_3_2_1_18_1","volume-title":"PAC-learning recursive logic programs: Negative results. J. Artif. Intell. Res. (JAIR), 2:541--573","author":"Cohen W. W.","year":"1995","unstructured":"W. W. Cohen . PAC-learning recursive logic programs: Negative results. J. Artif. Intell. Res. (JAIR), 2:541--573 , 1995 . W. W. Cohen. PAC-learning recursive logic programs: Negative results. J. Artif. Intell. Res. (JAIR), 2:541--573, 1995."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804683"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511532"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1O16\/j.tcs.2004.10.033"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.208"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.007"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1216155.1216159"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.221"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667055"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90294-K"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066252"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022601210986"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/234752.234755"},{"key":"e_1_3_2_1_32_1","first-page":"238","volume-title":"ALT","author":"Hirata K.","year":"2000","unstructured":"K. Hirata . On the hardness of learning acyclic conjunctive queries . In ALT , pages 238 -- 251 , 2000 . K. Hirata. On the hardness of learning acyclic conjunctive queries. In ALT, pages 238--251, 2000."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174647"},{"key":"e_1_3_2_1_34_1","volume-title":"An Introduction to Computational Learning Theory","author":"Kearns M. J.","year":"1997","unstructured":"M. J. Kearns and U. V. Vazirani . An Introduction to Computational Learning Theory . The MIT Press , 1997 . M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, 1997."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065176"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022648800760"},{"key":"e_1_3_2_1_40_1","volume-title":"P. G. Kolaitis, and W. C. Tan. Database constraints and homomorphism dualities. In CP","author":"B.","year":"2010","unstructured":"B. ten Cate , P. G. Kolaitis, and W. C. Tan. Database constraints and homomorphism dualities. In CP , 2010 . B. ten Cate, P. G. Kolaitis, and W. C. Tan. Database constraints and homomorphism dualities. In CP, 2010."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_42_1","first-page":"560","volume-title":"IJCAI","author":"Valiant L. G.","year":"1985","unstructured":"L. G. Valiant . Learning disjunctions of conjunctions . In IJCAI , pages 560 -- 566 , 1985 . L. G. Valiant. Learning disjunctions of conjunctions. In IJCAI, pages 560--566, 1985."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375729"}],"event":{"name":"ICDT '12: 15th International Conference on Database Theory","acronym":"ICDT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2274576.2274596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:44Z","timestamp":1750273664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":42,"alternative-id":["10.1145\/2274576.2274596","10.1145\/2274576"],"URL":"https:\/\/doi.org\/10.1145\/2274576.2274596","relation":{},"subject":[],"published":{"date-parts":[[2012,3,26]]},"assertion":[{"value":"2012-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}