{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:11:04Z","timestamp":1750219864642,"version":"3.41.0"},"reference-count":90,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>The role of uncertainty in data management has become more prominent than ever before, especially because of the growing importance of machine learning-driven applications that produce large uncertain databases. A well-known approach to querying such databases is to blend rule-based reasoning with uncertainty. However, techniques proposed so far struggle with large databases. In this paper, we address this problem by presenting a new technique for probabilistic reasoning that exploits Trigger Graphs (TGs) -- a notion recently introduced for the non-probabilistic setting. The intuition is that TGs can effectively store a probabilistic model by avoiding an explicit materialization of the lineage and by grouping together similar derivations of the same fact. Firstly, we show how TGs can be adapted to support the possible world semantics. Then, we describe techniques for efficiently computing a probabilistic model and formally establish the correctness of our approach. We also present an extensive empirical evaluation using a prototype called LTGs. Our comparison against other leading engines shows that LTGs is not only faster, even against approximate reasoning techniques, but can also reason over probabilistic databases that existing engines cannot scale to.<\/jats:p>","DOI":"10.1145\/3588719","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Reasoning at Scale: Trigger Graphs to the Rescue"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8302-1902","authenticated-orcid":false,"given":"Efthymia","family":"Tsamoura","sequence":"first","affiliation":[{"name":"Samsung AI Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9950-4406","authenticated-orcid":false,"given":"Jaehun","family":"Lee","sequence":"additional","affiliation":[{"name":"Samsung, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0717-3559","authenticated-orcid":false,"given":"Jacopo","family":"Urbani","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"volume-title":"Foundations of Databases","author":"Abiteboul Serge","key":"e_1_2_2_1_1","unstructured":"Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley."},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Somak Aditya Yezhou Yang and Chitta Baral. 2019. Integrating Knowledge and Reasoning in Image Understanding. In IJCAI. 6252--6259.","DOI":"10.24963\/ijcai.2019\/873"},{"key":"e_1_2_2_3_1","volume-title":"Alan Nash.","author":"Jeffrey","year":"2008","unstructured":"Jeffrey B. Remmel Alin Deutsch, Alan Nash. 2008. The chase revisited. In PODS. 149--158."},{"key":"e_1_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Lyublena Antova Thomas Jansen Christoph Koch and Dan Olteanu. 2008. Fast and Simple Relational Processing of Uncertain Data. In ICDE. 983--992.","DOI":"10.1109\/ICDE.2008.4497507"},{"key":"e_1_2_2_5_1","article-title":"Hinge-Loss Markov Random Fields and Probabilistic Soft Logic","volume":"18","author":"Bach Stephen H.","year":"2017","unstructured":"Stephen H. Bach, Matthias Broecheler, Bert Huang, and Lise Getoor. 2017. Hinge-Loss Markov Random Fields and Probabilistic Soft Logic. Journal of Machine Learning Research, Vol. 18 (2017), 109:1--109:67.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_2_6_1","volume-title":"Ullman","author":"Bancilhon Francc","year":"1986","unstructured":"Francc ois Bancilhon, David Maier, Yehoshua Sagiv, and Jeffrey D. Ullman. 1986. Magic Sets and Other Strange Ways to Implement Logic Programs. In PODS. 1--15."},{"key":"e_1_2_2_7_1","article-title":"Declarative Probabilistic Programming with Datalog","volume":"42","author":"Vince B\u00e1","year":"2017","unstructured":"Vince B\u00e1 r\u00e1 ny, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, and Zografoula Vagena. 2017. Declarative Probabilistic Programming with Datalog. ACM Trans. Database Syst., Vol. 42, 4 (2017), 22:1--22:35.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_2_2_8_1","volume-title":"Datalog in Academia and Industry - Second International Workshop. Lecture Notes in Computer Science","volume":"7494","author":"Barcel\u00f3 Pablo","year":"2012","unstructured":"Pablo Barcel\u00f3 and Reinhard Pichler (Eds.). 2012. Datalog in Academia and Industry - Second International Workshop. Lecture Notes in Computer Science, Vol. 7494. Springer."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90038-Q"},{"key":"e_1_2_2_10_1","first-page":"975","article-title":"The Vadalog System","volume":"11","author":"Bellomarini Luigi","year":"2018","unstructured":"Luigi Bellomarini, Emanuel Sallinger, and Georg Gottlob. 2018. The Vadalog System: Datalog-based Reasoning for Knowledge Graphs. PVLDB, Vol. 11, 9 (2018), 975--987.","journal-title":"Datalog-based Reasoning for Knowledge Graphs. PVLDB"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Michael Benedikt George Konstantinidis Giansalvatore Mecca Boris Motik Paolo Papotti Donatello Santoro and Efthymia Tsamoura. 2017. Benchmarking the Chase. In PODS. 37--52.","DOI":"10.1145\/3034786.3034796"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Michael Benedikt Boris Motik and Efthymia Tsamoura. 2018. Goal-Driven Query Answering for Existential Rules With Equality. In AAAI. 1761--1770.","DOI":"10.1609\/aaai.v32i1.11563"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.07.002"},{"key":"e_1_2_2_14_1","volume-title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction. In ACL. 4762--4779.","author":"Bosselut Antoine","year":"2019","unstructured":"Antoine Bosselut, Hannah Rashkin, Maarten Sap, Chaitanya Malaviya, Asli Celikyilmaz, and Yejin Choi. 2019. COMET: Commonsense Transformers for Automatic Knowledge Graph Construction. In ACL. 4762--4779."},{"key":"e_1_2_2_15_1","volume-title":"Merlin","author":"Chandra Ashok K.","year":"1977","unstructured":"Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In STOC. 77--90."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11944"},{"key":"e_1_2_2_17_1","unstructured":"James Cussens. 2000. Stochastic Logic Programs: Sampling Inference and Applications. In UAI. 115--122."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538810"},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Nilesh N. Dalvi and Dan Suciu. 2007 a. The dichotomy of conjunctive queries on probabilistic structures. In PODS. 293--302.","DOI":"10.1145\/1265530.1265571"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395119"},{"key":"e_1_2_2_22_1","first-page":"1","article-title":"Semiring Provenance for Fixed-Point Logic","volume":"183","author":"Dannert Katrin M.","year":"2021","unstructured":"Katrin M. Dannert, Erich Gr\"adel, Matthias Naaf, and Val Tannen. 2021. Semiring Provenance for Fixed-Point Logic. In CSL, Vol. 183. 17:1--17:22.","journal-title":"CSL"},{"key":"e_1_2_2_23_1","unstructured":"Adnan Darwiche. 2004. New Advances in Compiling CNF to Decomposable Negation Normal Form. In ECAI. 318--322."},{"key":"e_1_2_2_24_1","volume-title":"SDD: A New Canonical Representation of Propositional Knowledge Bases. In IJCAI. 819--826.","author":"Darwiche Adnan","year":"2011","unstructured":"Adnan Darwiche. 2011. SDD: A New Canonical Representation of Propositional Knowledge Bases. In IJCAI. 819--826."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5494-z"},{"key":"e_1_2_2_26_1","unstructured":"Luc De Raedt Angelika Kimmig and Hannu Toivonen. 2007. ProbLog: A Probabilistic Prolog and Its Application in Link Discovery. In IJCAI. 2462--2467."},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Tim Dettmers Pasquale Minervini Pontus Stenetorp and Sebastian Riedel. 2018. Convolutional 2D Knowledge Graph Embeddings. In AAAI. 1811--1818.","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0496-7"},{"key":"e_1_2_2_29_1","unstructured":"Daniel Deutch Tova Milo Sudeepa Roy and Val Tannen. 2014. Circuits for Datalog Provenance. In ICDT. 201--212."},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Pedro Domingos Stanley Kok Daniel Lowd Hoifung Poon Matthew Richardson and Parag Singla. 2008. Markov Logic. 92--117.","DOI":"10.1007\/978-3-540-78652-8_4"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556564"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Maximilian Dylla Iris Miliaraki and Martin Theobald. 2013b. Top-k query processing in probabilistic databases with non-materialized views. In ICDE. 122--133.","DOI":"10.1109\/ICDE.2013.6544819"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000076"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0310-5"},{"key":"e_1_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Tal Friedman and Guy Van den Broeck. 2019. On Constrained Open-World Probabilistic Databases. In IJCAI. 5722--5729.","DOI":"10.24963\/ijcai.2019\/793"},{"key":"e_1_2_2_37_1","unstructured":"Tal Friedman and Guy Van den Broeck. 2020. Symbolic Querying of Vector Spaces: Probabilistic Databases Meets Relational Embeddings. In UAI. 1268--1277."},{"key":"e_1_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Norbert Fuhr. 1995. Probabilistic Datalog - A Logic For Powerful Retrieval Methods. In SIGIR. 282--290.","DOI":"10.1145\/215206.215372"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/326194.326195"},{"key":"e_1_2_2_40_1","volume-title":"From Two Graphs to N Questions: A VQA Dataset for Compositional Reasoning on Vision and Commonsense. CoRR","author":"Gao Difei","year":"2019","unstructured":"Difei Gao, Ruiping Wang, Shiguang Shan, and Xilin Chen. 2019. From Two Graphs to N Questions: A VQA Dataset for Compositional Reasoning on Vision and Commonsense. CoRR, Vol. abs\/1908.02962 (2019)."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532641"},{"volume-title":"Computer Science Logic","author":"Erich","key":"e_1_2_2_42_1","unstructured":"Erich Gr\"adel. 1992. On transitive closure logic. In Computer Science Logic. Springer Berlin Heidelberg, 149--163."},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Todd J. Green Grigoris Karvounarakis and Val Tannen. 2007. Provenance Semirings. In PODS. 31--40.","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_2_2_44_1","first-page":"552","article-title":"SlimShot","volume":"9","author":"Gribkoff Eric","year":"2016","unstructured":"Eric Gribkoff and Dan Suciu. 2016. SlimShot: In-Database Probabilistic Inference for Knowledge Bases. PVLDB, Vol. 9, 7 (2016), 552--563.","journal-title":"In-Database Probabilistic Inference for Knowledge Bases. PVLDB"},{"key":"e_1_2_2_45_1","volume-title":"Guy Van den Broeck, and Dan Suciu","author":"Gribkoff Eric","year":"2014","unstructured":"Eric Gribkoff, Guy Van den Broeck, and Dan Suciu. 2014. The most probable database problem. In BUDA. 1--7."},{"key":"e_1_2_2_46_1","first-page":"2","article-title":"LUBM: A Benchmark for OWL Knowledge Base Systems","volume":"3","author":"Guo Yuanbo","year":"2011","unstructured":"Yuanbo Guo, Zhengxiang Pan, and Jeff Heflin. 2011. LUBM: A Benchmark for OWL Knowledge Base Systems. Journal of Web Semantics, Vol. 3, 2--3 (2011).","journal-title":"Journal of Web Semantics"},{"key":"e_1_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Bernd Gutmann Angelika Kimmig Kristian Kersting and Luc De Raedt. 2008. Parameter Learning in Probabilistic Databases: A Least Squares Approach. In Machine Learning and Knowledge Discovery in Databases. 473--488.","DOI":"10.1007\/978-3-540-87479-9_49"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000238"},{"key":"e_1_2_2_49_1","volume-title":"Scallop: From Probabilistic Deductive Databases to Scalable Differentiable Reasoning. In NeurIPS. 25134--25145.","author":"Huang Jiani","year":"2021","unstructured":"Jiani Huang, Ziyang Li, Binghong Chen, Karan Samel, Mayur Naik, Le Song, and Xujie Si. 2021. Scallop: From Probabilistic Deductive Databases to Scalable Differentiable Reasoning. In NeurIPS. 25134--25145."},{"key":"e_1_2_2_50_1","unstructured":"Unmesh Joshi Ceriel J. H. Jacobs and Jacopo Urbani. 2020. Rewrite or Not Rewrite? ML-Based Algorithm Selection for Datalog Query Answering on Knowledge Graphs. In ECAI. 792--799."},{"key":"e_1_2_2_51_1","unstructured":"Cezary Kaliszyk Josef Urban Henryk Michalewski and Miroslav Ols\u00e1 k. 2018. Reinforcement Learning of Theorem Proving. In NeurIPS. 8836--8847."},{"key":"e_1_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Nodira Khoussainova Magdalena Balazinska and Dan Suciu. 2008. Probabilistic Event Extraction from RFID Data. In ICDE. 1480--1482.","DOI":"10.1109\/ICDE.2008.4497596"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000566"},{"key":"e_1_2_2_54_1","unstructured":"Timoth\u00e9 e Lacroix Nicolas Usunier and Guillaume Obozinski. 2018. Canonical Tensor Decomposition for Knowledge Base Completion. In ICML. 2869--2878."},{"key":"e_1_2_2_55_1","unstructured":"Farzaneh Mahdisoltani Joanna Biega and Fabian Suchanek. 2014. Yago3: A knowledge base from multilingual wikipedias. In CIDR."},{"key":"e_1_2_2_56_1","unstructured":"Robin Manhaeve Sebastijan Dumancic Angelika Kimmig Thomas Demeester and Luc De Raedt. 2018. DeepProbLog: Neural Probabilistic Logic Programming. In NeurIPS. 3749--3759."},{"key":"e_1_2_2_57_1","volume-title":"Daniel Ruffinelli, and Heiner Stuckenschmidt.","author":"Meilicke Christian","year":"2019","unstructured":"Christian Meilicke, Melisachew Wudage Chekol, Daniel Ruffinelli, and Heiner Stuckenschmidt. 2019. Anytime Bottom-Up Rule Learning for Knowledge Graph Completion. In IJCAI. 3137--3143."},{"key":"e_1_2_2_58_1","doi-asserted-by":"crossref","unstructured":"Boris Motik Yavor Nenov Robert Piro and Ian Horrocks. 2015. Handling owl:sameAs via Rewriting. In AAAI. 231--237.","DOI":"10.1609\/aaai.v29i1.9187"},{"volume-title":"IEEE International Conference on Big Data. 56--65","author":"Moustafa W. E.","key":"e_1_2_2_59_1","unstructured":"W. E. Moustafa, V. Papavasileiou, K. Yocum, and A. Deutsch. 2016. Datalography: Scaling datalog graph analytics on graph processing systems. In IEEE International Conference on Big Data. 56--65."},{"key":"e_1_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Yavor Nenov Robert Piro Boris Motik Ian Horrocks Zhe Wu and Jay Banerjee. 2015. RDFox: A Highly-Scalable RDF Store. In ISWC. 3--20.","DOI":"10.1007\/978-3-319-25010-6_1"},{"key":"e_1_2_2_61_1","volume-title":"Tinne De Laet, and Luc De Raedt","author":"Nitti Davide","year":"2014","unstructured":"Davide Nitti, Tinne De Laet, and Luc De Raedt. 2014. Relational object tracking and learning. In ICRA. 935--942."},{"key":"e_1_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Dan Olteanu Jiewen Huang and Christoph Koch. 2010. Approximate confidence computation in probabilistic databases. In ICDE. 145--156.","DOI":"10.1109\/ICDE.2010.5447826"},{"key":"e_1_2_2_63_1","unstructured":"Knot Pipatsrisawat and Adnan Darwiche. 2008. New Compilation Languages Based on Structured Decomposability. In AAAI. 517--522."},{"key":"e_1_2_2_64_1","unstructured":"David Poole. 1992. Logic Programming Abduction and Probability. In FGCS. 530--538."},{"key":"e_1_2_2_65_1","doi-asserted-by":"crossref","unstructured":"David Poole. 2008. The Independent Choice Logic and Beyond. In Probabilistic Inductive Logic Programming. 222--243.","DOI":"10.1007\/978-3-540-78652-8_8"},{"volume-title":"CLAROS--Collaborating on Delivering the Future of the Past","author":"Rahtz Sebastian","key":"e_1_2_2_66_1","unstructured":"Sebastian Rahtz, Alexander Dutton, Donna Kurtz, Graham Klyne, Andrew Zisserman, and Relja Arandjelovic. 2011. CLAROS--Collaborating on Delivering the Future of the Past. In DH. Stanford University Library, 355--357."},{"key":"e_1_2_2_67_1","volume-title":"A Practical Dynamic Programming Approach to Datalog Provenance Computation. CoRR","author":"Ramusat Yann","year":"2021","unstructured":"Yann Ramusat, Silviu Maniu, and Pierre Senellart. 2021. A Practical Dynamic Programming Approach to Datalog Provenance Computation. CoRR, Vol. abs\/2112.01132 (2021)."},{"key":"e_1_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Christopher R\u00e9 and Dan Suciu. 2008. Approximate Lineage for Probabilistic Databases. In VLDB. 797--808.","DOI":"10.14778\/1453856.1453943"},{"key":"e_1_2_2_69_1","volume-title":"Guy Van den Broeck, and Luc De Raedt","author":"Renkens Joris","year":"2014","unstructured":"Joris Renkens, Angelika Kimmig, Guy Van den Broeck, and Luc De Raedt. 2014. Explanation-Based Approximate Weighted Model Counting for Probabilistic Logics. In AAAI. 2490--2496."},{"key":"e_1_2_2_70_1","volume-title":"Guy Van den Broeck, and Siegfried Nijssen","author":"Renkens Joris","year":"2012","unstructured":"Joris Renkens, Guy Van den Broeck, and Siegfried Nijssen. 2012. k-Optimal: A Novel Approximate Inference Algorithm for ProbLog. In Inductive Logic Programming. 33--38."},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00092-1"},{"key":"e_1_2_2_73_1","doi-asserted-by":"crossref","unstructured":"Taisuke Sato. 1995. A statistical learning method for logic programs with distribution semantics. In ICLP. 715--729.","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.08.005"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0153-2"},{"key":"e_1_2_2_76_1","doi-asserted-by":"crossref","unstructured":"Dan Suciu Dan Olteanu Christopher R\u00e9 and Christoph Koch. 2011. Probabilistic Databases. Morgan & Claypool Publishers.","DOI":"10.1007\/978-3-031-01879-4"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447699"},{"key":"e_1_2_2_78_1","volume-title":"Victor Guti\u00e9 rrez-Basulto, and Angelika Kimmig","author":"Tsamoura Efthymia","year":"2020","unstructured":"Efthymia Tsamoura, Victor Guti\u00e9 rrez-Basulto, and Angelika Kimmig. 2020. Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs. In AAAI. 10284--10291."},{"key":"e_1_2_2_79_1","doi-asserted-by":"crossref","unstructured":"Efthymia Tsamoura Timothy Hospedales and Loizos Michael. 2021b. Neural-Symbolic Integration: A Compositional Perspective. In AAAI. 5051--5060.","DOI":"10.1609\/aaai.v35i6.16639"},{"key":"e_1_2_2_80_1","unstructured":"Efthymia Tsamoura Jaehun Lee and Jacopo Urbani. 2023. Probabilistic Reasoning at Scale: Trigger Graphs to the Rescue. arxiv: 2304.05459 [cs.DB]"},{"key":"e_1_2_2_81_1","doi-asserted-by":"crossref","unstructured":"Jacopo Urbani Ceriel Jacobs and Markus Kr\u00f6 tzsch. 2016. Column-Oriented Datalog Materialization for Large Knowledge Graphs. In AAAI. 258--264.","DOI":"10.1609\/aaai.v30i1.9993"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_2_2_83_1","doi-asserted-by":"crossref","unstructured":"Timothy van Bremen Anton Dries and Jean Christoph Jung. 2019. Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming. In CIKM. 2437--2440.","DOI":"10.1145\/3357384.3358168"},{"key":"e_1_2_2_84_1","unstructured":"Guy Van den Broeck Wannes Meert and Adnan Darwiche. 2014. Skolemization for Weighted First-Order Model Counting. In KR. 111--120."},{"key":"e_1_2_2_85_1","doi-asserted-by":"crossref","unstructured":"Maarten Van den Heuvel Peter Ivanov Wolfgang Gatterbauer Floris Geerts and Martin Theobald. 2019. Anytime Approximation in Probabilistic Databases via Scaled Dissociations. In SIGMOD. 1295--1312.","DOI":"10.1145\/3299869.3319900"},{"key":"e_1_2_2_86_1","volume-title":"Angelika Kimmig, Wannes Meert, and Luc De Raedt.","author":"Vlasselaer Jonas","year":"2015","unstructured":"Jonas Vlasselaer, Guy Van den Broeck, Angelika Kimmig, Wannes Meert, and Luc De Raedt. 2015. Anytime inference in probabilistic logic programs with Tp-compilation. In IJCAI. 1852--1858."},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2016.06.009"},{"key":"e_1_2_2_88_1","volume-title":"Incremental Knowledge Base Construction Using DeepDive. CoRR","author":"Wu Sen","year":"2015","unstructured":"Sen Wu, Ce Zhang, Feiran Wang, and Christopher R\u00e9. 2015. Incremental Knowledge Base Construction Using DeepDive. CoRR, Vol. abs\/1502.00731 (2015)."},{"key":"e_1_2_2_89_1","volume-title":"Zhu","author":"Wu Wentao","year":"2012","unstructured":"Wentao Wu, Hongsong Li, Haixun Wang, and Kenny Q. Zhu. 2012. Probase: A Probabilistic Taxonomy for Text Understanding. In SIGMOD. 481--492."},{"key":"e_1_2_2_90_1","doi-asserted-by":"crossref","unstructured":"Yuke Zhu Alireza Fathi and Li Fei-Fei. 2014. Reasoning about Object Affordances in a Knowledge Base Representation. In ECCV. 408--424.","DOI":"10.1007\/978-3-319-10605-2_27"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588719","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:35Z","timestamp":1750178855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":90,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588719"],"URL":"https:\/\/doi.org\/10.1145\/3588719","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}