{"id":"https://openalex.org/W2044007894","doi":"https://doi.org/10.1145/1706591.1706598","title":"Transitive closure logic, nested tree walking automata, and XPath","display_name":"Transitive closure logic, nested tree walking automata, and XPath","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2044007894","doi":"https://doi.org/10.1145/1706591.1706598","mag":"2044007894"},"language":"en","primary_location":{"id":"doi:10.1145/1706591.1706598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706591.1706598","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03664857","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080220262","display_name":"Balder ten Cate","orcid":"https://orcid.org/0000-0002-2538-5846"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Balder Ten Cate","raw_affiliation_strings":["INRIA, ENS-Cachan, Santa Cruz, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, ENS-Cachan, Santa Cruz, CA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042411667","display_name":"Luc Segoufin","orcid":"https://orcid.org/0000-0002-9564-7581"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Luc Segoufin","raw_affiliation_strings":["INRIA, ENS-Cachan, Cedex, France","INRIA, ENS-Cachan, Cedex, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, ENS-Cachan, Cedex, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, ENS-Cachan, Cedex, France#TAB#","institution_ids":["https://openalex.org/I11559806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9247,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91118756,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"57","issue":"3","first_page":"1","last_page":"41"},"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.9990000128746033,"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.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976999759674072,"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/T11567","display_name":"semigroups and automata theory","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.9098203182220459},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.8819098472595215},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.6350182294845581},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6319878697395325},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6173170804977417},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.6006304025650024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543089747428894},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5385051965713501},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.5260802507400513},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4920363128185272},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.48523831367492676},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.43688011169433594},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43579718470573425},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.415897935628891},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.400647908449173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.396235853433609},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.34639468789100647},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.22676995396614075},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.2132568359375},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.15431076288223267}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.9098203182220459},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8819098472595215},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.6350182294845581},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6319878697395325},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6173170804977417},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.6006304025650024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543089747428894},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5385051965713501},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.5260802507400513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4920363128185272},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.48523831367492676},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.43688011169433594},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43579718470573425},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.415897935628891},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.400647908449173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.396235853433609},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.34639468789100647},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.22676995396614075},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.2132568359375},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.15431076288223267},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1706591.1706598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706591.1706598","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03664857v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03664857","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2010, 57 (3), pp.1-41. ⟨10.1145/1706591.1706598⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03664857v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03664857","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2010, 57 (3), pp.1-41. ⟨10.1145/1706591.1706598⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4000000059604645}],"awards":[{"id":"https://openalex.org/G5435465050","display_name":null,"funder_award_id":"639.021.508","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6069437307","display_name":null,"funder_award_id":"IIS-0430994","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1504333451","https://openalex.org/W1522193308","https://openalex.org/W1525848106","https://openalex.org/W1540516609","https://openalex.org/W1547865268","https://openalex.org/W1573061520","https://openalex.org/W1771000901","https://openalex.org/W1851620109","https://openalex.org/W1971898721","https://openalex.org/W1978177681","https://openalex.org/W1992552784","https://openalex.org/W2012959900","https://openalex.org/W2015791837","https://openalex.org/W2042527825","https://openalex.org/W2076284895","https://openalex.org/W2103146530","https://openalex.org/W2116099233","https://openalex.org/W2117789898","https://openalex.org/W2118416409","https://openalex.org/W2126965729","https://openalex.org/W2128710701","https://openalex.org/W2151129888","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2160918318","https://openalex.org/W2294034341","https://openalex.org/W2561675875","https://openalex.org/W2621212289","https://openalex.org/W2911599249","https://openalex.org/W6630445824"],"related_works":["https://openalex.org/W2136195897","https://openalex.org/W1528001973","https://openalex.org/W2108769896","https://openalex.org/W2583438689","https://openalex.org/W167266966","https://openalex.org/W2138308600","https://openalex.org/W2044007894","https://openalex.org/W2583244020","https://openalex.org/W1538300534","https://openalex.org/W2966029514"],"abstract_inverted_index":{"We":[0,19,49,108,128,143],"study":[1],"FO(MTC),":[2,62],"first-order":[3],"logic":[4,54],"with":[5,76],"monadic":[6],"transitive":[7,85],"closure,":[8],"a":[9,52,91,101,106],"logical":[10],"formalism":[11],"in":[12,26,63,150],"between":[13],"FO":[14],"and":[15,90,125],"MSO":[16],"on":[17,55],"trees.":[18],"characterize":[20],"the":[21,33,64,70,79,84,111,131,134,140],"expressive":[22,42,112],"power":[23,113],"of":[24,28,66,69,87,114,120,133],"FO(MTC)":[25,38,121],"terms":[27],"nested":[29],"tree-walking":[30],"automata.":[31],"Using":[32],"latter,":[34],"we":[35],"show":[36,109,144],"that":[37,57,110,119,145,156],"is":[39,58,160],"strictly":[40],"less":[41],"than":[43],"MSO,":[44],"solving":[45],"an":[46,67],"open":[47],"problem.":[48],"also":[50,129],"present":[51],"temporal":[53],"trees":[56],"expressively":[59],"complete":[60],"for":[61,82,122],"form":[65],"extension":[68],"XML":[71],"document":[72],"navigation":[73],"language":[74],"XPath":[75,116,141],"two":[77],"operators:":[78],"Kleene":[80],"star":[81],"taking":[83],"closure":[86],"path":[88],"expressions,":[89],"subtree":[92,103],"relativisation":[93],"operator,":[94],"allowing":[95],"one":[96],"to":[97,100],"restrict":[98],"attention":[99],"specific":[102],"while":[104],"evaluating":[105],"subexpression.":[107],"this":[115],"dialect":[117],"equals":[118],"Boolean,":[123],"unary":[124],"binary":[126],"queries.":[127],"investigate":[130],"complexity":[132],"automata":[135],"model":[136],"as":[137,139],"well":[138],"dialect.":[142],"query":[146],"evaluation":[147],"be":[148],"done":[149],"polynomial":[151],"time":[152],"(combined":[153],"complexity),":[154],"but":[155],"emptiness":[157],"(or,":[158],"satisfiability)":[159],"2ExpTime-complete.":[161]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}