{"id":"https://openalex.org/W4414977436","doi":"https://doi.org/10.1145/3763058","title":"Probabilistic Inference for Datalog with Correlated Inputs","display_name":"Probabilistic Inference for Datalog with Correlated Inputs","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414977436","doi":"https://doi.org/10.1145/3763058"},"language":"en","primary_location":{"id":"doi:10.1145/3763058","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763058","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3763058","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100456758","display_name":"Jingbo Wang","orcid":"https://orcid.org/0000-0001-5877-2677"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingbo Wang","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0001-5877-2677","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108158539","display_name":"Shashin Halalingaiah","orcid":"https://orcid.org/0000-0002-1268-4345"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shashin Halalingaiah","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0000-0002-1268-4345","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Weiyi Chen","orcid":"https://orcid.org/0009-0009-6276-3525"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiyi Chen","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0009-0009-6276-3525","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101934907","display_name":"Chao Wang","orcid":"https://orcid.org/0009-0003-4684-3943"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Wang","raw_affiliation_strings":["University of Southern California, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0009-0003-4684-3943","affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006424908","display_name":"I\u015f\u0131l Dillig","orcid":"https://orcid.org/0000-0001-8006-1230"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I\u015f\u0131l Dillig","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0000-0001-8006-1230","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26575433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"220","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.715399980545044},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.7132999897003174},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7038000226020813},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48809999227523804},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.48030000925064087},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4487000107765198},{"id":"https://openalex.org/keywords/probabilistic-relevance-model","display_name":"Probabilistic relevance model","score":0.42820000648498535},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"Variable elimination","score":0.39809998869895935},{"id":"https://openalex.org/keywords/approximate-inference","display_name":"Approximate inference","score":0.39480000734329224}],"concepts":[{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.715399980545044},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.7132999897003174},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7038000226020813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6657000184059143},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48809999227523804},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.48030000925064087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4652999937534332},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C143017306","wikidata":"https://www.wikidata.org/wiki/Q3318133","display_name":"Probabilistic relevance model","level":4,"score":0.42820000648498535},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.39809998869895935},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.39480000734329224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38589999079704285},{"id":"https://openalex.org/C95167961","wikidata":"https://www.wikidata.org/wiki/Q4483495","display_name":"Fiducial inference","level":5,"score":0.3677000105381012},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3456999957561493},{"id":"https://openalex.org/C18998212","wikidata":"https://www.wikidata.org/wiki/Q7246856","display_name":"Probabilistic logic network","level":5,"score":0.3366999924182892},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.3303999900817871},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32429999113082886},{"id":"https://openalex.org/C134261354","wikidata":"https://www.wikidata.org/wiki/Q938438","display_name":"Statistical inference","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2888999879360199},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.28839999437332153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28519999980926514},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.27869999408721924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26820001006126404},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3763058","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763058","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3763058","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763058","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5600660201","display_name":null,"funder_award_id":"CCF-1762299, CCF-1918889, CNS-1908304, CCF-1901376, CNS-2120696, CCF-2210831, CCF-2319471, CCF-2422130, CCF-2403211","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W583811006","https://openalex.org/W1511986666","https://openalex.org/W1535430927","https://openalex.org/W1548348968","https://openalex.org/W1604784085","https://openalex.org/W1671718115","https://openalex.org/W1971859150","https://openalex.org/W2050680750","https://openalex.org/W2052451171","https://openalex.org/W2054284548","https://openalex.org/W2080267935","https://openalex.org/W2102506621","https://openalex.org/W2128088446","https://openalex.org/W2283350629","https://openalex.org/W2340222647","https://openalex.org/W2395654200","https://openalex.org/W2465254145","https://openalex.org/W2473721375","https://openalex.org/W2494200839","https://openalex.org/W2525811808","https://openalex.org/W2547963919","https://openalex.org/W2608651664","https://openalex.org/W2740847919","https://openalex.org/W2765370125","https://openalex.org/W2798352717","https://openalex.org/W2897613819","https://openalex.org/W2925599298","https://openalex.org/W2926374695","https://openalex.org/W2963572185","https://openalex.org/W2967845347","https://openalex.org/W2998758053","https://openalex.org/W3005050519","https://openalex.org/W3104035686","https://openalex.org/W3107908039","https://openalex.org/W3159836140","https://openalex.org/W3173567886","https://openalex.org/W4245743185","https://openalex.org/W4247889999","https://openalex.org/W4248199421","https://openalex.org/W4256210729","https://openalex.org/W4281938159","https://openalex.org/W4299881428","https://openalex.org/W4300810260","https://openalex.org/W4399851487","https://openalex.org/W6949435635"],"related_works":[],"abstract_inverted_index":{"Probabilistic":[0],"extensions":[1],"of":[2,18,51,83],"logic":[3],"programming":[4],"languages,":[5],"such":[6],"as":[7,61],"ProbLog,":[8],"integrate":[9],"logical":[10],"reasoning":[11],"with":[12],"probabilistic":[13,46],"inference":[14,47,59,107],"to":[15,41,80,95],"evaluate":[16],"probabilities":[17],"output":[19,76],"relations;":[20],"however,":[21],"prior":[22],"work":[23],"does":[24,92],"not":[25,93,132],"account":[26],"for":[27,44,75],"potential":[28],"statistical":[29],"correlations":[30],"among":[31],"input":[32,54],"facts.":[33,77],"This":[34],"paper":[35],"introduces":[36],"Praline,":[37],"a":[38,62,103],"new":[39],"extension":[40],"Datalog":[42],"designed":[43],"precise":[45,72],"in":[48],"the":[49,58,67,81,84],"presence":[50],"(partially":[52],"known)":[53],"correlations.":[55],"We":[56],"formulate":[57],"task":[60],"constrained":[63],"optimization":[64,86],"problem,":[65,87],"where":[66],"solution":[68],"yields":[69],"sound":[70],"and":[71,115],"probability":[73,140],"bounds":[74],"However,":[78],"due":[79],"complexity":[82],"resulting":[85],"this":[88],"approach":[89],"alone":[90],"often":[91],"scale":[94],"large":[96],"programs.":[97],"To":[98],"address":[99],"scalability,":[100],"we":[101],"propose":[102],"more":[104],"efficient":[105],"\u03b4-exact":[106],"algorithm":[108],"that":[109,129],"leverages":[110],"constraint":[111],"solving,":[112],"static":[113],"analysis,":[114,127],"iterative":[116],"refinement.":[117],"Our":[118],"empirical":[119],"evaluation":[120],"on":[121],"challenging":[122],"real-world":[123],"benchmarks,":[124],"including":[125],"side-channel":[126],"demonstrates":[128],"our":[130],"method":[131],"only":[133],"scales":[134],"effectively":[135],"but":[136],"also":[137],"delivers":[138],"tight":[139],"bounds.":[141]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}