{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:29:32Z","timestamp":1742916572271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":75,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003371"},{"type":"electronic","value":"9783030003388"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00338-8_3","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:16:42Z","timestamp":1535588202000},"page":"35-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases"],"prefix":"10.1007","author":[{"given":"\u0130smail \u0130lkan","family":"Ceylan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Lukasiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"3_CR1","volume-title":"Foundations of Databases: The Logical Level","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V. (eds.): Foundations of Databases: The Logical Level, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)","edition":"1"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Amarilli, A., Bourhis, P., Senellart, P.: Tractable lineages on treelike instances: limits and extensions. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS-16), pp. 355\u2013370. ACM (2016)","DOI":"10.1145\/2902251.2902301"},{"key":"3_CR3","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2007","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)","edition":"2"},{"key":"3_CR4","unstructured":"Baget, J.F., Mugnier, M.L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 712\u2013717 (2011)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-10843-2_7","volume-title":"Automata, Languages and Programming","author":"C Beeri","year":"1981","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73\u201385. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_7"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcss.1995.1017","volume":"50","author":"R Beigel","year":"1995","unstructured":"Beigel, R., Reingold, N., Spielman, D.: PP is closed under intersection. J. Comput. Syst. Sci. 50(2), 191\u2013202 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/2661643","volume":"39","author":"M Bienvenu","year":"2014","unstructured":"Bienvenu, M., Cate, B.T., Lutz, C., Wolter, F.: Ontology-based data access: A study through disjunctive Datalog, CSP, and MMSNP. ACM Trans. Database Syst. (TODS) 39(4), 33:1\u201333:44 (2014)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Borgwardt, S., Ceylan, \u0130.\u0130., Lukasiewicz, T.: Ontology-mediated queries for probabilistic databases. In: Proceedings of the 31th AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1063\u20131069. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10680"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Borgwardt, S., Ceylan, \u0130.\u0130., Lukasiewicz, T.: Recent advances in querying probabilistic knowledge bases. In: Lang, J. (ed.) Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, IJCAI-ECAI 2018. IJCAI\/AAAI Press (2018)","DOI":"10.24963\/ijcai.2018\/765"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1613\/jair.3873","volume":"48","author":"A Cal\u00ec","year":"2013","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115\u2013174 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","volume":"14","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57\u201383 (2012)","journal-title":"J. Web Semant."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.artint.2012.08.002","volume":"193","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: The query answering problem. Artif. Intell. 193, 87\u2013128 (2012)","journal-title":"Artif. Intell."},{"key":"3_CR13","unstructured":"Ceylan, \u0130.\u0130.: Query answering in probabilistic data and knowledge bases. Ph.D. thesis, Technische Universit\u00e4t Dresden (2017)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Ceylan, \u0130.\u0130., Borgwardt, S., Lukasiewicz, T.: Most probable explanations for probabilistic database queries. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 950\u2013956. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/132"},{"key":"3_CR15","unstructured":"Ceylan, \u0130.\u0130., Darwiche, A., Van den Broeck, G.: Open-world probabilistic databases. In: Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pp. 339\u2013348. AAAI Press (2016)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ceylan, \u0130.\u0130., Darwiche, A., Van den Broeck, G.: Open-world probabilistic databases: an abridged report. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 4796\u20134800. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/669"},{"key":"3_CR17","unstructured":"Ceylan, \u0130.\u0130., Lukasiewicz, T., Pe\u00f1aloza, R.: Complexity results for probabilistic Datalog$$\\pm $$. In: Proceedings of the 28th European Conference on Artificial Intelligence (ECAI 2016). Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1414\u20131422. IOS Press (2016)"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Ceylan, \u0130.\u0130., Pe\u00f1aloza, R.: Probabilistic query answering in the Bayesian description logic $$\\cal{BE{}L}$$. In: Beierle, C., Dekhtyar, A. (eds.) SUM 2015. LNCS (LNAI), vol. 9310, pp. 21\u201335. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23540-0_2","DOI":"10.1007\/978-3-319-23540-0_2"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Ceylan, \u0130.\u0130., Pe\u00f1aloza, R.: The Bayesian ontology language $$\\cal{BEL}$$. J. Autom. Reason. 58(1), 67\u201395 (2017)","DOI":"10.1007\/s10817-016-9386-0"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N Dalvi","year":"2007","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J. 16(4), 523\u2013544 (2007)","journal-title":"VLDB J."},{"issue":"6","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2395116.2395119","volume":"59","author":"N Dalvi","year":"2012","unstructured":"Dalvi, N., Suciu, D.: The dichotomy of probabilistic inference for unions of conjunctive queries. J. ACM 59(6), 1\u201387 (2012)","journal-title":"J. ACM"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-87993-0_13","volume-title":"Scalable Uncertainty Management","author":"C d\u2019Amato","year":"2008","unstructured":"d\u2019Amato, C., Fanizzi, N., Lukasiewicz, T.: Tractable reasoning with Bayesian description logics. In: Greco, S., Lukasiewicz, T. (eds.) SUM 2008. LNCS (LNAI), vol. 5291, pp. 146\u2013159. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87993-0_13"},{"key":"3_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811357","volume-title":"Modeling and Reasoning with Bayesian Networks","author":"A Darwiche","year":"2009","unstructured":"Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)"},{"key":"3_CR24","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2468\u20132473. Morgan Kaufmann (2007)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., Zhang, W.: Knowledge Vault: A Web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 601\u2013610. ACM (2014)","DOI":"10.1145\/2623330.2623623"},{"issue":"9","key":"3_CR26","doi-asserted-by":"publisher","first-page":"938","DOI":"10.14778\/2777598.2777603","volume":"8","author":"X Dong","year":"2015","unstructured":"Dong, X., Gabrilovich, E., Murphy, K., Dang, V., Horn, W., Lugaresi, C., Sun, S., Zhang, W.: Knowledge-based trust: Estimating the trustworthiness of Web sources. Proc. VLDB Endowment 8(9), 938\u2013949 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"3_CR27","unstructured":"Fader, A., Soderland, S., Etzioni, O.: Identifying relations for open information extraction. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp. 1535\u20131545. Association for Computational Linguistics (2011)"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"3_CR29","first-page":"235","volume":"56","author":"DA Ferrucci","year":"2012","unstructured":"Ferrucci, D.A.: Introduction to \u201cThis is Watson\u201d. IBM J. Res. Dev. 56(3), 235\u2013249 (2012)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2012.06.009","volume":"199\u2013200","author":"D Ferrucci","year":"2013","unstructured":"Ferrucci, D., Levas, A., Bagchi, S., Gondek, D., Mueller, E.T.: Watson: Beyond Jeopardy!. Artif. Intell. 199\u2013200, 93\u2013105 (2013)","journal-title":"Artif. Intell."},{"issue":"1","key":"3_CR31","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. Database Syst. (TOIS) 15(1), 32\u201366 (1997)","journal-title":"ACM Trans. Database Syst. (TOIS)"},{"issue":"4","key":"3_CR32","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"JT Gill","year":"1977","unstructured":"Gill, J.T.: Computatonal complexity of probabilistic turing machines. SIAM J. Comput. 6(4), 675\u2013695 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10472-013-9342-1","volume":"69","author":"G Gottlob","year":"2013","unstructured":"Gottlob, G., Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Query answering under probabilistic uncertainty in Datalog$$\\pm $$ ontologies. Ann. Math. Artif. Intell. 69(1), 37\u201372 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Gurevich, Y., Hirsch, C.: The complexity of query reliability. In: Proceedings of the 17th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 1998), pp. 227\u2013234. ACM (1998)","DOI":"10.1145\/275487.295124"},{"key":"3_CR35","unstructured":"Greenemeier, L.: Human traffickers caught on hidden internet. Sci. Am. 8 (2015)"},{"issue":"7","key":"3_CR36","doi-asserted-by":"publisher","first-page":"552","DOI":"10.14778\/2904483.2904487","volume":"9","author":"E Gribkoff","year":"2016","unstructured":"Gribkoff, E., Suciu, D.: SlimShot: In-database probabilistic inference for knowledge bases. Proc. VLDB Endowment 9(7), 552\u2013563 (2016)","journal-title":"Proc. VLDB Endowment"},{"key":"3_CR37","unstructured":"Gribkoff, E., Van den Broeck, G., Suciu, D.: The most probable database problem. In: Proceedings of the 1st International Workshop on Big Uncertain Data (BUDA) (2014)"},{"key":"3_CR38","unstructured":"Gribkoff, E., Van den Broeck, G., Suciu, D.: Understanding the complexity of lifted inference and asymmetric weighted model counting. In: Proceedings of the 30th Annual Conference on Uncertainty in Artificial Intelligence (UAI 2014), pp. 280\u2013289. AUAI Press (2014)"},{"issue":"4","key":"3_CR39","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4), 695\u2013716 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2012.06.001","volume":"194","author":"J Hoffart","year":"2013","unstructured":"Hoffart, J., Suchanek, F.M., Berberich, K., Weikum, G.: YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia. Artif. Intell. 194, 28\u201361 (2013)","journal-title":"Artif. Intell."},{"issue":"4","key":"3_CR41","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T Imieliski","year":"1984","unstructured":"Imieliski, T., Lipski, W.: Incomplete information in relational databases. J. ACM 31(4), 761\u2013791 (1984)","journal-title":"J. ACM"},{"key":"3_CR42","unstructured":"Jaeger, M.: Relational Bayesian networks. In: Proceedings of the 23rd Annual Conference on Uncertainty in Artificial Intelligence (UAI 1997), pp. 266\u2013273. Morgan Kaufmann (1997)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-35176-1_12","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"JC Jung","year":"2012","unstructured":"Jung, J.C., Lutz, C.: Ontology-based access to probabilistic data with OWL QL. In: Cudr\u00e9-Mauroux, P., et al. (eds.) ISWC 2012. LNCS, vol. 7649, pp. 182\u2013197. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35176-1_12"},{"key":"3_CR44","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"key":"3_CR45","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 963\u2013968. AAAI Press (2011)"},{"issue":"6","key":"3_CR46","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1093\/jamia\/ocv071","volume":"22","author":"JP Ku","year":"2015","unstructured":"Ku, J.P., Hicks, J.L., Hastie, T., Leskovec, J., R\u00e9, C., Delp, S.L.: The mobilize center: an NIH big data to knowledge center to advance human movement research and improve mobility. J. Am. Med. Inform. Assoc. 22(6), 1120\u20131125 (2015)","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"3_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1"},{"key":"3_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.505","volume":"9","author":"ML Littman","year":"1998","unstructured":"Littman, M.L., Goldsmith, J., Mundhenk, M.: The computational complexity of probabilistic planning. J. Artif. Intell. Res. 9, 1\u201336 (1998)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"3_CR49","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 Semant. 6(4), 291\u2013308 (2008)","journal-title":"J. Web Semant."},{"key":"3_CR50","unstructured":"Mitchell, T., et al.: Never-ending learning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 2302\u20132310 (2015)"},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-87993-0_26","volume-title":"Scalable Uncertainty Management","author":"D Olteanu","year":"2008","unstructured":"Olteanu, D., Huang, J.: Using OBDDs for efficient query evaluation on probabilistic databases. In: Greco, S., Lukasiewicz, T. (eds.) SUM 2008. LNCS (LNAI), vol. 5291, pp. 326\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87993-0_26"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Olteanu, D., Huang, J.: Secondary-storage confidence computation for conjunctive queries with inequalities. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 389\u2013402. ACM (2009)","DOI":"10.1145\/1559845.1559887"},{"key":"3_CR53","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"3_CR54","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Burlington (1988)"},{"issue":"12","key":"3_CR55","doi-asserted-by":"publisher","first-page":"e113523","DOI":"10.1371\/journal.pone.0113523","volume":"9","author":"SE Peters","year":"2014","unstructured":"Peters, S.E., Zhang, C., Livny, M., R\u00e9, C.: A machine reading system for assembling synthetic paleontological databases. PLoS One 9(12), e113523 (2014)","journal-title":"PLoS One"},{"key":"3_CR56","first-page":"133","volume":"10","author":"A Poggi","year":"2008","unstructured":"Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. 10, 133\u2013173 (2008)","journal-title":"J. Data Semant."},{"issue":"1\u20132","key":"3_CR57","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0004-3702(97)00027-1","volume":"94","author":"D Poole","year":"1997","unstructured":"Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94(1\u20132), 7\u201356 (1997)","journal-title":"Artif. Intell."},{"issue":"4","key":"3_CR58","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"JS Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"3_CR59","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s00778-009-0151-4","volume":"18","author":"C R\u00e9","year":"2009","unstructured":"R\u00e9, C., Suciu, D.: The trichotomy of having queries on a probabilistic database. VLDB J. 18(5), 1091\u20131116 (2009)","journal-title":"VLDB J."},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R Reiter","year":"1978","unstructured":"Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 55\u201376. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-1-4684-3384-5_3"},{"issue":"1","key":"3_CR61","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1), 107\u2013136 (2006)","journal-title":"Mach. Learn."},{"issue":"3","key":"3_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1379759.1379763","volume":"55","author":"B Rossman","year":"2008","unstructured":"Rossman, B.: Homomorphism preservation theorems. J. ACM 55(3), 1\u201353 (2008)","journal-title":"J. ACM"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming (ICLP 1995), pp. 715\u2013729. MIT Press (1995)","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"3_CR64","unstructured":"Sato, T., Kameya, Y.: PRISM: A language for symbolic-statistical modeling. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1330\u20131335. Morgan Kaufmann (1997)"},{"issue":"11","key":"3_CR65","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.14778\/2809974.2809991","volume":"8","author":"J Shin","year":"2015","unstructured":"Shin, J., Wu, S., Wang, F., De Sa, C., Zhang, C., R\u00e9, C.: Incremental knowledge base construction using DeepDive. Proc. VLDB Endowment 8(11), 1310\u20131321 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"3_CR66","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 1st edn. International Thomson Publishing, Boston (1996)","edition":"1"},{"issue":"1","key":"3_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2009.03.004","volume":"35","author":"S Staworko","year":"2010","unstructured":"Staworko, S., Chomicki, J.: Consistent query answers in the presence of universal constraints. Inf. Syst. 35(1), 1\u201322 (2010)","journal-title":"Inf. Syst."},{"key":"3_CR68","series-title":"Synthesis Lectures on Data Management","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01879-4","volume-title":"Probabilistic Databases","author":"D Suciu","year":"2011","unstructured":"Suciu, D., Olteanu, D., R\u00e9, C., Koch, C.: Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2011)"},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Toda, S.: On the computational power of PP and $$\\oplus $$P. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 514\u2013519 (1989)","DOI":"10.1109\/SFCS.1989.63527"},{"issue":"1","key":"3_CR70","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)90369-Q","volume":"100","author":"S Toda","year":"1992","unstructured":"Toda, S., Watanabe, O.: Polynomial-time 1-turing reductions from #PH to #P. Theor. Comput. Sci. 100(1), 205\u2013221 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR71","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR72","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Lewis, H.R., Simons, B.B., Burkhard, W.A., Landweber, L.H. (eds.) Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"3_CR73","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03927-4"},{"issue":"3","key":"3_CR74","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"KW Wagner","year":"1986","unstructured":"Wagner, K.W.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23(3), 325\u2013356 (1986)","journal-title":"Acta Informatica"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"Wu, W., Li, H., Wang, H., Zhu, K.Q.: Probase: A probabilistic taxonomy for text understanding. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 481\u2013492. ACM (2012)","DOI":"10.1145\/2213836.2213891"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Learning, Uncertainty, Streaming, and Scalability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00338-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:43:54Z","timestamp":1709833434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00338-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003371","9783030003388"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00338-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"30 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Reasoning Web","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reasoning Web International Summer School","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Esch-sur-Alzette","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rweb2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.ruleml-rr.org\/rw.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}