乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T07:36:41Z","timestamp":1725694601972},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463664.2465223","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"213-224","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Ontology-based data access"],"prefix":"10.1145","author":[{"given":"Meghyn","family":"Bienvenu","sequence":"first","affiliation":[{"name":"CNRS and Universite Paris Sud, Paris, France"}]},{"given":"Balder","family":"ten Cate","sequence":"additional","affiliation":[{"name":"University of California at Santa Cruz, Santa Cruz, CA, USA"}]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043656"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.31"},{"key":"e_1_3_2_1_3_1","volume-title":"KR","author":"Baader F.","year":"2010","unstructured":"F. Baader , M. Bienvenu , C. Lutz , and F. Wolter . Query and predicate emptiness in description logics . In KR , 2010 . F. Baader, M. Bienvenu, C. Lutz, and F. Wolter. Query and predicate emptiness in description logics. In KR, 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1215128"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283516.2283519"},{"key":"e_1_3_2_1_6_1","volume-title":"LICS","author":"B\u00e1r\u00e1ny V.","year":"2010","unstructured":"V. B\u00e1r\u00e1ny , G. Gottlob , and M. Otto . Querying the guarded fragment . In LICS , 2010 . V. B\u00e1r\u00e1ny, G. Gottlob, and M. Otto. Querying the guarded fragment. In LICS, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350250"},{"key":"e_1_3_2_1_8_1","volume-title":"ICALP","author":"B\u00e1r\u00e1ny V.","year":"2011","unstructured":"V. B\u00e1r\u00e1ny , B. ten Cate , and L. Segoufin . Guarded negation . In ICALP , 2011 . V. B\u00e1r\u00e1ny, B. ten Cate, and L. Segoufin. Guarded negation. In ICALP, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.32"},{"key":"e_1_3_2_1_10_1","volume-title":"KR","author":"Bienvenu M.","year":"2012","unstructured":"M. Bienvenu , C. Lutz , and F. Wolter . Query containment in description logics reconsidered . In KR , 2012 . M. Bienvenu, C. Lutz, and F. Wolter. Query containment in description logics reconsidered. In KR, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/381193"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/090778493"},{"key":"e_1_3_2_1_13_1","unstructured":"A. Bulatov. Bounded relational width. In preparation. %Manuscript available from http:\/\/www.cs.sfu.ca\/abulatov\/mpapers.html. A. Bulatov. Bounded relational width. In preparation. %Manuscript available from http:\/\/www.cs.sfu.ca\/abulatov\/mpapers.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2017990.2018016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.002"},{"key":"e_1_3_2_1_17_1","volume-title":"KR","author":"Calvanese D.","year":"2006","unstructured":"D. Calvanese , G. D. Giacomo , D. Lembo , M. Lenzerini , and R. Rosati . Data complexity of query answering in description logics . In KR , 2006 . D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In KR, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275504"},{"key":"e_1_3_2_1_20_1","volume-title":"IJCAI","author":"Grau B. Cuenca","year":"2013","unstructured":"B. Cuenca Grau , M. Kaminski , and B. Motik Computing Datalog Rewritings Beyond Horn Ontologies . In IJCAI , 2013 B. Cuenca Grau, M. Kaminski, and B. Motik Computing Datalog Rewritings Beyond Horn Ontologies. In IJCAI, 2013"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"e_1_3_2_1_22_1","volume-title":"DL","author":"Eiter T.","year":"2012","unstructured":"T. Eiter , M. Ortiz , M. Simkus , T.-K. Tran , and G. Xiao . Towards practical query answering for Horn-SHIQ . In DL , 2012 . T. Eiter, M. Ortiz, M. Simkus, T.-K. Tran, and G. Xiao. Towards practical query answering for Horn-SHIQ. In DL, 2012."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.12.015"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.017"},{"key":"e_1_3_2_1_26_1","unstructured":"R. Freese M. Kozik A. Krokhin M. Mar\u00f3ti R. KcKenzie and R. Willard. On Maltsev conditions associated with omitting certain types of local structures. In preparation. http:\/\/www.math.hawaii.edu\/~ralph\/Classes\/619\/OmittingTypesMaltsev.pdf R. Freese M. Kozik A. Krokhin M. Mar\u00f3ti R. KcKenzie and R. Willard. On Maltsev conditions associated with omitting certain types of local structures. In preparation. http:\/\/www.math.hawaii.edu\/~ralph\/Classes\/619\/OmittingTypesMaltsev.pdf"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/504077.504079"},{"key":"e_1_3_2_1_28_1","volume-title":"KR","author":"Gottlob G.","year":"2012","unstructured":"G. Gottlob and T. Schwentick . Rewriting ontological queries into small nonrecursive datalog programs . In KR , 2012 . G. Gottlob and T. Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In KR, 2012."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9080-3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_26"},{"key":"e_1_3_2_1_31_1","volume-title":"KR","author":"Kontchakov R.","year":"2010","unstructured":"R. Kontchakov , C. Lutz , D. Toman , F. Wolter , and M. Zakharyaschev . The combined approach to query answering in DL-Lite . In KR , 2010 . R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev. The combined approach to query answering in DL-Lite. In KR, 2010."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779419.1779444"},{"key":"e_1_3_2_1_33_1","volume-title":"http:\/\/arxiv.org\/abs\/0706.1701v1","author":"Kun G.","year":"2007","unstructured":"G. Kun . Constraints, MMSNP , and Expander Structures . http:\/\/arxiv.org\/abs\/0706.1701v1 , 2007 . G. Kun. Constraints, MMSNP, and Expander Structures. http:\/\/arxiv.org\/abs\/0706.1701v1, 2007."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.027"},{"key":"e_1_3_2_1_35_1","volume-title":"A characterisation of first-order constraint satisfaction problems. Logical Methods in Comp. Sci., 3(4)","author":"Larose B.","year":"2007","unstructured":"B. Larose , C. Loten , and C. Tardif . A characterisation of first-order constraint satisfaction problems. Logical Methods in Comp. Sci., 3(4) , 2007 . B. Larose, C. Loten, and C. Tardif. A characterisation of first-order constraint satisfaction problems. Logical Methods in Comp. Sci., 3(4), 2007."},{"key":"e_1_3_2_1_36_1","volume-title":"KR","author":"Lutz C.","year":"2012","unstructured":"C. Lutz and F. Wolter . Non-uniform data complexity of query answering in description logics . In KR , 2012 . C. Lutz and F. Wolter. Non-uniform data complexity of query answering in description logics. In KR, 2012."},{"key":"e_1_3_2_1_37_1","volume-title":"Logical Methods in Comp. Sci., 5(2)","author":"Madelaine F. R.","year":"2009","unstructured":"F. R. Madelaine . Universal structures and the logic of forbidden patterns. Logical Methods in Comp. Sci., 5(2) , 2009 . F. R. Madelaine. Universal structures and the logic of forbidden patterns. Logical Methods in Comp. Sci., 5(2), 2009."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/050634840"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793934.1793939"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.24"},{"key":"e_1_3_2_1_42_1","volume-title":"KR","author":"Rosati R.","year":"2010","unstructured":"R. Rosati and A. Almatelli . Improving Query Answering over DL-Lite Ontologies . In KR , 2010 . R. Rosati and A. Almatelli. Improving Query Answering over DL-Lite Ontologies. In KR, 2010."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379763"},{"key":"e_1_3_2_1_44_1","volume-title":"Type-elimination-based reasoning for the description logic SHIQ using decision diagrams and disjunctive datalog. Logical Methods in Comp. Sci., 8(1)","author":"Rudolph S.","year":"2012","unstructured":"S. Rudolph , M. Kr\u00f6tzsch , and P. Hitzler . Type-elimination-based reasoning for the description logic SHIQ using decision diagrams and disjunctive datalog. Logical Methods in Comp. Sci., 8(1) , 2012 . S. Rudolph, M. Kr\u00f6tzsch, and P. Hitzler. Type-elimination-based reasoning for the description logic SHIQ using decision diagrams and disjunctive datalog. Logical Methods in Comp. Sci., 8(1), 2012."},{"key":"e_1_3_2_1_45_1","volume-title":"DL","author":"Simancik F.","year":"2012","unstructured":"F. Simancik . Elimination of complex RIAs without automata. In DL , 2012 . F. Simancik. Elimination of complex RIAs without automata. In DL, 2012."},{"key":"e_1_3_2_1_46_1","volume-title":"STACS","author":"B.","year":"2011","unstructured":"B. ten Cate and L. Segoufin. Unary negation . In STACS , 2011 . B. ten Cate and L. Segoufin. Unary negation. In STACS, 2011."},{"key":"e_1_3_2_1_47_1","unstructured":"W3C OWL Working Group. OWL 2 Web Ontology Language. http:\/\/www.w3.org\/TR\/owl2-overview\/ 2012. W3C OWL Working Group. OWL 2 Web Ontology Language. http:\/\/www.w3.org\/TR\/owl2-overview\/ 2012."}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463664.2465223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:06:08Z","timestamp":1703185568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463664.2465223"}},"subtitle":["a study through disjunctive datalog, CSP, and MMSNP"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":46,"alternative-id":["10.1145\/2463664.2465223","10.1145\/2463664"],"URL":"https:\/\/doi.org\/10.1145\/2463664.2465223","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}