{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T14:08:41Z","timestamp":1791209321515,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642351754","type":"print"},{"value":"9783642351761","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35176-1_12","type":"book-chapter","created":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T06:48:19Z","timestamp":1351234099000},"page":"182-197","source":"Crossref","is-referenced-by-count":16,"title":["Ontology-Based Access to Probabilistic Data with OWL QL"],"prefix":"10.1007","author":[{"given":"Jean Christoph","family":"Jung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and simple relational processing of uncertain data. In: Proc. of ICDE, pp. 983\u2013992 (2008)","DOI":"10.1109\/ICDE.2008.4497507"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s00778-009-0149-y","volume":"18","author":"L. Antova","year":"2009","unstructured":"Antova, L., Koch, C., Olteanu, D.: \n                    \n                      \n                    \n                    $10^{10^6}$\n                   worlds and beyond: efficient representation and processing of incomplete information. VLDB J.\u00a018(5), 1021\u20131040 (2009)","journal-title":"VLDB J."},{"key":"12_CR3","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press (2003)"},{"key":"12_CR4","unstructured":"Bienvenu, M., Lutz, C., Wolter, F.: Query containment in description logics reconsidered. In: Proc. of KR (2012)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boulos, J., Dalvi, N.N., Mandhani, B., Mathur, S., R\u00e9, C., Suciu, D.: MYSTIQ: a system for finding more answers by using probabilities. In: Proc. of SIGMOD, pp. 891\u2013893 (2005)","DOI":"10.1145\/1066157.1066277"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D. Calvanese","year":"2007","unstructured":"Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning\u00a039(3), 385\u2013429 (2007)","journal-title":"J. Autom. Reasoning"},{"issue":"7","key":"12_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1538788.1538810","volume":"52","author":"N.N. Dalvi","year":"2009","unstructured":"Dalvi, N.N., R\u00e9, C., Suciu, D.: Probabilistic databases: diamonds in the dirt. Commun. ACM\u00a052(7), 86\u201394 (2009)","journal-title":"Commun. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Dalvi, N.N., Schnaitter, K., Suciu, D.: Computing query probability with incidence algebras. In: Proc. of PODS, pp. 203\u2013214. ACM (2010)","DOI":"10.1145\/1807085.1807113"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N.N. Dalvi","year":"2007","unstructured":"Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J.\u00a016(4), 523\u2013544 (2007)","journal-title":"VLDB J."},{"key":"12_CR10","unstructured":"Dalvi, N.N, Suciu, D.: The Dichotomy of Probabilistic Inference for Unions of Conjunctive Queries. Submitted to Journal of the ACM"},{"key":"12_CR11","unstructured":"Finger, M., Wassermann, R., Cozman, F.G.: Satisfiability in \n                    \n                      \n                    \n                    ${\\mathcal EL}$\n                   with sets of probabilistic ABoxes. In: Proc. of DL. CEUR-WS, vol.\u00a0745 (2011)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/239041.239045","volume":"15","author":"N. Fuhr","year":"1997","unstructured":"Fuhr, N., R\u00f6lleke, T.: A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst.\u00a015(1), 32\u201366 (1997)","journal-title":"ACM Trans. Inf. Syst."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Furche, T., Gottlob, G., Grasso, G., Gunes, O., Guo, X., Kravchenko, A., Orsi, G., Schallhart, C., Sellers, A.J., Wang, C.: Diadem: domain-centric, intelligent, automated data extraction methodology. In: Proc. of WWW, pp. 267\u2013270. ACM (2012)","DOI":"10.1145\/2187980.2188025"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-23580-1_7","volume-title":"Web Reasoning and Rule Systems","author":"G. Gottlob","year":"2011","unstructured":"Gottlob, G., Lukasiewicz, T., Simari, G.I.: Conjunctive Query Answering in Probabilistic Datalog+\/\u2013 Ontologies. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol.\u00a06902, pp. 77\u201392. Springer, Heidelberg (2011)"},{"issue":"1","key":"12_CR15","first-page":"17","volume":"29","author":"T.J. Green","year":"2006","unstructured":"Green, T.J., Tannen, V.: Models for incomplete and probabilistic information. IEEE Data Engineering Bulletin\u00a029(1), 17\u201324 (2006)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"12_CR16","unstructured":"Gupta, R., Sarawagi, S.: Creating probabilistic databases from information extraction models. In: Proc. of VLDB, pp. 965\u2013976. ACM (2006)"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"J.Y. Halpern","year":"1990","unstructured":"Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell.\u00a046(3), 311\u2013350 (1990)","journal-title":"Artif. Intell."},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"Imielinski, T., Lipski Jr., W.: Incomplete information in relational databases. J. of the ACM\u00a031(4), 761\u2013791 (1984)","journal-title":"J. of the ACM"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci.\u00a043, 169\u2013188 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0097539796298340","volume":"29","author":"D.R. Karger","year":"1999","unstructured":"Karger, D.R.: A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J. Comput.\u00a029(2), 492\u2013514 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Luby, M.: Monte-carlo algorithms for enumeration and reliability problems. In: Proc. of FoCS, pp. 56\u201364. IEEE Computer Society (1983)","DOI":"10.1109\/SFCS.1983.35"},{"key":"12_CR22","unstructured":"Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Proc. of KR. AAAI Press (2010)"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/565117.565137","volume":"31","author":"A.H.F. Laender","year":"2002","unstructured":"Laender, A.H.F., Ribeiro-Neto, B.A., da Silva, A.S., Teixeira, J.S.: A brief survey of web data extraction tools. SIGMOD Record\u00a031(2), 84\u201393 (2002)","journal-title":"SIGMOD Record"},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.websem.2008.04.001","volume":"6","author":"T. Lukasiewicz","year":"2008","unstructured":"Lukasiewicz, T., Straccia, U.: Managing uncertainty and vagueness in description logics for the semantic web. J. Web Sem.\u00a06(4), 291\u2013308 (2008)","journal-title":"J. Web Sem."},{"key":"12_CR25","unstructured":"Lutz, C., Schr\u00f6der, L.: Probabilistic description logics for subjective uncertainty. In Proc. of KR. AAAI Press (2010)"},{"key":"12_CR26","unstructured":"Lutz, C., Wolter, F.: Non-uniform data complexity of query answering in description logics. In: Proc. of KR. AAAI Press (2012)"},{"key":"12_CR27","unstructured":"Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: Proc. of IJCAI, pp. 2468\u20132473. AAAI Press (2007)"},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1379759.1379763","volume":"55","author":"B. Rossmann","year":"2008","unstructured":"Rossmann, B.: Homomorphism preservation theorems. J. ACM\u00a055(3), 1\u201354 (2008)","journal-title":"J. ACM"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Benjelloun, O., Halevy, A.Y., Widom, J.: Working models for uncertain data. In: Proc. of ICDE. IEEE Computer Society (2006)","DOI":"10.1109\/ICDE.2006.174"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2012.02.026","volume":"108","author":"U. Straccia","year":"2012","unstructured":"Straccia, U.: Top-k retrieval for ontology mediated access to relational databases. Information Sciences\u00a0108, 1\u201323 (2012)","journal-title":"Information Sciences"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Suciu, D., Olteanu, D., R\u00e9, C., Koch, C.: Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers (2011)","DOI":"10.2200\/S00362ED1V01Y201105DTM016"},{"issue":"3","key":"12_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"12_CR33","unstructured":"Widom, J.: Trio: A system for integrated management of data, accuracy, and lineage. In: Proc. of CIDR, pp. 262\u2013276 (2005)"},{"issue":"4","key":"12_CR34","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1002\/net.20412","volume":"57","author":"R. Zenklusen","year":"2011","unstructured":"Zenklusen, R., Laumanns, M.: High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks\u00a057(4), 376\u2013388 (2011)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35176-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T10:15:25Z","timestamp":1557310525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35176-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351754","9783642351761"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35176-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}