{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T22:19:03Z","timestamp":1790288343990,"version":"4.1.0"},"reference-count":208,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8,7]]},"abstract":"<jats:p>Probabilistic data is motivated by the need to model uncertainty in large databases. Over the last twenty years or so, both the Database community and the AI community have studied various aspects of probabilistic relational data. This survey presents the main approaches developed in the literature, reconciling concepts developed in parallel by the two research communities. The survey starts with an extensive discussion of the main probabilistic data models and their relationships, followed by a brief overview of model counting and its relationship to probabilistic data. After that, the survey discusses lifted probabilistic inference, which are a suite of techniques developed in parallel by the Database and AI communities for probabilistic query evaluation. Then, it gives a short summary of query compilation, presenting some theoretical results highlighting limitations of various query evaluation techniques on probabilistic data. The survey ends with a very brief discussion of some popular probabilistic data sets, systems, and applications that build on this technology.<\/jats:p>","DOI":"10.1561\/1900000052","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T08:39:45Z","timestamp":1502095185000},"page":"197-341","source":"Crossref","is-referenced-by-count":29,"title":["Query Processing on Probabilistic Data: A Survey"],"prefix":"10.1108","volume":"7","author":[{"given":"Guy","family":"Van den Broeck","sequence":"first","affiliation":[{"name":"University of California, Los Angeles ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"issue":"3","key":"2025122708592468300_ref001","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1561\/1900000024","article-title":"The design and implementation of modern column-oriented\n                        database systems","volume":"5","author":"Abadi","year":"2013","journal-title":"Foundations and Trends in\n                        Databases"},{"key":"2025122708592468300_ref002","volume-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"2025122708592468300_ref003","first-page":"29","article-title":"Blinkdb: queries with\n                        bounded errors and bounded response times on very large\n                    data","volume-title":"Proc. of EuroSys\u201913","author":"Agarwal","year":"2013"},{"key":"2025122708592468300_ref004","first-page":"585","article-title":"Lifted online training of relational models with stochastic\n                        gradient methods","volume-title":"ECML PKDD","author":"Ahmadi","year":"2012"},{"issue":"6","key":"2025122708592468300_ref005","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","article-title":"Binary decision diagrams","volume":"27","author":"Akers","year":"1978","journal-title":"IEEE Trans.\n                        Computers"},{"key":"2025122708592468300_ref006","first-page":"56","article-title":"Provenance circuits for trees and treelike\n                        instances","volume-title":"Automata, Languages, and Programming -\n                        42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015,\n                        Proceedings, Part II","author":"Amarilli","year":"2015"},{"key":"2025122708592468300_ref007","first-page":"355","article-title":"Tractable lineages on treelike instances: Limits and\n                        extensions","volume-title":"Proceedings of the 35th ACM\n                        SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016,\n                        San Francisco, CA, USA, June 26 - July 01, 2016","author":"Amarilli","year":"2016"},{"key":"2025122708592468300_ref008","first-page":"1541","article-title":"Non-count symmetries in boolean & multi-valued prob.\n                        graphical models","volume-title":"Artificial Intelligence and\n                        Statistics","author":"Anand","year":"2017"},{"key":"2025122708592468300_ref009","first-page":"1479","article-title":"Maybms: Managing incomplete information with probabilistic\n                        world-set decompositions","volume-title":"ICDE","author":"Antova","year":"2007"},{"key":"2025122708592468300_ref010","volume-title":"Representing and reasoning with probabilistic knowledge: a logical\n                        approach to probabilities","author":"Bacchus","year":"1991"},{"key":"2025122708592468300_ref011","article-title":"Declarative probabilistic programming with\n                        datalog","volume":"48","author":"Barany","year":"2016","journal-title":"LIPIcs-Leibniz International Proceedings\n                        in Informatics"},{"issue":"5","key":"2025122708592468300_ref012","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/69.166990","article-title":"The management of probabilistic data","volume":"4","author":"Barbar\u00e1","year":"1992","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2025122708592468300_ref013","first-page":"131","article-title":"New\n                        limits for knowledge compilation and applications to exact model\n                        counting","volume-title":"Proceedings of the Thirty-First\n                        Conference on Uncertainty in Artificial Intelligence, UAI 2015, July 12-16,\n                        2015, Amsterdam, The Netherlands","author":"Beame","year":"2015"},{"key":"2025122708592468300_ref014","first-page":"157","article-title":"Lower bounds for exact model counting and applications in\n                        probabilistic databases","volume-title":"UAI","author":"Beame","year":"2013"},{"key":"2025122708592468300_ref015","first-page":"177","article-title":"Counting of query expressions: Limitations of propositional\n                        methods","volume-title":"ICDT","author":"Beame","year":"2014"},{"key":"2025122708592468300_ref016","doi-asserted-by":"crossref","DOI":"10.1145\/2984632","article-title":"Exact model counting of query expressions: Limitations of\n                        propositional methods","volume-title":"ACM TODS","author":"Beame","year":"2017"},{"key":"2025122708592468300_ref017","first-page":"953","article-title":"ULDBs: Databases with uncertainty and\n                    lineage","volume-title":"Proceedings of the 32nd International\n                        Conference on Very Large Data Bases, Seoul, Korea, September 12-15,\n                        2006","author":"Benjelloun","year":"2006"},{"issue":"1","key":"2025122708592468300_ref018","first-page":"5","article-title":"An\n                        introduction to ULDBs and the Trio system","volume":"29","author":"Benjelloun","year":"2006","journal-title":"IEEE Data\n                        Eng. Bull."},{"key":"2025122708592468300_ref019","first-page":"929","article-title":"Sdds are exponentially more succinct than\n                        obdds","volume-title":"Proceedings of the Thirtieth AAAI\n                        Conference on Artificial Intelligence, February 12-17, 2016, Phoenix,\n                        Arizona, USA.","author":"Bova","year":"2016"},{"issue":"8","key":"2025122708592468300_ref020","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function\n                        manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Computers"},{"key":"2025122708592468300_ref021","first-page":"132","article-title":"Automorphism groups of graphical models and lifted\n                        variational inference","volume-title":"UAI","author":"Bui","year":"2013"},{"key":"2025122708592468300_ref022","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.62","article-title":"Operations for learning with graphical\n                    models","volume":"2","author":"Buntine","year":"1994","journal-title":"JAIR"},{"key":"2025122708592468300_ref023","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7519","article-title":"Toward an architecture for never-ending language\n                        learning","volume-title":"AAAI","author":"Carlson","year":"2010"},{"key":"2025122708592468300_ref024","first-page":"71","article-title":"The theory of probabilistic databases","volume-title":"VLDB\u201987, Proceedings of 13th International Conference on Very\n                        Large Data Bases, September 1-4, 1987, Brighton, England","author":"Cavallo","year":"1987"},{"key":"2025122708592468300_ref025","article-title":"Openworld probabilistic databases","volume-title":"Proceedings of the 15th International Conference on Principles of\n                        Knowledge Representation and Reasoning (KR)","author":"Ceylan","year":"2016"},{"key":"2025122708592468300_ref026","first-page":"1722","article-title":"Distribution-aware sampling and weighted model counting for\n                        SAT","volume-title":"Proceedings of the National Conference on\n                        Artificial Intelligence","author":"Chakraborty","year":"2014"},{"key":"2025122708592468300_ref027","first-page":"689","article-title":"From weighted to unweighted model counting","volume-title":"Proceedings of the Twenty-Fourth International Joint Conference on\n                        Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31,\n                        2015","author":"Chakraborty","year":"2015"},{"key":"2025122708592468300_ref028","first-page":"34","article-title":"An overview of query optimization in relational\n                        systems","volume-title":"Proceedings of the Seventeenth ACM\n                        SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3,\n                        1998, Seattle, Washington, USA","author":"Chaudhuri","year":"1998"},{"key":"2025122708592468300_ref029","first-page":"1306","article-title":"Compiling Bayesian networks with local\n                        structure","volume":"5","author":"Chavira","year":"2005","journal-title":"Proceedings of IJCAI"},{"issue":"6\u20137","key":"2025122708592468300_ref030","first-page":"772","article-title":"On probabilistic inference by weighted model\n                        counting","volume":"172","author":"Chavira","year":"2008","journal-title":"AIJ"},{"key":"2025122708592468300_ref031","first-page":"649","article-title":"Knowledge expansion over probabilistic knowledge\n                        bases","volume-title":"International Conference on Management of\n                        Data, SIGMOD 2014, Snowbird, UT, USA, June 22-27, 2014","author":"Chen","year":"2014"},{"key":"2025122708592468300_ref032","first-page":"1107","volume-title":"Proceedings of the National Conference on Artificial\n                        Intelligence","author":"Choi","year":"1999"},{"key":"2025122708592468300_ref033","first-page":"167","volume-title":"JSAI International Symposium on Artificial Intelligence","author":"Choi","year":"2010"},{"key":"2025122708592468300_ref034","first-page":"121","article-title":"Compiling probabilistic graphical models using sentential\n                        decision diagrams","volume-title":"ECSQARU","author":"Choi","year":"2013"},{"key":"2025122708592468300_ref035","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v25i1.8025","article-title":"Efficient methods for lifted inference with aggregate\n                        factors","volume-title":"AAAI","author":"Choi","year":"2011"},{"issue":"1","key":"2025122708592468300_ref036","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. i. recognizable\n                        sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inf. Comput."},{"issue":"2","key":"2025122708592468300_ref037","first-page":"199","article-title":"Credal networks","volume":"120","author":"Cozman","year":"2000","journal-title":"AIJ"},{"key":"2025122708592468300_ref038","first-page":"3519","article-title":"Bayesian networks specified using propositional and\n                        relational constructs: Combined, data, and domain\n                    complexity","volume-title":"AAAI","author":"Cozman","year":"2015"},{"key":"2025122708592468300_ref039","first-page":"110","article-title":"Probabilistic graphical models specified by probabilistic\n                        logic programs: Semantics and complexity","volume-title":"Conference on Probabilistic Graphical Models","author":"Cozman","year":"2016"},{"key":"2025122708592468300_ref040","first-page":"864","article-title":"Efficient query evaluation on probabilistic\n                        databases","volume-title":"VLDB","author":"Dalvi","year":"2004"},{"key":"2025122708592468300_ref041","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1265530.1265531","article-title":"Management of probabilistic data: foundations and\n                        challenges","volume-title":"Proceedings of the Twenty-Sixth ACM\n                        SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June\n                        11-13, 2007, Beijing, China","author":"Dalvi","year":"2007"},{"issue":"4","key":"2025122708592468300_ref042","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","article-title":"Efficient query evaluation on probabilistic\n                        databases","volume":"16","author":"Dalvi","year":"2007","journal-title":"VLDB J."},{"issue":"6","key":"2025122708592468300_ref043","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2395116.2395119","article-title":"The dichotomy of probabilistic inference for unions of\n                        conjunctive queries","volume":"59","author":"Dalvi","year":"2012","journal-title":"J. ACM"},{"key":"2025122708592468300_ref044","first-page":"133","volume-title":"Proceedings of the Sixteenth conference on Uncertainty in artificial\n                        intelligence","author":"Darwiche","year":"2000"},{"issue":"4","key":"2025122708592468300_ref045","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/502090.502091","article-title":"Decomposable negation normal form","volume":"48","author":"Darwiche","year":"2001","journal-title":"J.\n                        ACM"},{"key":"2025122708592468300_ref046","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511811357","volume-title":"Modeling and Reasoning with Bayesian Networks","author":"Darwiche","year":"2009"},{"key":"2025122708592468300_ref047","first-page":"819","article-title":"SDD: A new canonical representation of propositional\n                        knowledge bases","volume-title":"IJCAI 2011, Proceedings of the\n                        22nd International Joint Conference on Artificial Intelligence","author":"Darwiche","year":"2011"},{"issue":"1","key":"2025122708592468300_ref048","first-page":"229","article-title":"A knowledge compilation map","volume":"17","author":"Darwiche","year":"2002","journal-title":"J.\n                        Artif. Int. Res"},{"key":"2025122708592468300_ref049","article-title":"Results from the probablistic inference evaluation of\n                        UAI-08","author":"Darwiche","year":"2008"},{"issue":"3","key":"2025122708592468300_ref050","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A\n                        computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J.\n                        ACM"},{"issue":"7","key":"2025122708592468300_ref051","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"issue":"1","key":"2025122708592468300_ref052","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10994-015-5494-z","article-title":"Probabilistic (logic) programming concepts","volume":"100","author":"Raedt","year":"2015","journal-title":"Machine Learning"},{"key":"2025122708592468300_ref053","first-page":"2468","article-title":"Problog: A probabilistic prolog and its application in link\n                        discovery","volume-title":"Proceedings of the 20th international\n                        joint conference on Artifical intelligence","author":"De Raedt","year":"2007"},{"issue":"2","key":"2025122708592468300_ref054","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01574-8","article-title":"Statistical relational artificial intelligence: Logic,\n                        probability, and computation","volume":"10","author":"De Raedt","year":"2016","journal-title":"Synthesis Lectures on\n                        Artificial Intelligence and Machine Learning"},{"key":"2025122708592468300_ref055","first-page":"1319","article-title":"Lifted first-order probabilistic inference","volume-title":"IJCAI-05, Proceedings of the Nineteenth International Joint\n                        Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 -\n                        August 5, 2005","author":"Braz","year":"2005"},{"issue":"2","key":"2025122708592468300_ref056","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/636865.636866","article-title":"Mini-buckets: A general scheme for bounded\n                        inference","volume":"50","author":"Dechter","year":"2003","journal-title":"Journal of the ACM (JACM)"},{"key":"2025122708592468300_ref057","first-page":"588","article-title":"Model-driven data acquisition in sensor\n                        networks","volume-title":"(e)Proceedings of the Thirtieth\n                        International Conference on Very Large Data Bases, Toronto, Canada, August\n                        31 - September 3 2004","author":"Deshpande","year":"2004"},{"key":"2025122708592468300_ref058","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1145\/2882903.2915249","article-title":"Sample+seek: Approximating aggregates with\n                        distribution precision guarantee","volume-title":"Proc.\n                        SIGMOD","author":"Ding","year":"2016"},{"key":"2025122708592468300_ref059","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01549-6","volume-title":"Markov\n                        Logic: An Interface Layer for Artificial Intelligence","author":"Domingos","year":"2009"},{"key":"2025122708592468300_ref060","first-page":"601","article-title":"Knowledge vault: a web-scale approach to probabilistic\n                        knowledge fusion","volume-title":"The 20th ACM SIGKDD\n                        International Conference on Knowledge Discovery and Data Mining, KDD\n                        \u201914, New York, NY, USA - August 24 - 27, 2014","author":"Dong","year":"2014"},{"key":"2025122708592468300_ref061","first-page":"202","volume-title":"Proceedings of the\n                        Twenty-Ninth Conference on Uncertainty in Artificial Intelligence","author":"Ermon","year":"2013"},{"issue":"12","key":"2025122708592468300_ref062","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/1409360.1409378","article-title":"Open information extraction from the web","volume":"51","author":"Etzioni","year":"2008","journal-title":"Commun. ACM"},{"key":"2025122708592468300_ref063","first-page":"1535","article-title":"Identifying relations for open information\n                        extraction","volume-title":"Proceedings of the 2011 Conference on\n                        Empirical Methods in Natural Language Processing, EMNLP 2011, 27-31 July\n                        2011, John McIntyre Conference Centre, Edinburgh, UK, A meeting of SIGDAT, a\n                        Special Interest Group of the ACL","author":"Fader","year":"2011"},{"issue":"1\/2","key":"2025122708592468300_ref064","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","article-title":"A logic for reasoning about probabilities","volume":"87","author":"Fagin","year":"1990","journal-title":"Inf. Comput."},{"key":"2025122708592468300_ref065","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/11536314_8","article-title":"Logical Bayesian networks and their relation to other\n                        probabilistic logical models","volume-title":"Inductive Logic\n                        Programming","author":"Fierens","year":"2005"},{"issue":"3","key":"2025122708592468300_ref066","first-page":"358","article-title":"Inference and learning in probabilistic logic programs using\n                        weighted boolean formulas","volume":"15","author":"Fierens","year":"2015","journal-title":"TPLP"},{"key":"2025122708592468300_ref067","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/2594538.2594549","volume-title":"Proceedings of the 33rd\n                        ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database\n                        Systems","author":"Fink","year":"2014"},{"key":"2025122708592468300_ref068","first-page":"1300","article-title":"Learning probabilistic relational models","volume-title":"Proceedings of the Sixteenth International Joint Conference on\n                        Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6,\n                        1999. 2 Volumes, 1450 pages","author":"Friedman","year":"1999"},{"key":"2025122708592468300_ref069","first-page":"309","article-title":"A\n                        probabilistic relational model for the integration of IR and\n                        databases","volume-title":"Proceedings of the 16th Annual\n                        International ACM-SIGIR Conference on Research and Development in\n                        Information Retrieval. Pittsburgh, PA, USA, June 27 - July 1, 1993","author":"Fuhr","year":"1993"},{"issue":"1","key":"2025122708592468300_ref070","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/239041.239045","article-title":"A probabilistic relational algebra for the integration of\n                        information retrieval and database systems","volume":"15","author":"Fuhr","year":"1997","journal-title":"ACM\n                        Trans. Inf. Syst"},{"issue":"1","key":"2025122708592468300_ref071","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2532641","article-title":"Oblivious bounds on the probability of boolean\n                        functions","volume":"39","author":"Gatterbauer","year":"2014","journal-title":"ACM Trans. Database Syst"},{"issue":"5","key":"2025122708592468300_ref072","first-page":"629","article-title":"Approximate lifted inference with probabilistic\n                        databases","volume":"8","author":"Gatterbauer","year":"2015","journal-title":"PVLDB"},{"key":"2025122708592468300_ref073","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/ICDE.1986.7266237","article-title":"A probability model of uncertainty in data\n                        bases","volume-title":"Proceedings of the Second International\n                        Conference on Data Engineering, February 5-7, 1986, Los Angeles, California,\n                        USA","author":"Gelenbe","year":"1986"},{"key":"2025122708592468300_ref074","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to Statistical Relational Learning (Adaptive\n                        Computation and Machine Learning series)","author":"Getoor","year":"2007"},{"key":"2025122708592468300_ref075","first-page":"461","article-title":"Selectivity estimation using probabilistic\n                        models","volume-title":"Proceedings of the 2001 ACM SIGMOD\n                        international conference on Management of data, Santa Barbara, CA, USA, May\n                        21-24, 2001","author":"Getoor","year":"2001"},{"key":"2025122708592468300_ref076","first-page":"174","article-title":"Perm: Processing provenance and data on the same data model\n                        through query rewriting","volume-title":"Proceedings of the 25th\n                        International Conference on Data Engineering, ICDE","author":"Glavic","year":"2009"},{"key":"2025122708592468300_ref077","first-page":"256","article-title":"Probabilistic theorem proving","volume-title":"UAI","author":"Gogate","year":"2011"},{"issue":"10","key":"2025122708592468300_ref078","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.dam.2005.09.016","article-title":"Factoring and recognition of read-once functions using\n                        cographs and normality and the readability of functions associated with\n                        partial k-trees","volume":"154","author":"Golumbic","year":"2006","journal-title":"Discrete Applied\n                        Mathematics"},{"key":"2025122708592468300_ref079","first-page":"633","article-title":"Model counting","volume-title":"Handbook of\n                        Satisfiability","author":"Gomes","year":"2009"},{"key":"2025122708592468300_ref080","first-page":"220","article-title":"Church: A language for generative models","volume-title":"Proceedings of UAI","author":"Goodman","year":"2008"},{"issue":"2","key":"2025122708592468300_ref081","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","article-title":"Query evaluation techniques for large\n                        databases","volume":"25","author":"Graefe","year":"1993","journal-title":"ACM Comput. Surv"},{"issue":"1","key":"2025122708592468300_ref082","first-page":"17","article-title":"Models for incomplete and probabilistic\n                        information","volume":"29","author":"Green","year":"2006","journal-title":"IEEE Data Eng. Bull"},{"issue":"7","key":"2025122708592468300_ref083","first-page":"552","article-title":"Slimshot: In-database probabilistic inference for knowledge\n                        bases","volume":"9","author":"Gribkoff","year":"2016","journal-title":"PVLDB"},{"key":"2025122708592468300_ref084","first-page":"280","article-title":"Understanding the complexity of lifted inference and\n                        asymmetric weighted model counting","volume-title":"UAI","author":"Gribkoff","year":"2014"},{"issue":"3","key":"2025122708592468300_ref085","first-page":"6","article-title":"Lifted probabilistic inference: A guide for the database\n                        researcher","volume":"37","author":"Gribkoff","year":"2014","journal-title":"IEEE Data Eng. Bull"},{"key":"2025122708592468300_ref086","article-title":"The most probable database problem","volume-title":"Proceedings of the First International Workshop on Big Uncertain\n                        Data (BUDA)","author":"Gribkoff","year":"2014"},{"key":"2025122708592468300_ref087","doi-asserted-by":"crossref","DOI":"10.1017\/9781139028868","volume-title":"Descriptive Complexity, Canonisation, and Definable Graph Structure\n                        Theory","author":"Grohe","year":"2017"},{"issue":"3","key":"2025122708592468300_ref088","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","article-title":"An analysis of first-order logics of\n                        probability","volume":"46","author":"Halpern","year":"1990","journal-title":"Artificial Intelligence"},{"key":"2025122708592468300_ref089","volume-title":"Reasoning about uncertainty","author":"Halpern","year":"2003"},{"key":"2025122708592468300_ref090","first-page":"311","volume-title":"Proceedings of the Tenth international conference on Uncertainty in\n                        artificial intelligence","author":"Heinsohn","year":"1994"},{"key":"2025122708592468300_ref091","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/253260.253291","article-title":"Online aggregation","volume-title":"Proc. of\n                        SIGMOD","author":"Hellerstein","year":"1997"},{"issue":"301","key":"2025122708592468300_ref092","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random\n                        variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"Journal of the American Statistical\n                        Association"},{"key":"2025122708592468300_ref093","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.artint.2012.06.001","article-title":"Yago2: A spatially and temporally enhanced knowledge base\n                        from wikipedia","volume":"194","author":"Hoffart","year":"2013","journal-title":"Artif. Intell"},{"key":"2025122708592468300_ref094","article-title":"A\n                        dynamic approach to probabilistic inference","volume-title":"Proceedings of UAI","author":"Horsch","year":"1990"},{"key":"2025122708592468300_ref095","first-page":"156","article-title":"Dpll with a trace: From sat to knowledge\n                        compilation","volume-title":"IJCAI","author":"Huang","year":"2005"},{"key":"2025122708592468300_ref096","first-page":"361","volume-title":"International Conference on Database Theory","author":"Hung","year":"2003"},{"issue":"4","key":"2025122708592468300_ref097","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/1634.1886","article-title":"Incomplete information in relational databases","volume":"31","author":"Imielinski","year":"1984","journal-title":"J. ACM"},{"key":"2025122708592468300_ref098","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/978-3-642-15369-3_46","volume-title":"Approximation, Randomization, and Combinatorial Optimization.\n                        Algorithms and Techniques, 13th International Workshop, APPROX 2010, and\n                        14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3,\n                        2010. Proceedings","author":"Impagliazzo","year":"2010"},{"key":"2025122708592468300_ref099","first-page":"266","volume-title":"Proceedings of the Thirteenth conference on Uncertainty in\n                        artificial intelligence","author":"Jaeger","year":"1997"},{"issue":"2","key":"2025122708592468300_ref100","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0004-3702(99)00109-5","article-title":"On the complexity of inference about probabilistic relational\n                        models","volume":"117","author":"Jaeger","year":"2000","journal-title":"Artificial Intelligence"},{"key":"2025122708592468300_ref101","article-title":"Liftability of probabilistic inference: Upper and lower\n                        bounds","volume-title":"Proceedings of the 2nd International\n                        Workshop on Statistical Relational AI","author":"Jaeger","year":"2012"},{"key":"2025122708592468300_ref102","first-page":"191","volume-title":"Proceedings of the Twenty-Third\n                        Conference on Uncertainty in Artificial Intelligence","author":"Jaimovich","year":"2007"},{"key":"2025122708592468300_ref103","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/1376616.1376686","volume-title":"Proceedings of the 2008 ACM SIGMOD\n                        international conference on Management of data","author":"Jampani","year":"2008"},{"key":"2025122708592468300_ref104","first-page":"725","article-title":"Scalable approximate query processing with the DBO\n                        engine","volume-title":"Proc. of SIGMOD","author":"Jermaine","year":"2007"},{"key":"2025122708592468300_ref105","article-title":"A\n                        fast variational approach for learning Markov random field language\n                        models","volume-title":"ICML","author":"Jernite","year":"2015"},{"key":"2025122708592468300_ref106","first-page":"973","article-title":"Lifted inference seen from the other side: The tractable\n                        features","volume-title":"NIPS","author":"Jha","year":"2010"},{"key":"2025122708592468300_ref107","first-page":"162","article-title":"Knowledge compilation meets database theory: compiling\n                        queries to decision diagrams","volume-title":"Database Theory -\n                        ICDT 2011, 14th International Conference, Uppsala, Sweden, March 21-24,\n                        2011, Proceedings","author":"Jha","year":"2011"},{"issue":"11","key":"2025122708592468300_ref108","first-page":"1160","article-title":"Probabilistic databases with markoviews","volume":"5","author":"Jha","year":"2012","journal-title":"PVLDB"},{"issue":"3","key":"2025122708592468300_ref109","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00224-012-9392-5","article-title":"Knowledge compilation meets database theory: Compiling\n                        queries to decision diagrams","volume":"52","author":"Jha","year":"2013","journal-title":"Theory Comput.\n                        Syst"},{"key":"2025122708592468300_ref110","first-page":"841","article-title":"Sensitivity analysis and explanations for robust query\n                        evaluation in probabilistic databases","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management\n                        of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011","author":"Kanagal","year":"2011"},{"key":"2025122708592468300_ref111","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/2882903.2882940","article-title":"Quickr: Lazily approximating complex adhoc queries in bigdata\n                        clusters","volume-title":"Proc. of SIGMOD","author":"Kandula","year":"2016"},{"key":"2025122708592468300_ref112","first-page":"56","article-title":"Monte-carlo algorithms for enumeration and reliability\n                        problems","volume-title":"24th Annual Symposium on Foundations of\n                        Computer Science, Tucson, Arizona, USA, 7-9 November 1983","author":"Karp","year":"1983"},{"key":"2025122708592468300_ref113","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v28i1.8847","article-title":"Elimination ordering in first-order probabilistic\n                        inference","volume-title":"AAAI","author":"Kazemi","year":"2014"},{"key":"2025122708592468300_ref114","article-title":"Knowledge compilation for lifted probabilistic inference:\n                        Compiling to a low-level language","volume-title":"KR","author":"Kazemi","year":"2016"},{"key":"2025122708592468300_ref115","article-title":"New liftable classes for first-order probabilistic\n                        inference","volume-title":"Advances in Neural Information\n                        Processing Systems 29 (NIPS)","author":"Kazemi","year":"2016"},{"issue":"1-2","key":"2025122708592468300_ref116","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.artint.2004.04.003","article-title":"Combining probabilistic logic programming with the power of\n                        maximum entropy","volume":"157","author":"Kern-Isberner","year":"2004","journal-title":"Artificial Intelligence"},{"key":"2025122708592468300_ref117","article-title":"Bayesian logic programs","volume-title":"arXiv\n                        preprint cs\/0111058","author":"Kersting","year":"2001"},{"key":"2025122708592468300_ref118","first-page":"277","volume-title":"Proceedings of the Twenty-Fifth Conference on Uncertainty in\n                        Artificial Intelligence","author":"Kersting","year":"2009"},{"key":"2025122708592468300_ref119","first-page":"27","volume-title":"Proceedings of the 33rd international conference on Very large data\n                        bases","author":"Kimelfeld","year":"2007"},{"key":"2025122708592468300_ref120","first-page":"1","article-title":"A\n                        short introduction to probabilistic soft logic","volume-title":"Proceedings of the NIPS Workshop on Probabilistic Programming:\n                        Foundations and Applications","author":"Kimmig","year":"2012"},{"key":"2025122708592468300_ref121","first-page":"1315","article-title":"Lifted symmetry detection and breaking for MAP\n                        inference","volume-title":"NIPS","author":"Kopp","year":"2015"},{"issue":"4","key":"2025122708592468300_ref122","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/371578.371598","article-title":"The state of the art in distributed query\n                        processing","volume":"32","author":"Kossmann","year":"2000","journal-title":"ACM Comput. Surv"},{"issue":"3","key":"2025122708592468300_ref123","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/261124.261131","article-title":"Probview: A flexible probabilistic database\n                        system","volume":"22","author":"Lakshmanan","year":"1997","journal-title":"ACM Trans. Database Syst"},{"key":"2025122708592468300_ref124","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Representation of switching circuits by binary-decision\n                        programs","volume":"38","author":"Lee","year":"1959","journal-title":"Bell System Technical Journal"},{"key":"2025122708592468300_ref125","first-page":"259","article-title":"Consensus answers for queries over probabilistic\n                        databases","volume-title":"Proceedings of the Twenty-Eigth ACM\n                        SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009,\n                        June 19 - July 1, 2009, Providence, Rhode Island, USA","author":"Li","year":"2009"},{"issue":"2","key":"2025122708592468300_ref126","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00778-011-0220-3","article-title":"A unified approach to ranking in probabilistic\n                        databases","volume":"20","author":"Li","year":"2011","journal-title":"VLDB J"},{"key":"2025122708592468300_ref127","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements\n                        of Finite Model Theory","author":"Libkin","year":"2004"},{"key":"2025122708592468300_ref128","first-page":"94","article-title":"SQL\u2019s three-valued logic and certain\n                        answers","volume-title":"18th International Conference on\n                        Database Theory, ICDT 2015, March 23-27, 2015, Brussels, Belgium","author":"Libkin","year":"2015"},{"key":"2025122708592468300_ref129","first-page":"200","volume-title":"European Conference on Principles of\n                        Data Mining and Knowledge Discovery","author":"Lowd","year":"2007"},{"issue":"6","key":"2025122708592468300_ref130","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1016\/j.artint.2007.10.017","article-title":"Expressive probabilistic description logics","volume":"172","author":"Lukasiewicz","year":"2008","journal-title":"Artificial Intelligence"},{"key":"2025122708592468300_ref131","article-title":"Factorie: Probabilistic programming via imperatively defined\n                        factor graphs","volume-title":"Neural Information Processing\n                        Systems (NIPS)","author":"McCallum","year":"2009"},{"key":"2025122708592468300_ref132","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/1273496.1273575","volume-title":"Proceedings of the 24th international\n                        conference on Machine learning","author":"Mihalkova","year":"2007"},{"issue":"3","key":"2025122708592468300_ref133","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.jcss.2006.10.004","article-title":"A\n                        formal analysis of information disclosure in data exchange","volume":"73","author":"Miklau","year":"2007","journal-title":"J. Comput. Syst. Sci"},{"key":"2025122708592468300_ref134","doi-asserted-by":"crossref","first-page":"373","DOI":"10.7551\/mitpress\/7432.003.0015","article-title":"BLOG: Probabilistic models with unknown\n                        objects","volume-title":"Introduction to statistical relational\n                        learning","author":"Milch","year":"2007"},{"key":"2025122708592468300_ref135","first-page":"1062","article-title":"Lifted probabilistic inference with counting\n                        formulae","volume-title":"AAAI","author":"Milch","year":"2008"},{"key":"2025122708592468300_ref136","first-page":"2302","article-title":"Never-ending learning","volume-title":"Proceedings\n                        of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January\n                        25-30, 2015, Austin, Texas, USA","author":"Mitchell","year":"2015"},{"key":"2025122708592468300_ref137","first-page":"47","article-title":"Query containment of tier-2 queries over a probabilistic\n                        database","volume-title":"Proceedings of the Third VLDB workshop\n                        on Management of Uncertain Data (MUD2009) in conjunction with VLDB 2009,\n                        Lyon, France, August 28th, 2009","author":"Moore","year":"2009"},{"key":"2025122708592468300_ref138","first-page":"254","article-title":"Stochastic logic programs","volume":"32","author":"Muggleton","year":"1996","journal-title":"Advances\n                        in inductive logic programming"},{"issue":"4","key":"2025122708592468300_ref139","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2590989.2590991","article-title":"Skew strikes back: new developments in the theory of join\n                        algorithms","volume":"42","author":"Ngo","year":"2013","journal-title":"SIGMOD Record"},{"issue":"1","key":"2025122708592468300_ref140","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0304-3975(96)00128-4","article-title":"Answering queries from context-sensitive probabilistic\n                        knowledge bases","volume":"171","author":"Ngo","year":"1997","journal-title":"Theoretical Computer\n                        Science"},{"key":"2025122708592468300_ref141","article-title":"Markov chains on orbits of permutation\n                    groups","volume-title":"UAI","author":"Niepert","year":"2012"},{"key":"2025122708592468300_ref142","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v28i1.9073","article-title":"Tractability through exchangeability: A new perspective on\n                        efficient probabilistic inference","volume-title":"Proceedings of\n                        the 28th AAAI Conference on Artificial Intelligence, AAAI Conference on\n                        Artificial Intelligence","author":"Niepert","year":"2014"},{"key":"2025122708592468300_ref143","first-page":"646","volume-title":"Proceedings of the 28th international conference on Very Large Data\n                        Bases","author":"Nierman","year":"2002"},{"issue":"1","key":"2025122708592468300_ref144","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artificial\n                        intelligence"},{"issue":"3","key":"2025122708592468300_ref145","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10994-016-5558-8","article-title":"Probabilistic logic programming for hybrid relational\n                        domains","volume":"103","author":"Nitti","year":"2016","journal-title":"Machine Learning"},{"issue":"6","key":"2025122708592468300_ref146","first-page":"373","article-title":"Tuffy: Scaling up statistical inference in markov logic\n                        networks using an rdbms","volume":"4","author":"Niu","year":"2011","journal-title":"PVLDB"},{"key":"2025122708592468300_ref147","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-540-87993-0_26","article-title":"Using obdds for efficient query evaluation on probabilistic\n                        databases","volume-title":"Scalable Uncertainty Management,\n                        Second International Conference, SUM 2008, Naples, Italy, October 1-3, 2008.\n                        Proceedings","author":"Olteanu","year":"2008"},{"key":"2025122708592468300_ref148","first-page":"389","article-title":"Secondary-storage confidence computation for conjunctive\n                        queries with inequalities","volume-title":"SIGMOD\n                        Conference","author":"Olteanu","year":"2009"},{"key":"2025122708592468300_ref149","first-page":"640","article-title":"Sprout: Lazy vs. eager query plans for tuple-independent\n                        probabilistic databases","volume-title":"ICDE","author":"Olteanu","year":"2009"},{"key":"2025122708592468300_ref150","first-page":"145","article-title":"Approximate confidence computation in probabilistic\n                        databases","volume-title":"Proceedings of the 26th International\n                        Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach,\n                        California, USA","author":"Olteanu","year":"2010"},{"key":"2025122708592468300_ref151","volume-title":"Technical Report UCB\/CSD-01-1161, Computer Science\n                    Division","author":"Paskin","year":"2002"},{"key":"2025122708592468300_ref152","volume-title":"Probabilistic reasoning in intelligent systems: networks of\n                        plausible inference","author":"Pearl","year":"1988"},{"key":"2025122708592468300_ref153","volume-title":"Fuzzy\n                        databases: principles and applications","author":"Petry","year":"2012"},{"key":"2025122708592468300_ref154","article-title":"Figaro: An object-oriented probabilistic programming\n                        language","volume-title":"Charles River Analytics Technical\n                        Report","author":"Pfeffer","year":"2009"},{"issue":"1","key":"2025122708592468300_ref155","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","article-title":"Probabilistic horn abduction and Bayesian\n                        networks","volume":"64","author":"Poole","year":"1993","journal-title":"Artificial intelligence"},{"issue":"1","key":"2025122708592468300_ref156","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0004-3702(97)00027-1","article-title":"The independent choice logic for modelling multiple agents\n                        under uncertainty","volume":"94","author":"Poole","year":"1997","journal-title":"Artificial Intelligence"},{"key":"2025122708592468300_ref157","first-page":"985","article-title":"First-order probabilistic inference","volume":"3","author":"Poole","year":"2003","journal-title":"IJCAI"},{"issue":"4","key":"2025122708592468300_ref158","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The\n                        complexity of counting cuts and of computing the probability that a graph is\n                        connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput"},{"key":"2025122708592468300_ref159","first-page":"51","article-title":"Materialized views in probabilistic databases for information\n                        exchange and query optimization","volume-title":"Proceedings of\n                        the 33rd International Conference on Very Large Data Bases, University of\n                        Vienna, Austria, September 23-27, 2007","author":"R\u00e9","year":"2007"},{"key":"2025122708592468300_ref160","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-540-87993-0_3","article-title":"Managing probabilistic data with mystiq: The can-do, the\n                        could-do, and the can\u2019t-do","volume-title":"Scalable\n                        Uncertainty Management, Second International Conference, SUM 2008, Naples,\n                        Italy, October 1-3, 2008. Proceedings","author":"R\u00e9","year":"2008"},{"issue":"5","key":"2025122708592468300_ref161","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/s00778-009-0151-4","article-title":"The trichotomy of HAVING queries on a probabilistic\n                        database","volume":"18","author":"R\u00e9","year":"2009","journal-title":"VLDB J"},{"key":"2025122708592468300_ref162","first-page":"886","article-title":"Efficient top-k query evaluation on probabilistic\n                        data","volume-title":"Proceedings of the 23rd International\n                        Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul,\n                        Turkey, April 15-20, 2007","author":"R\u00e9","year":"2007"},{"key":"2025122708592468300_ref163","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","article-title":"On closed world data bases","volume-title":"Logic and\n                        Data Bases","author":"Reiter","year":"1978"},{"issue":"3","key":"2025122708592468300_ref164","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10994-012-5304-9","article-title":"k-optimal: a novel approximate inference algorithm for\n                        problog","volume":"89","author":"Renkens","year":"2012","journal-title":"Machine learning"},{"key":"2025122708592468300_ref165","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v28i1.9067","article-title":"Explanation-based approximate weighted model counting for\n                        probabilistic logics","volume-title":"AAAI Workshop: Statistical\n                        Relational Artificial Intelligence","author":"Renkens","year":"2014"},{"issue":"1-2","key":"2025122708592468300_ref166","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","article-title":"Markov logic networks","volume":"62","author":"Richardson","year":"2006","journal-title":"Machine\n                        Learning"},{"key":"2025122708592468300_ref167","first-page":"109","volume-title":"Congress of the Italian Association for Artificial\n                        Intelligence","author":"Riguzzi","year":"2007"},{"issue":"1-2","key":"2025122708592468300_ref168","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","article-title":"On\n                        the hardness of approximate reasoning","volume":"82","author":"Roth","year":"1996","journal-title":"Artif.\n                        Intell"},{"issue":"7","key":"2025122708592468300_ref169","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/2699411","article-title":"Unifying logic and probability","volume":"58","author":"Russell","year":"2015","journal-title":"Commun. ACM"},{"key":"2025122708592468300_ref170","article-title":"Combining component caching and clause learning for effective\n                        model counting","volume-title":"SAT","author":"Sang","year":"2004"},{"key":"2025122708592468300_ref171","first-page":"715","volume-title":"Proceedings of the 12th International\n                        Conference on Logic Programming (ICLP)","author":"Sato","year":"1995"},{"key":"2025122708592468300_ref172","first-page":"1330","article-title":"PRISM: a language for symbolic-statistical\n                        modeling","volume":"15","author":"Sato","year":"1997","journal-title":"Proceedings of the International Joint\n                        Conference on Artificial Intelligence"},{"key":"2025122708592468300_ref173","first-page":"1088","article-title":"Learning first-order horn clauses from web\n                        text","volume-title":"Proceedings of the 2010 Conference on\n                        Empirical Methods in Natural Language Processing, EMNLP 2010, 9-11 October\n                        2010, MIT Stata Center, Massachusetts, USA, A meeting of SIGDAT, a Special\n                        Interest Group of the ACL","author":"Schoenmackers","year":"2010"},{"key":"2025122708592468300_ref174","first-page":"496","volume-title":"Proceedings of the twenty-fifth\n                        conference on uncertainty in artificial intelligence","author":"Sen","year":"2009"},{"key":"2025122708592468300_ref175","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/1265530.1265570","volume-title":"Proceedings of the twenty-sixth ACM\n                        SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"Senellart","year":"2007"},{"issue":"11","key":"2025122708592468300_ref176","first-page":"1310","article-title":"Incremental knowledge base construction using\n                        deepdive","volume":"8","author":"Shin","year":"2015","journal-title":"PVLDB"},{"key":"2025122708592468300_ref177","first-page":"1239","article-title":"Orion 2.0: native support for uncertain data","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management\n                        of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008","author":"Singh","year":"2008"},{"key":"2025122708592468300_ref178","first-page":"1094","article-title":"Lifted first-order belief propagation","volume":"8","author":"Singla","year":"2008","journal-title":"AAAI"},{"key":"2025122708592468300_ref179","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"Stanley","year":"1997"},{"key":"2025122708592468300_ref180","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01879-4","volume-title":"Probabilistic Databases","author":"Suciu","year":"2011"},{"key":"2025122708592468300_ref181","first-page":"1052","article-title":"First-order decomposition trees","volume-title":"Advances in Neural Information Processing Systems","author":"Taghipour","year":"2013"},{"key":"2025122708592468300_ref182","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/IRI.2006.252408","volume-title":"2006 IEEE\n                        International Conference on Information Reuse & Integration","author":"Udrea","year":"2006"},{"issue":"2","key":"2025122708592468300_ref183","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","article-title":"The complexity of counting in sparse, regular, and planar\n                        graphs","volume":"31","author":"Vadhan","year":"2001","journal-title":"SIAM J. Comput"},{"key":"2025122708592468300_ref184","doi-asserted-by":"crossref","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability\n                        problems","volume-title":"SIAM J. Comput","author":"Valiant","year":"1979"},{"key":"2025122708592468300_ref185","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci"},{"key":"2025122708592468300_ref186","first-page":"1386","article-title":"On the completeness of first-order knowledge compilation for\n                        lifted probabilistic inference","volume-title":"Advances in\n                        Neural Information Processing Systems 24 (NIPS)","author":"Van den Broeck","year":"2011"},{"key":"2025122708592468300_ref187","volume-title":"Lifted Inference and Learning in Statistical Relational\n                        Models","author":"Van den Broeck","year":"2013"},{"key":"2025122708592468300_ref188","article-title":"Towards high-level probabilistic reasoning with lifted\n                        inference","volume-title":"Proceedings of the AAAI Spring\n                        Symposium on KRR","author":"Van den Broeck","year":"2015"},{"key":"2025122708592468300_ref189","article-title":"On the complexity and approximation of binary evidence in\n                        lifted inference","volume-title":"Advances in Neural Information\n                        Processing Systems 26 (NIPS)","author":"Van den Broeck","year":"2013"},{"key":"2025122708592468300_ref190","first-page":"1","volume-title":"Proceedings of the\n                        Twenty-Sixth AAAI Conference on Artificial Intelligence","author":"Van den Broeck","year":"2012"},{"key":"2025122708592468300_ref191","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v29i1.9678","article-title":"Lifted probabilistic inference for asymmetric graphical\n                        models","volume-title":"Proceedings of the 29th Conference on\n                        Artificial Intelligence (AAAI)","author":"Van den Broeck","year":"2015"},{"key":"2025122708592468300_ref192","first-page":"2178","article-title":"Lifted probabilistic inference by first-order knowledge\n                        compilation","volume-title":"IJCAI","author":"Van den Broeck","year":"2011"},{"key":"2025122708592468300_ref193","article-title":"Lifted relax, compensate and then recover: From approximate\n                        to exact lifted probabilistic inference","volume-title":"Proceedings of the 28th Conference on Uncertainty in Artificial\n                        Intelligence (UAI)","author":"Van den Broeck","year":"2012"},{"key":"2025122708592468300_ref194","article-title":"Skolemization for weighted first-order model\n                        counting","volume-title":"KR","author":"Van den Broeck","year":"2014"},{"issue":"1","key":"2025122708592468300_ref195","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10994-015-5532-x","article-title":"Lifted generative learning of Markov logic\n                        networks","volume":"103","author":"Van Haaren","year":"2016","journal-title":"Machine Learning"},{"key":"2025122708592468300_ref196","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-540-27775-0_30","article-title":"Logic programs with annotated disjunctions","volume-title":"Logic Programming","author":"Vennekens","year":"2004"},{"issue":"3","key":"2025122708592468300_ref197","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S1471068409003767","article-title":"CP-logic: A language of causal probabilistic events and its\n                        relation to logic programming","volume":"9","author":"Vennekens","year":"2009","journal-title":"Theory and Practice\n                        of Logic Programming"},{"key":"2025122708592468300_ref198","first-page":"2978","article-title":"Scaling-up importance sampling for Markov logic\n                        networks","volume-title":"Advances in Neural Information\n                        Processing Systems","author":"Venugopal","year":"2014"},{"key":"2025122708592468300_ref199","article-title":"Anytime inference in probabilistic logic programs with\n                        Tpcompilation","volume-title":"Proceedings of 24th International\n                        Joint Conference on Artificial Intelligence (IJCAI)","author":"Vlasselaer","year":"2015"},{"key":"2025122708592468300_ref200","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1145\/2505515.2505573","volume-title":"Proceedings of\n                        the 22nd ACM international conference on Information & Knowledge\n                        Management","author":"Wang","year":"2013"},{"key":"2025122708592468300_ref201","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams","author":"Wegener","year":"2000"},{"issue":"1-2","key":"2025122708592468300_ref202","doi-asserted-by":"crossref","first-page":"794","DOI":"10.14778\/1920841.1920942","article-title":"Scalable probabilistic databases with factor graphs and\n                        mcmc","volume":"3","author":"Wick","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2025122708592468300_ref203","first-page":"481","article-title":"Probase: a probabilistic taxonomy for text\n                        understanding","volume-title":"Proceedings of the ACM SIGMOD\n                        International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ,\n                        USA, May 20-24, 2012","author":"Wu","year":"2012"},{"key":"2025122708592468300_ref204","first-page":"277","article-title":"The analytical bootstrap: a new method for fast error\n                        estimation in approximate query processing","volume-title":"SIGMOD Conference","author":"Zeng","year":"2014"},{"key":"2025122708592468300_ref205","volume-title":"DeepDive:\n                        a data management system for automatic knowledge base construction","author":"Zhang","year":"2015"},{"key":"2025122708592468300_ref206","first-page":"556","article-title":"On the semantics and evaluation of top-k queries in\n                        probabilistic databases","volume-title":"Proceedings of the 24th\n                        International Conference on Data Engineering Workshops, ICDE 2008, April\n                        7-12, 2008, Canc\u00fan, M\u00e9xico","author":"Zhang","year":"2008"},{"key":"2025122708592468300_ref207","first-page":"408","volume-title":"European conference on computer\n                        vision","author":"Zhu","year":"2014"},{"key":"2025122708592468300_ref208","article-title":"Building a large-scale multimodal knowledge base system for\n                        answering visual queries","volume-title":"arXiv preprint\n                        arXiv:1507.05670","author":"Zhu","year":"2015"}],"container-title":["Foundations and Trends in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/7\/3-4\/197\/11152860\/1900000052en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/7\/3-4\/197\/11152860\/1900000052en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:11:39Z","timestamp":1777471899000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftdbs\/article\/7\/3-4\/197\/1332327\/Query-Processing-on-Probabilistic-Data-A-Survey"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":208,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2017,8,7]]}},"URL":"https:\/\/doi.org\/10.1561\/1900000052","relation":{},"ISSN":["1931-7883","1931-7891"],"issn-type":[{"value":"1931-7883","type":"print"},{"value":"1931-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,7]]}}}