{"id":"https://openalex.org/W4417316699","doi":"https://doi.org/10.46298/lmcs-21(4:30)2025","title":"Approximating Queries on Probabilistic Graphs","display_name":"Approximating Queries on Probabilistic Graphs","publication_year":2025,"publication_date":"2025-12-15","ids":{"openalex":"https://openalex.org/W4417316699","doi":"https://doi.org/10.46298/lmcs-21(4:30)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:30)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:30)2025","pdf_url":"https://lmcs.episciences.org/17113/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/17113/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003960537","display_name":"Antoine Amarilli","orcid":"https://orcid.org/0000-0002-7977-4441"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210140143","display_name":"Dynamic Systems (United States)","ror":"https://ror.org/043vm9914","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140143"]}],"countries":["FR","US"],"is_corresponding":true,"raw_author_name":"Antoine Amarilli","raw_affiliation_strings":["DIG - Data, Intelligence and Graphs (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 Palaiseau - France)","D-DAL - Donn\u00e9es : algorithmiques et logiques dynamiques (Data : Dynamics Algorithmics and Logics \r\nCentre Inria de l'Universit\u00e9 de Lille - 59650 Villeneuve d'Ascq - France)"],"affiliations":[{"raw_affiliation_string":"DIG - Data, Intelligence and Graphs (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I12356871"]},{"raw_affiliation_string":"D-DAL - Donn\u00e9es : algorithmiques et logiques dynamiques (Data : Dynamics Algorithmics and Logics \r\nCentre Inria de l'Universit\u00e9 de Lille - 59650 Villeneuve d'Ascq - France)","institution_ids":["https://openalex.org/I4210140143"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043401121","display_name":"Timothy van Bremen","orcid":"https://orcid.org/0009-0004-0538-3044"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Timothy van Bremen","raw_affiliation_strings":["NTU - Nanyang Technological University [Singapour] (50 Nanyang Ave, Singapour 639798 - Singapore)"],"affiliations":[{"raw_affiliation_string":"NTU - Nanyang Technological University [Singapour] (50 Nanyang Ave, Singapour 639798 - Singapore)","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120800804","display_name":"Octave Gaspard","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Octave Gaspard","raw_affiliation_strings":["X - \u00c9cole polytechnique (Route de Saclay, 91128 Palaiseau Cedex - France)"],"affiliations":[{"raw_affiliation_string":"X - \u00c9cole polytechnique (Route de Saclay, 91128 Palaiseau Cedex - France)","institution_ids":["https://openalex.org/I142476485"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041528950","display_name":"Kuldeep S. Meel","orcid":"https://orcid.org/0000-0001-9423-5270"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I2801862477","display_name":"Canada Research Chairs","ror":"https://ror.org/0517h6h17","country_code":"CA","type":"government","lineage":["https://openalex.org/I2801862477","https://openalex.org/I2802286613"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kuldeep S. Meel","raw_affiliation_strings":["University of Toronto (27 King's College Circle, Toronto M5S 1A1 - Canada)"],"affiliations":[{"raw_affiliation_string":"University of Toronto (27 King's College Circle, Toronto M5S 1A1 - Canada)","institution_ids":["https://openalex.org/I2801862477","https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003960537"],"corresponding_institution_ids":["https://openalex.org/I12356871","https://openalex.org/I4210140143"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20585182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.35929998755455017,"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"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.35929998755455017,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.20149999856948853,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.07490000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.786300003528595},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.760200023651123},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.7269999980926514},{"id":"https://openalex.org/keywords/probabilistic-database","display_name":"Probabilistic database","score":0.4742000102996826},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47369998693466187},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42010000348091125},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4154999852180481},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.40119999647140503},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4009999930858612},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.40070000290870667}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.786300003528595},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.760200023651123},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.7269999980926514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6238999962806702},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5206999778747559},{"id":"https://openalex.org/C174539288","wikidata":"https://www.wikidata.org/wiki/Q7246853","display_name":"Probabilistic database","level":4,"score":0.4742000102996826},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47369998693466187},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4154999852180481},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.40070000290870667},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C98199447","wikidata":"https://www.wikidata.org/wiki/Q2445044","display_name":"Materialized view","level":4,"score":0.34200000762939453},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3301999866962433},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.320499986410141},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C33762810","wikidata":"https://www.wikidata.org/wiki/Q461671","display_name":"Data integrity","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30640000104904175},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.29089999198913574},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2678000032901764},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.2612000107765198},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2549999952316284},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(4:30)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:30)2025","pdf_url":"https://lmcs.episciences.org/17113/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04871474v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04871474","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2025, 21 (4), ⟨10.46298/lmcs-21(4:30)2025⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:30)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:30)2025","pdf_url":"https://lmcs.episciences.org/17113/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3000731886","display_name":null,"funder_award_id":"NRF-NRFFAI1-2019-0004","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"},{"id":"https://openalex.org/G3176778049","display_name":null,"funder_award_id":"ANR-18-CE23-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4032234667","display_name":"Efficient Query answering Under UpdateS","funder_award_id":"ANR-19-CE48-0019","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6876561401","display_name":null,"funder_award_id":"ANR-18","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7512936925","display_name":null,"funder_award_id":"431183758","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8318455765","display_name":null,"funder_award_id":"ANR-19","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8777520260","display_name":null,"funder_award_id":"CE23-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417316699.pdf","grobid_xml":"https://content.openalex.org/works/W4417316699.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Query":[0],"evaluation":[1,211],"over":[2,52],"probabilistic":[3,50,56,67,187,220],"databases":[4,51],"is":[5],"notoriously":[6],"intractable":[7],"--":[8],"not":[9],"only":[10],"in":[11,16,36,222,228],"combined":[12,31,64,176],"complexity,":[13],"but":[14],"often":[15],"data":[17,224],"complexity":[18,73,225],"as":[19],"well.":[20],"This":[21,103],"motivates":[22],"the":[23,38,72,119,135,141,190,194,210,223],"study":[24,59],"of":[25,30,74,80,110,121,137,168,182,214,232],"approximation":[26],"algorithms,":[27],"and":[28,40,58,82,90,155,171,212],"particularly":[29],"FPRASes,":[32],"with":[33,95],"runtime":[34],"polynomial":[35],"both":[37,87],"query":[39,68,81],"instance":[41,83],"size.":[42],"In":[43],"this":[44,75],"paper,":[45],"we":[46,61,116],"focus":[47],"on":[48,126,146,186,209,219],"tuple-independent":[49],"binary":[53],"signatures,":[54],"i.e.,":[55],"graphs,":[57,149],"when":[60],"can":[62,197,206],"devise":[63],"FPRASes":[65],"for":[66,77,140,178],"evaluation.":[69],"We":[70,158,200],"settle":[71],"problem":[76,145],"a":[78,150,165,175],"variety":[79],"classes,":[84],"by":[85,131,153],"proving":[86],"approximability":[88,213],"results":[89,93,120],"(conditional)":[91],"inapproximability":[92],"together":[94],"(unconditional)":[96],"DNNF":[97],"provenance":[98],"circuit":[99],"size":[100],"lower":[101],"bounds.":[102],"allows":[104],"us":[105],"to":[106],"deduce":[107],"many":[108],"corollaries":[109],"possible":[111],"independent":[112],"interest.":[113],"For":[114],"example,":[115],"show":[117,160,202],"how":[118,203],"Arenas":[122],"et":[123],"al.":[124],"[ACJR21a]":[125],"counting":[127],"fixed-length":[128],"strings":[129],"accepted":[130],"an":[132,138],"NFA":[133],"imply":[134],"existence":[136],"FPRAS":[139,177],"two-terminal":[142],"network":[143],"reliability":[144],"directed":[147],"acyclic":[148],"question":[151],"asked":[152],"Zenklusen":[154],"Laumanns":[156],"[ZL11].":[157],"also":[159],"that":[161,230],"one":[162],"cannot":[163],"extend":[164],"recent":[166],"result":[167],"van":[169],"Bremen":[170],"Meel":[172],"[vBM23]":[173],"giving":[174],"self-join-free":[179],"conjunctive":[180],"queries":[181,217],"bounded":[183],"hypertree":[184],"width":[185],"databases:":[188],"neither":[189],"bounded-hypertree-width":[191],"condition":[192],"nor":[193],"self-join-freeness":[195],"hypothesis":[196],"be":[198],"relaxed.":[199],"last":[201],"our":[204],"methods":[205],"give":[207],"insights":[208],"regular":[215],"path":[216],"(RPQs)":[218],"graphs":[221],"perspective,":[226],"showing":[227],"particular":[229],"some":[231],"them":[233],"are":[234],"(conditionally)":[235],"inapproximable.":[236]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-12-15T00:00:00"}