{"id":"https://openalex.org/W1957750398","doi":"https://doi.org/10.1109/lics.2002.1029829","title":"Tree extension algebras: logics, automata, and query languages","display_name":"Tree extension algebras: logics, automata, and query languages","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1957750398","doi":"https://doi.org/10.1109/lics.2002.1029829","mag":"1957750398"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037774973","display_name":"Michael Benedikt","orcid":"https://orcid.org/0000-0003-2964-0880"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Benedikt","raw_affiliation_strings":["Bell Labs., Lisle, IL, USA","[Bell Laboratories, Lisle, IL, USA]"],"affiliations":[{"raw_affiliation_string":"Bell Labs., Lisle, IL, USA","institution_ids":[]},{"raw_affiliation_string":"[Bell Laboratories, Lisle, IL, USA]","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069883356","display_name":"Leonid Libkin","orcid":"https://orcid.org/0000-0002-6698-2735"},"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"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"L. Libkin","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037774973"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":1.8172,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84222317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"203","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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.9984999895095825,"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/unary-operation","display_name":"Unary operation","score":0.7934049963951111},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.7022410035133362},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6472078561782837},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5808188319206238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5491734147071838},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5245464444160461},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5162374973297119},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49202343821525574},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.442755788564682},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43573153018951416},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.43284377455711365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4026152789592743},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.37938693165779114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33037835359573364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28762906789779663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24219214916229248},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.12660008668899536},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.09422963857650757},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08698558807373047}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7934049963951111},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7022410035133362},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6472078561782837},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5808188319206238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5491734147071838},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5245464444160461},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5162374973297119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49202343821525574},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.442755788564682},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43573153018951416},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.43284377455711365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4026152789592743},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.37938693165779114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33037835359573364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28762906789779663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24219214916229248},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.12660008668899536},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.09422963857650757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08698558807373047}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2002.1029829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.6841","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.6841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~libkin/papers/lics02.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.1709","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.1709","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/libkin/papers/lics02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322015","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W118337677","https://openalex.org/W606624897","https://openalex.org/W1026721552","https://openalex.org/W1514546616","https://openalex.org/W1526826791","https://openalex.org/W1532312848","https://openalex.org/W1543119249","https://openalex.org/W1558832481","https://openalex.org/W1593799327","https://openalex.org/W1598153029","https://openalex.org/W1816620374","https://openalex.org/W1818793721","https://openalex.org/W1829522835","https://openalex.org/W1884776593","https://openalex.org/W1907776718","https://openalex.org/W1964605444","https://openalex.org/W1988305994","https://openalex.org/W2004256601","https://openalex.org/W2012714171","https://openalex.org/W2018198423","https://openalex.org/W2031856459","https://openalex.org/W2049709040","https://openalex.org/W2053733035","https://openalex.org/W2065999229","https://openalex.org/W2068589781","https://openalex.org/W2078015341","https://openalex.org/W2099098891","https://openalex.org/W2100229833","https://openalex.org/W2109013947","https://openalex.org/W2116841753","https://openalex.org/W2129286375","https://openalex.org/W2141843850","https://openalex.org/W2163696969","https://openalex.org/W2296095876","https://openalex.org/W2398931885","https://openalex.org/W2604337442","https://openalex.org/W4206031975","https://openalex.org/W4233551746","https://openalex.org/W4236835455","https://openalex.org/W4285719527","https://openalex.org/W6604781497","https://openalex.org/W6632039034","https://openalex.org/W6638422867"],"related_works":["https://openalex.org/W2033265717","https://openalex.org/W151008969","https://openalex.org/W2355273608","https://openalex.org/W2365019162","https://openalex.org/W2393783510","https://openalex.org/W2403884748","https://openalex.org/W2371680642","https://openalex.org/W2571039174","https://openalex.org/W2373075394","https://openalex.org/W2138308600"],"abstract_inverted_index":{"We":[0,49,87,121,137,167,219],"study":[1],"relations":[2],"on":[3,110,179,208],"trees":[4,46,69],"defined":[5,70,146],"by":[6,71,83],"first-order":[7],"constraints":[8,151],"over":[9,79,143],"a":[10,30,37,54,59,85,105,161],"vocabulary":[11],"that":[12,51,62,76,101,148,156,187],"includes":[13],"the":[14,42,64,72,90,123,135,144,180,195,209,228],"tree":[15,60,111,165,216],"extension":[16,94,217],"relation":[17,39],"T<T',":[18],"holding":[19],"if":[20,23,41],"and":[21,36,74,96,99,129,173],"only":[22,93],"every":[24,77],"branch":[25,31],"of":[26,32,44,66,68,108,164,183,212],"T":[27],"extends":[28],"to":[29,104,126,140,154,176],"T',":[33],"unary":[34],"node-tests,":[35],"binary":[38],"checking":[40],"domains":[43],"two":[45],"are":[47],"equal.":[48],"show":[50,100,127],"from":[52,150],"such":[53,84],"formula":[55],"one":[56],"can":[57],"generate":[58],"automaton":[61,78],"accepts":[63],"set":[65,163],"tuples":[67],"formula,":[73],"conversely":[75],"tree-tuples":[80],"is":[81,114,192],"captured":[82],"formula.":[86],"look":[88],"at":[89],"fragment":[91],"with":[92,215],"inequalities":[95],"leaf":[97],"tests,":[98],"it":[102],"corresponds":[103],"new":[106],"class":[107],"automata":[109,124],"tuples,":[112],"which":[113],"strictly":[115],"weaker":[116],"then":[117,138],"general":[118,189],"tree-tuple":[119],"automata.":[120],"use":[122,174],"representations":[125],"separation":[128],"expressibility":[130],"results":[131],"for":[132,160,171,224],"formulae":[133],"in":[134,227],"logic.":[136],"turn":[139],"relational":[141,213],"calculi":[142,214],"logic":[145],"here:":[147],"is,":[149],"we":[152],"extend":[153],"queries":[155,226],"have":[157],"second-order":[158],"parameters":[159],"finite":[162],"tuples.":[166],"give":[168,221],"normal":[169,222],"forms":[170,223],"queries,":[172],"these":[175],"get":[177],"bounds":[178,207],"data":[181],"complexity":[182,204],"query":[184,190,199],"evaluation,":[185],"showing":[186],"while":[188],"evaluation":[191,200],"unbounded":[193],"within":[194],"polynomial":[196],"hierarchy,":[197],"generic":[198],"has":[201],"very":[202],"low":[203],"giving":[205],"strong":[206],"expressive":[210],"power":[211],"constraints.":[218],"also":[220],"safe":[225],"calculus.":[229]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}