{"type":"ScholarlyArticle","title":"Recent Advances in Querying Probabilistic Knowledge Bases","authors":[{"name":"Stefan Borgwardt","slug":"stefan-borgwardt","given":"Stefan","family":"Borgwardt","affiliation":"Faculty of Computer Science , Technische Universität Dresden , Germany"},{"name":"İsmail İlkan Ceylan","slug":"ismail-ilkan-ceylan","given":"İsmail İlkan","family":"Ceylan","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Thomas Lukasiewicz","slug":"thomas-lukasiewicz","given":"Thomas","family":"Lukasiewicz","affiliation":"Department of Computer Science , University of Oxford , UK"}],"abstract":"We give a survey on recent advances at the forefront of research on probabilistic knowledge bases for representing and querying large-scale automatically extracted data. We concentrate especially on increasing the semantic expressivity of formalisms for representing and querying probabilistic knowledge (i) by giving up the closed-world assumption, (ii) by allowing for commonsense knowledge (and in parallel giving up the tuple-independence assumption), and (iii) by giving up the closed-domain assumption, while preserving some computational properties of query answering in such formalisms.","doi":"10.24963/ijcai.2018/765","url":"https://ijcai.org/proceedings/2018/765","pdf":"https://ijcai.org/proceedings/2018/0765.pdf","markdown":"https://ijcai.org/proceedings/2018/765.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/765","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Survey track","track":"Survey track","number":765,"pages":{"first":5420,"last":5426},"keywords":["Uncertainty in AI: Exact Probabilistic Inference","Knowledge Representation and Reasoning: Logics for Knowledge Representation","Uncertainty in AI: Uncertainty in AI"],"videos":[],"references":[{"position":1,"raw":"[Antova et al., 2008] Lyublena Antova, Thomas Jansen, Christoph Koch, and Dan Olteanu. Fast and simple relational processing of uncertain data. In Proc. of ICDE, pages 983-992, 2008.","title":"Fast and simple relational processing of uncertain data","authors":"Antova","year":"2008","venue":"Proc. of ICDE","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baral et al., 2009] Chitta Baral, Michael Gelfond, and J. Nelson Rushton. Probabilistic reasoning with answer sets. Theory and Practice of Logic Programming, 9(1):57-144, 2009.","title":"Probabilistic reasoning with answer sets","authors":"Chitta Baral, Michael Gelfond, J Nelson Rushton","year":"2009","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bárány et al., 2017] Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, and Zografoula Vagena. Declara- tive probabilistic programming with Datalog. ACM TODS, 42(4):22:1-22:35, 2017.","title":"Declarative probabilistic programming with Datalog","authors":"Vince Bárány, Benny Balder Ten Cate, Dan Kimelfeld, Zografoula Olteanu, Vagena","year":"2017","venue":"ACM TODS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Beame et al., 2017] Paul Beame, Jerry Li, Sudeepa Roy, and Dan Suciu. Exact model counting of query expressions: Limitations of propositional methods. ACM TODS, 42(1):1:1-1:46, 2017.","title":"Exact model counting of query expressions: Limitations of propositional methods","authors":"Paul Beame, Jerry Li, Sudeepa Roy, Dan Suciu","year":"2017","venue":"ACM TODS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Borgwardt et al., 2017] Stefan Borgwardt, İsmail İlkan Ceylan, and Thomas Lukasiewicz. Ontology-mediated queries for prob- abilistic databases. In Proc. of AAAI, pages 1063-1069, 2017.","title":"Ontology-mediated queries for probabilistic databases","authors":"Stefan Borgwardt, İsmail İlkan Ceylan, Thomas Lukasiewicz","year":"2017","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Boulos et al., 2005] Jihad Boulos, Nilesh Dalvi, Bhushan Mand- hani, Shobhit Mathur, Chris Ré, and Dan Suciu. MYSTIQ: A system for finding more answers by using probabilities. In Proc. of ACM SIGMOD, pages 891-893, 2005.","title":"MYSTIQ: A system for finding more answers by using probabilities","authors":"Boulos","year":"2005","venue":"Proc. of ACM SIGMOD","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Ceylan and Peñaloza, 2015] İsmail İlkan Ceylan and Rafael Peñaloza. Probabilistic query answering in the Bayesian descrip- tion logic BEL. In Proc. of SUM, pages 21-35. Springer, 2015.","title":"İsmail İlkan Ceylan and Rafael Peñaloza. Probabilistic query answering in the Bayesian description logic BEL","authors":"Peñaloza Ceylan","year":"2015","venue":"Proc. of SUM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ceylan and Peñaloza, 2017] İsmail İlkan Ceylan and Rafael Peñaloza. The Bayesian ontology language BEL. J. Autom. Rea- soning, 58(1):67-95, 2017.","title":"İsmail İlkan Ceylan and Rafael Peñaloza. The Bayesian ontology language BEL","authors":"Peñaloza Ceylan","year":"2017","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ceylan et al., 2016a] İsmail İlkan Ceylan, Adnan Darwiche, and Guy Van den Broeck. Open-world probabilistic databases. In Proc. of KR, pages 339-348. AAAI Press, 2016.","title":"Open-world probabilistic databases","authors":"Ceylan","year":"2016","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ceylan et al., 2016b] İsmail İlkan Ceylan, Thomas Lukasiewicz, and Rafael Peñaloza. Complexity results for probabilistic Datalog ± . In Proc. of ECAI, pages 1414-1422, 2016.","title":"Complexity results for probabilistic Datalog ±","authors":"Ceylan","year":"2016","venue":"Proc. of ECAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ceylan et al., 2017] İsmail İlkan Ceylan, Stefan Borgwardt, and Thomas Lukasiewicz. Most probable explanations for probabi- listic database queries. In Proc. of IJCAI, pages 950-956, 2017.","title":"Most probable explanations for probabilistic database queries","authors":"Stefan İsmail İlkan Ceylan, Thomas Borgwardt, Lukasiewicz","year":"2017","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/132"},{"position":12,"raw":"[Ceylan, 2017] İsmail İlkan Ceylan. Query Answering in Proba- bilistic Data and Knowledge Bases. PhD thesis, Technische Uni- versität Dresden, 2017.","title":"İsmail İlkan Ceylan. Query Answering in Probabilistic Data and Knowledge Bases","authors":"Ceylan","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Cozman, 2000] Fabio Gagliardi Cozman. Credal networks. AIJ, 120(2):199-233, 2000.","title":"Credal networks","authors":"Fabio Gagliardi, Cozman","year":"2000","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dalvi and Suciu, 2007] Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. The VLDB J., 16(4):523-544, 2007.","title":"Efficient query evaluation on probabilistic databases","authors":"Nilesh Dalvi, Dan Suciu","year":"2007","venue":"The VLDB J","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dalvi and Suciu, 2012] Nilesh Dalvi and Dan Suciu. The di- chotomy of probabilistic inference for unions of conjunctive queries. J. ACM, 59(6):1-87, 2012.","title":"The dichotomy of probabilistic inference for unions of conjunctive queries","authors":"Nilesh Dalvi, Dan Suciu","year":"2012","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Dalvi et al., 2009] Nilesh Dalvi, Christopher Ré, and Dan Suciu. Probabilistic databases: Diamonds in the dirt. Comm. ACM, 52(7):86-94, 2009.","title":"Probabilistic databases: Diamonds in the dirt","authors":"Nilesh Dalvi, Christopher Ré, Dan Suciu","year":"2009","venue":"Comm. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"['Amato et al., 2008] Claudia d'Amato, Nicola Fanizzi, and Thomas Lukasiewicz. Tractable reasoning with Bayesian de- scription logics. In Proc. of SUM, pages 146-159, 2008.","title":"Tractable reasoning with Bayesian description logics","authors":"Amato","year":"2008","venue":"Proc. of SUM","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[De Raedt and Kimmig, 2015] Luc De Raedt and Angelika Kim- mig. Probabilistic (logic) programming concepts. Mach. Learn., 100(1), 2015.","title":"Probabilistic (logic) programming concepts","authors":"De Raedt, Kimmig","year":"2015","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[De Raedt et al., 2007] Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. ProbLog: A probabilistic Prolog and its ap- plication in link discovery. In Proc. of IJCAI, pages 2462-2467, 2007.","title":"ProbLog: A probabilistic Prolog and its application in link discovery","authors":"De Raedt","year":"2007","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/396"},{"position":20,"raw":"[De Sa et al., 2016] Christopher De Sa, Alex Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, and Ce Zhang. Deep- Dive: Declarative knowledge base construction. SIGMOD Rec., 45(1):60-67, 2016.","title":"Deep-Dive: Declarative knowledge base construction","authors":"Christopher De Sa, Alex Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, Ce Zhang","year":"2016","venue":"SIGMOD Rec","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[De Sa et al., 2017] Christopher De Sa, Alex Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, and Ce Zhang. Incremen- tal knowledge base construction using DeepDive. The VLDB J., 26(1):81-105, 2017.","title":"Incremental knowledge base construction using DeepDive","authors":"Christopher De Sa, Alex Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, Ce Zhang","year":"2017","venue":"The VLDB J","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dong et al., 2014] Xin Dong, Evgeniy Gabrilovich, Geremy Heitz, Wilko Horn, Ni Lao, Kevin Murphy, Thomas Strohmann, Shaohua Sun, and Wei Zhang. Knowledge Vault: A web-scale approach to probabilistic knowledge fusion. In Proc. of ACM SIGKDD, pages 601-610, 2014.","title":"Knowledge Vault: A web-scale approach to probabilistic knowledge fusion","authors":"Xin Dong, Evgeniy Gabrilovich, Geremy Heitz, Wilko Horn, Ni Lao, Kevin Murphy, Thomas Strohmann, Shaohua Sun, Wei Zhang","year":"2014","venue":"Proc. of ACM SIGKDD","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Dong et al., 2015] Xin Dong, Evgeniy Gabrilovich, Kevin Mur- phy, Van Dang, Wilko Horn, Camillo Lugaresi, Shaohua Sun, and Wei Zhang. Knowledge-based trust: Estimating the trust- worthiness of web sources. Proc. of VLDB, 8(9):938-949, 2015.","title":"Knowledge-based trust: Estimating the trustworthiness of web sources","authors":"Xin Dong, Evgeniy Gabrilovich, Kevin Murphy, Van Dang, Wilko Horn, Camillo Lugaresi, Shaohua Sun, Wei Zhang","year":"2015","venue":"Proc. of VLDB","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Fink et al., 2011] Robert Fink, Andrew Hogue, Dan Olteanu, and Swaroop Rath. Sprout2: A squared query engine for uncertain web data. In Proc. of ACM SIGMOD, pages 1299-1302, 2011.","title":"Sprout2: A squared query engine for uncertain web data","authors":"Robert Fink, Andrew Hogue, Dan Olteanu, Swaroop Rath","year":"2011","venue":"Proc. of ACM SIGMOD","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Fuhr and Rölleke, 1997] Norbert Fuhr and Thomas Rölleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM TOIS, 15(1):32-66, 1997.","title":"A probabilistic relational algebra for the integration of information retrieval and database systems","authors":"Rölleke Fuhr, Norbert Fuhr, Thomas Rölleke","year":"1997","venue":"ACM TOIS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Fuhr, 1995] Norbert Fuhr. Probabilistic Datalog-A logic for pow- erful retrieval methods. In Proc. of SIGIR, pages 282-290, 1995.","title":"Probabilistic Datalog-A logic for powerful retrieval methods","authors":"Norbert Fuhr","year":"1995","venue":"Proc. of SIGIR","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Gottlob et al., 2013] Georg Gottlob, Thomas Lukasiewicz, Maria Vanina Martinez, and Gerardo I. Simari. Query answering under probabilistic uncertainty in Datalog ± ontologies. Ann. Math. Artif. Intell., 69(1):37-72, 2013.","title":"Query answering under probabilistic uncertainty in Datalog ± ontologies","authors":"Gottlob","year":"2013","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Green and Tannen, 2006] Todd Green and Val Tannen. Models for incomplete and probabilistic information. In Proc. of EDBT Workshops, pages 278-296. Springer, 2006.","title":"Models for incomplete and probabilistic information","authors":"Todd Green, Val Tannen","year":"2006","venue":"Proc. of EDBT Workshops","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Gribkoff and Suciu, 2016] Eric Gribkoff and Dan Suciu. SlimShot: In-database probabilistic inference for knowledge bases. Proc. of VLDB, 9(7), 2016.","title":"SlimShot: In-database probabilistic inference for knowledge bases","authors":"Suciu Gribkoff, Eric Gribkoff, Dan Suciu","year":"2016","venue":"Proc. of VLDB","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Gribkoff et al., 2014a] Eric Gribkoff, Guy Van den Broeck, and Dan Suciu. The most probable database problem. In Proc. of BUDA, 2014.","title":"The most probable database problem","authors":"Gribkoff","year":"2014","venue":"Proc. of BUDA","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Gribkoff et al., 2014b] Eric Gribkoff, Guy Van den Broeck, and Dan Suciu. Understanding the complexity of lifted inference and asymmetric weighted model counting. In Proc. of UAI, pages 280-289, 2014.","title":"Understanding the complexity of lifted inference and asymmetric weighted model counting","authors":"Gribkoff","year":"2014","venue":"Proc. of UAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Hossain and Schwitter, 2018] Bayzid Ashik Hossain and Rolf Schwitter. A survey on automatically constructed universal knowledge bases. Sem. Web, 2018. Submitted, available online.","title":"A survey on automatically constructed universal knowledge bases","authors":"Schwitter ; Hossain, Ashik Bayzid, Rolf Hossain, Schwitter","year":"2018","venue":"Sem. Web","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Imieliński and Lipski, 1984] Tomasz Imieliński and Witold Lip- ski. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.","title":"Incomplete information in relational databases","authors":"Tomasz Imieliński, Witold Lipski","year":"1984","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Jaynes, 1957] E. T. Jaynes. Information theory and statistical me- chanics. Physics Review. Series II, 106(4):620-630, 1957.","title":"Information theory and statistical mechanics","authors":"E T Jaynes","year":"1957","venue":"Physics Review. Series II","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Jha and Suciu, 2013] Abhay Jha and Dan Suciu. Knowledge com- pilation meets database theory: Compiling queries to decision diagrams. Theor. Comput. Syst., 52(3), 2013.","title":"Knowledge compilation meets database theory: Compiling queries to decision diagrams","authors":"Abhay Jha, Dan Suciu","year":"2013","venue":"Theor. Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Jung and Lutz, 2012] Jean Christoph Jung and Carsten Lutz. Ontology-based access to probabilistic data with OWL QL. In Proc. of ISWC, Part I, pages 182-197, 2012.","title":"Ontology-based access to probabilistic data with OWL QL","authors":"Jung, Lutz, Jean, Christoph Jung, Carsten Lutz","year":"2012","venue":"Proc. of ISWC, Part I","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Kanagal et al., 2011] Bhargav Kanagal, Jian Li, and Amol Desh- pande. Sensitivity analysis and explanations for robust query evaluation in probabilistic databases. In Proc. of SIGMOD, pages 841-852, 2011.","title":"Sensitivity analysis and explanations for robust query evaluation in probabilistic databases","authors":"Bhargav Kanagal, Jian Li, Amol Deshpande","year":"2011","venue":"Proc. of SIGMOD","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Karp et al., 1989] Richard M. Karp, Michael Luby, and Neal Madras. Monte-Carlo approximation algorithms for enumeration problems. J. Alg., 10(3):429 -448, 1989.","title":"Monte-Carlo approximation algorithms for enumeration problems","authors":"Richard M Karp, Michael Luby, Neal Madras","year":"1989","venue":"J. Alg","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Kern-Isberner and Lukasiewicz, 2004] Gabriele Kern-Isberner and Thomas Lukasiewicz. Combining probabilistic logic programming with the power of maximum entropy. AIJ, 157(1/2):139-202, 2004.","title":"Combining probabilistic logic programming with the power of maximum entropy","authors":"Gabriele Kern-Isberner, Thomas Lukasiewicz","year":"2004","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Kersting andDe Raedt, 2001] Kristian Kersting and LucDe Raedt. Towards combining inductive logic programming with Bayesian networks. In Proc. of ILP, pages 118-131, 2001.","title":"Towards combining inductive logic programming with Bayesian networks","authors":"Raedt Kersting, Kristian Kersting, Lucde Raedt","year":"2001","venue":"Proc. of ILP","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Koller and Friedman, 2009] Daphne Koller and Nir Friedman. Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009.","title":"Probabilistic Graphical Models: Principles and Techniques","authors":"Friedman Koller, Daphne Koller, Nir Friedman","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Krompaß et al., 2014] Denis Krompaß, Maximilian Nickel, and Volker Tresp. Querying factorized probabilistic triple databases. In Proc. of ISWC, pages 114-129, 2014.","title":"Querying factorized probabilistic triple databases","authors":"Denis Krompaß, Maximilian Nickel, Volker Tresp","year":"2014","venue":"Proc. of ISWC","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Ku et al., 2015] Joy P. Ku, Jennifer L. Hicks, Trevor Hastie, Jure Leskovec, Christopher Ré, and Scott L. Delp. The mobilize cen- ter: An NIH big data to knowledge center to advance human movement research and improve mobility. J. Am. Med. Inform. Assoc., 22(6):1120-1125, 2015.","title":"The mobilize center: An NIH big data to knowledge center to advance human movement research and improve mobility","authors":"P Joy, Jennifer L Ku, Trevor Hicks, Jure Hastie, Christopher Leskovec, Scott L Ré, Delp","year":"2015","venue":"J. Am. Med. Inform. Assoc","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Levi, 1980] Isaac Levi. The Enterprise of Knowledge. MIT Press, 1980.","title":"Isaac Levi. The Enterprise of Knowledge","authors":"Levi","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Lukasiewicz and Predoiu, 2016] Thomas Lukasiewicz and Livia Predoiu. Complexity of threshold query answering in probabilis- tic ontological data exchange. In Proc. of ECAI, pages 1008- 1016, 2016.","title":"Complexity of threshold query answering in probabilistic ontological data exchange","authors":"Thomas Lukasiewicz, Livia Predoiu","year":"2016","venue":"Proc. of ECAI","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Lukasiewicz and Straccia, 2008] Thomas Lukasiewicz and Um- berto Straccia. Managing uncertainty and vagueness in descrip- tion logics for the semantic web. J. Web Sem., 6(4):291-308, 2008.","title":"Managing uncertainty and vagueness in description logics for the semantic web","authors":"Thomas Lukasiewicz, Umberto Straccia","year":"2008","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Lukasiewicz et al., 2011] Thomas Lukasiewicz, Livia Predoiu, and Heiner Stuckenschmidt. Tightly integrated probabilistic de- scription logic programs for representing ontology mappings. Ann. Math. Artif. Intell., 63(3/4):385-425, 2011.","title":"Tightly integrated probabilistic description logic programs for representing ontology mappings","authors":"Thomas Lukasiewicz, Livia Predoiu, Heiner Stuckenschmidt","year":"2011","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Lukasiewicz et al., 2016] Thomas Lukasiewicz, Maria Vanina Martinez, Livia Predoiu, and Gerardo I. Simari. Basic proba- bilistic ontological data exchange with existential rules. In Proc. of AAAI, pages 1023-1029. AAAI Press, 2016.","title":"Basic probabilistic ontological data exchange with existential rules","authors":"Thomas Lukasiewicz, Maria Vanina Martinez, Livia Predoiu, Gerardo I Simari","year":"2016","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Lukasiewicz, 2001] Thomas Lukasiewicz. Probabilistic logic pro- gramming with conditional constraints. ACM TOCL, 2(3):289- 339, 2001.","title":"Probabilistic logic programming with conditional constraints","authors":"Thomas Lukasiewicz","year":"2001","venue":"ACM TOCL","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Lukasiewicz, 2008a] Thomas Lukasiewicz. Expressive probabilis- tic description logics. AIJ, 172(6/7):852-883, 2008.","title":"Expressive probabilistic description logics","authors":"Thomas Lukasiewicz, Lukasiewicz","year":"2008","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Lukasiewicz, 2008b] Thomas Lukasiewicz. Probabilistic descrip- tion logic programs under inheritance with overriding for the Se- mantic Web. Int. J. Approx. Reasoning, 49(1):18-34, 2008.","title":"Probabilistic description logic programs under inheritance with overriding for the Semantic Web","authors":"Thomas Lukasiewicz, Lukasiewicz","year":"2008","venue":"Int. J. Approx. Reasoning","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Meliou et al., 2010] Alexandra Meliou, Wolfgang Gatterbauer, Katherine F. Moore, and Dan Suciu. The complexity of causality and responsibility for query answers and non-answers. Proc. of VLDB, 4(1), 2010.","title":"The complexity of causality and responsibility for query answers and non-answers","authors":"Alexandra Meliou, Wolfgang Gatterbauer, Katherine F Moore, Dan Suciu","year":"2010","venue":"Proc. of VLDB","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Milch et al., 2005] Brian Milch, Bhaskara Marthi, Stuart J. Rus- sell, David Sontag, Daniel L. Ong, and Andrey Kolobov. BLOG: Probabilistic models with unknown objects. In Proc. of IJCAI, pages 1352-1359. Professional Book Center, 2005.","title":"BLOG: Probabilistic models with unknown objects","authors":"Brian Milch, Bhaskara Marthi, Stuart J Russell, David Sontag, Daniel L Ong, Andrey Kolobov","year":"2005","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2005/203"},{"position":54,"raw":"[Mitchell et al., 2015] T. Mitchell, W. Cohen, E. Hruschka, P. Talukdar, J. Betteridge, A. Carlson, B. Dalvi, M. Gardner, B. Kisiel, J. Krishnamurthy, N. Lao, K. Mazaitis, T. Mohamed, N. Nakashole, E. Platanios, A. Ritter, M. Samadi, B. Settles, R. Wang, D. Wijaya, A. Gupta, X. Chen, A. Saparov, M. Greaves, and J. Welling. Never-Ending Learning. In Proc. of AAAI, pages 2302-2310. AAAI Press, 2015.","title":"Never-Ending Learning","authors":"T Mitchell, W Cohen, E Hruschka, P Talukdar, J Betteridge, A Carlson, B Dalvi, M Gardner, B Kisiel, J Krishnamurthy, N Lao, K Mazaitis, T Mohamed, N Nakashole, E Platanios, A Ritter, M Samadi, B Settles, R Wang, D Wijaya, A Gupta, X Chen, A Saparov, M Greaves, J Welling","year":"2015","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Niu et al., 2011] Feng Niu, Christopher Ré, AnHai Doan, and Jude W. Shavlik. Tuffy: Scaling up statistical inference in Markov logic networks using an RDBMS. Proc. of VLDB, 4(6):373-384, 2011.","title":"Tuffy: Scaling up statistical inference in Markov logic networks using an RDBMS","authors":"Feng Niu, Christopher Ré, Anhai Doan, Jude W Shavlik","year":"2011","venue":"Proc. of VLDB","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Olteanu and Schleich, 2016] Dan Olteanu and Maximilian Schle- ich. Factorized databases. SIGMOD Rec., 45(2):5-16, 2016.","title":"Dan Olteanu and Maximilian Schleich. Factorized databases","authors":"Schleich Olteanu","year":"2016","venue":"SIGMOD Rec","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Park and Darwiche, 2004] James D. Park and Adnan Darwiche. A differential semantics for jointree algorithms. AIJ, 156(2):197- 216, 2004.","title":"A differential semantics for jointree algorithms","authors":"James D Park, Adnan Darwiche","year":"2004","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Pearl, 1988] Judea Pearl. Probabilistic Reasoning in Intelligent Systems. 1988.","title":"Judea Pearl. Probabilistic Reasoning in Intelligent Systems","authors":"Pearl","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Peters et al., 2014] Shanan E. Peters, Ce Zhang, Miron Livny, and Christopher Ré. A machine reading system for assembling syn- thetic paleontological databases. PLoS ONE, 9(12), 2014.","title":"A machine reading system for assembling synthetic paleontological databases","authors":"Shanan E Peters, Ce Zhang, Miron Livny, Christopher Ré","year":"2014","venue":"PLoS ONE","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Ric- cardo Rosati. Linking data to ontologies. J. Data Sem., 10:133- 173, 2008.","title":"Linking data to ontologies","authors":"Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati","year":"2008","venue":"J. Data Sem","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Poole, 1993] David Poole. Probabilistic Horn abduction and Bayesian networks. AIJ, 64(1):81-129, 1993.","title":"Probabilistic Horn abduction and Bayesian networks","authors":"David Poole","year":"1993","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Poole, 1997] David Poole. The independent choice logic for mod- elling multiple agents under uncertainty. AIJ, 94(1/2):7-56, 1997.","title":"The independent choice logic for modelling multiple agents under uncertainty","authors":"David Poole","year":"1997","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Poon and Domingos, 2006] H Poon and Pedro Domingos. Sound and efficient inference with probabilistic and deterministic de- pendencies. In Proc. of AAAI, pages 458-463, 2006.","title":"Sound and efficient inference with probabilistic and deterministic dependencies","authors":"H Poon, Pedro Domingos","year":"2006","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Reiter, 1980] Raymond Reiter. A logic for default reasoning. AIJ, 13(1):81-132, 1980.","title":"A logic for default reasoning","authors":"Raymond Reiter","year":"1980","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":65,"raw":"[Richardson and Domingos, 2006] Matthew Richardson and Pedro Domingos. Markov logic networks. ML, 62(1):107-136, 2006.","title":"Markov logic networks","authors":"Matthew Richardson, Pedro Domingos","year":"2006","venue":"ML","doi":null,"url":null,"internal_url":null},{"position":66,"raw":"[Sato and Kameya, 1997] Taisuke Sato and Yoshitaka Kameya. PRISM: A language for symbolic-statistical modeling. In Proc. of IJCAI, pages 1330-1335, 1997.","title":"PRISM: A language for symbolic-statistical modeling","authors":"Kameya ; ] Taisuke Sato, Yoshitaka Sato, Kameya","year":"1997","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1997/192"},{"position":67,"raw":"[Singla and Domingos, 2007] Parag Singla and Pedro Domingos. Markov logic in infinite domains. In Proc. of UAI, pages 368- 375, 2007.","title":"Markov logic in infinite domains","authors":"Parag Singla, Pedro Domingos","year":"2007","venue":"Proc. of UAI","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Suciu et al., 2011] Dan Suciu, Dan Olteanu, Christopher Ré, and Christoph Koch. Probabilistic Databases, volume 3 of Synthesis Lectures on Data Management. Morgan & Claypool, 2011.","title":"Probabilistic Databases, volume 3 of Synthesis Lectures on Data Management","authors":"Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Van den Broeck and Suciu, 2017] Guy Van den Broeck and Dan Suciu. Query processing on probabilistic data: A survey. Foun- dations and Trends® in Databases, 7(3/4):197-341, 2017.","title":"Query processing on probabilistic data: A survey","authors":"Broeck Van Den, Suciu, Guy Van Den Broeck, Dan Suciu","year":"2017","venue":"Foundations and Trends® in Databases","doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Weikum et al., 2016] Gerhard Weikum, Johannes Hoffart, and Fabian Suchanek. Ten years of knowledge harvesting: Lessons and challenges. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 39(3):41-50, 2016.","title":"Ten years of knowledge harvesting: Lessons and challenges","authors":"Gerhard Weikum, Johannes Hoffart, Fabian Suchanek","year":"2016","venue":"Bulletin of the IEEE Computer Society Technical Committee on Data Engineering","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Wu et al., 2012] Wentao Wu, Hongsong Li, Haixun Wang, and Kenny Q. Zhu. Probase: A probabilistic taxonomy for text un- derstanding. In Proc. of ACM SIGMOD, pages 481-492, 2012.","title":"Probase: A probabilistic taxonomy for text understanding","authors":"Wentao Wu, Hongsong Li, Haixun Wang, Kenny Q Zhu","year":"2012","venue":"Proc. of ACM SIGMOD","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}