{"id":"https://openalex.org/W1992955510","doi":"https://doi.org/10.1145/2559945","title":"Extending two-variable logic on data trees with order on data values and its automata","display_name":"Extending two-variable logic on data trees with order on data values and its automata","publication_year":2014,"publication_date":"2014-02-01","ids":{"openalex":"https://openalex.org/W1992955510","doi":"https://doi.org/10.1145/2559945","mag":"1992955510"},"language":"en","primary_location":{"id":"doi:10.1145/2559945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2559945","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1942/16522","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060686021","display_name":"Tony Tan","orcid":"https://orcid.org/0009-0005-8341-2004"},"institutions":[{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Tony Tan","raw_affiliation_strings":["Hasselt University and Transnational University of Limburg"],"affiliations":[{"raw_affiliation_string":"Hasselt University and Transnational University of Limburg","institution_ids":["https://openalex.org/I878454856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060686021"],"corresponding_institution_ids":["https://openalex.org/I878454856"],"apc_list":null,"apc_paid":null,"fwci":2.8486,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90446543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9977999925613403,"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.9977999925613403,"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/T11567","display_name":"semigroups and automata theory","score":0.9955999851226807,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9955000281333923,"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/decidability","display_name":"Decidability","score":0.758995532989502},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5249961614608765},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.514488935470581},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.51315838098526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5089156627655029},{"id":"https://openalex.org/keywords/logical-data-model","display_name":"Logical data model","score":0.49974703788757324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.471014142036438},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43069911003112793},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.42818135023117065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42435958981513977},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.4145861268043518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38597142696380615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24790367484092712},{"id":"https://openalex.org/keywords/data-modeling","display_name":"Data modeling","score":0.2227003276348114}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.758995532989502},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5249961614608765},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.514488935470581},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.51315838098526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5089156627655029},{"id":"https://openalex.org/C203702819","wikidata":"https://www.wikidata.org/wiki/Q17146953","display_name":"Logical data model","level":3,"score":0.49974703788757324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.471014142036438},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43069911003112793},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.42818135023117065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42435958981513977},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.4145861268043518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38597142696380615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24790367484092712},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.2227003276348114},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2559945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2559945","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/16522","is_oa":true,"landing_page_url":"http://hdl.handle.net/1942/16522","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:documentserver.uhasselt.be:1942/16522","is_oa":true,"landing_page_url":"http://hdl.handle.net/1942/16522","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"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":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W1489366126","https://openalex.org/W1494939852","https://openalex.org/W1499852347","https://openalex.org/W1516630410","https://openalex.org/W1564256547","https://openalex.org/W1579407214","https://openalex.org/W1580943896","https://openalex.org/W1584587517","https://openalex.org/W1593799327","https://openalex.org/W1598784998","https://openalex.org/W1816620374","https://openalex.org/W1878133323","https://openalex.org/W1886070468","https://openalex.org/W1962883301","https://openalex.org/W1971729277","https://openalex.org/W1980102547","https://openalex.org/W1988662949","https://openalex.org/W2021449336","https://openalex.org/W2036564813","https://openalex.org/W2038925304","https://openalex.org/W2047551518","https://openalex.org/W2053455078","https://openalex.org/W2056665285","https://openalex.org/W2056864188","https://openalex.org/W2062179480","https://openalex.org/W2073614038","https://openalex.org/W2081396910","https://openalex.org/W2108987498","https://openalex.org/W2111789076","https://openalex.org/W2145576118","https://openalex.org/W2157148396","https://openalex.org/W2162199371","https://openalex.org/W2163133050","https://openalex.org/W2167738204","https://openalex.org/W2168901678","https://openalex.org/W2177814128","https://openalex.org/W2292983454","https://openalex.org/W2592285994","https://openalex.org/W2673028924","https://openalex.org/W2977679477","https://openalex.org/W3102125706","https://openalex.org/W3104994285","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3185974462","https://openalex.org/W1585688349","https://openalex.org/W1851346840","https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2182252111","https://openalex.org/W2742582826","https://openalex.org/W1582302366"],"abstract_inverted_index":{"Data":[0],"trees":[1,3,64],"are":[2],"in":[4,65,77,89,97,126,197],"which":[5,66,107,168],"each":[6],"node,":[7],"besides":[8],"carrying":[9],"a":[10,13,18,72,90,152,162,189,228],"label":[11],"from":[12,21,71,227],"finite":[14],"alphabet,":[15],"also":[16,133,208],"carries":[17],"data":[19,56,63,68,87,141,224],"value":[20,88],"an":[22,30,102],"infinite":[23],"domain.":[24],"They":[25],"have":[26],"been":[27],"used":[28],"as":[29,234],"abstraction":[31],"model":[32,104],"for":[33,105],"reasoning":[34],"tasks":[35],"on":[36,54,139],"XML":[37],"and":[38,76,118,174,194],"verification.":[39],"However,":[40,188],"most":[41],"existing":[42,192],"approaches":[43],"consider":[44],"the":[45,55,67,86,95,136,182,198,211,220,223],"case":[46,221],"where":[47,222],"only":[48],"equality":[49,80],"test":[50,84],"can":[51,83,200,215],"be":[52,201,216],"performed":[53],"values.":[57],"In":[58],"this":[59,156],"article":[60],"we":[61,82,108,160,169],"study":[62],"values":[69,225],"come":[70,226],"linearly":[73],"ordered":[74,231],"domain,":[75,232],"addition":[78],"to":[79,151,186,219],"test,":[81],"whether":[85],"node":[91],"is":[92,124],"greater":[93],"than":[94],"one":[96],"another":[98],"node.":[99],"We":[100,132,207],"introduce":[101],"automata":[103,112,157],"them":[106],"call":[109,170],"ordered-data":[110],"tree":[111],"(ODTA),":[113],"provide":[114,175],"its":[115,121,176],"logical":[116,177],"characterisation,":[117],"prove":[119],"that":[120,135,210],"non-emptiness":[122,183],"problem":[123,184],"decidable":[125],"3-NE":[127],"xp":[128],"T":[129],"ime":[130],".":[131],"show":[134,209],"two-variable":[137],"logic":[138],"unranked":[140],"trees,":[142],"studied":[143,196],"by":[144,204],"Bojanczyk":[145],"et":[146],"al.":[147],"[2009],":[148],"corresponds":[149],"precisely":[150],"special":[153],"subclass":[154],"of":[155,166,181,191,213],"model.":[158],"Then":[159],"define":[161],"slightly":[163],"weaker":[164],"version":[165],"ODTA,":[167],"weak":[171,205],"ODTA":[172,214],",":[173],"characterisation.":[178],"The":[179],"complexity":[180],"drops":[185],"NP.":[187],"number":[190],"formalisms":[193],"models":[195],"literature":[199],"captured":[202],"already":[203],"ODTA.":[206],"definition":[212],"easily":[217],"modified,":[218],"tree-like":[229],"partially":[230],"such":[233],"strings.":[235]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}