{"id":"https://openalex.org/W4408219526","doi":"https://doi.org/10.46298/lmcs-21(1:21)2025","title":"Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries","display_name":"Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries","publication_year":2025,"publication_date":"2025-03-05","ids":{"openalex":"https://openalex.org/W4408219526","doi":"https://doi.org/10.46298/lmcs-21(1:21)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(1:21)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:21)2025","pdf_url":"https://lmcs.episciences.org/15319/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/15319/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002674443","display_name":"Diego Figueira","orcid":"https://orcid.org/0000-0003-0114-2257"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Diego Figueira","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064667017","display_name":"R\u00e9mi Morvan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R\u00e9mi Morvan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002674443"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5287,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80702159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"Volume 21, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9911999702453613,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9896000027656555,"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/path","display_name":"Path (computing)","score":0.7041618824005127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6840387582778931},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5620762705802917},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5406664609909058},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3335028290748596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2514367699623108},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24282389879226685},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1875799000263214},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.11606857180595398},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09786346554756165}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7041618824005127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840387582778931},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5620762705802917},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5406664609909058},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3335028290748596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2514367699623108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24282389879226685},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1875799000263214},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.11606857180595398},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09786346554756165}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(1:21)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:21)2025","pdf_url":"https://lmcs.episciences.org/15319/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-04311290v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04311290","pdf_url":null,"source":{"id":"https://openalex.org/S4406922454","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 (1), ⟨10.46298/lmcs-21(1:21)2025⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:86f513d2e31b45d3b8bae673c70cc00c","is_oa":true,"landing_page_url":"https://doaj.org/article/86f513d2e31b45d3b8bae673c70cc00c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 1 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(1:21)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:21)2025","pdf_url":"https://lmcs.episciences.org/15319/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4408219526.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W1810918211"],"abstract_inverted_index":{"We":[0,112,127],"show":[1,102],"that":[2,60,103,175,178,209],"the":[3,20,50,77,88,92,104,107,115,138,207,225],"problem":[4,108,117],"of":[5,14,22,24,87,91,106,118,124,141,144,150,153,161,183,218,238,248],"whether":[6,239],"a":[7,12,120,145,154,158,170,219,240,246,249],"query":[8,13,89,155,159,181],"is":[9,17,72,157,165,188,194,201,243],"equivalent":[10,244],"to":[11,110,203,213,234,245],"tree-width":[15,142,151,162,184,251],"$k$":[16,143,152,163],"decidable,":[18],"for":[19,49,65,76,132,179,229,236],"class":[21],"Unions":[23],"Conjunctive":[25],"Regular":[26],"Path":[27],"Queries":[28],"with":[29,216],"two-way":[30],"navigation":[31],"(UC2RPQs).":[32],"A":[33],"previous":[34],"result":[35,58,228],"by":[36,122],"Barcel\\'o,":[37],"Romero,":[38],"and":[39,53,172,231],"Vardi":[40],"[SIAM":[41],"Journal":[42],"on":[43],"Computing,":[44],"2016]":[45],"has":[46],"shown":[47,202],"decidability":[48,61],"case":[51,82],"$k=1$,":[52,230],"here":[54],"we":[55,101],"extend":[56],"this":[57],"showing":[59],"in":[62,73,167,169,190,197,206],"fact":[63],"holds":[64],"any":[66,133],"arbitrary":[67],"$k\\geq":[68],"1$.":[69],"The":[70,147],"algorithm":[71,130],"2ExpSpace,":[74],"but":[75,79],"restricted":[78],"practically":[80],"relevant":[81],"where":[83],"all":[84],"regular":[85],"expressions":[86],"are":[90],"form":[93],"$a^*$":[94],"or":[95],"$(a_1":[96],"+":[97,99],"\\dotsb":[98],"a_n)$":[100],"complexity":[105],"drops":[109],"$\\Pi^P_2$.":[111],"also":[113,195,212,223],"investigate":[114],"related":[116],"approximating":[119],"UC2RPQ":[121],"queries":[123,217],"small":[125],"tree-width.":[126],"exhibit":[128],"an":[129],"which,":[131],"fixed":[134],"number":[135],"$k$,":[136,185],"builds":[137],"maximal":[139,148,171],"under-approximation":[140,149],"UC2RPQ.":[146],"$q$":[156,168,191],"$q'$":[160],"which":[164],"contained":[166,189,196],"unique":[173],"way,":[174],"is,":[176],"such":[177],"every":[180],"$q''$":[182,187,193],"if":[186],"then":[192],"$q'$.":[198],"Our":[199],"approach":[200],"be":[204],"robust,":[205],"sense":[208],"it":[210,222,232],"allows":[211,233],"test":[214,235],"equivalence":[215,237],"given":[220,250],"path-width,":[221],"covers":[224],"previously":[226],"known":[227],"(one-way)":[241],"UCRPQ":[242,247],"(or":[252],"path-width).":[253]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}