{"id":"https://openalex.org/W4411467297","doi":"https://doi.org/10.46298/lmcs-21(2:16)2025","title":"Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures","display_name":"Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures","publication_year":2025,"publication_date":"2025-05-30","ids":{"openalex":"https://openalex.org/W4411467297","doi":"https://doi.org/10.46298/lmcs-21(2:16)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:16)2025","pdf_url":"https://lmcs.episciences.org/15908/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/15908/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060413318","display_name":"St\u00e9phane Demri","orcid":"https://orcid.org/0000-0002-3493-2610"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephane Demri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066136949","display_name":"Karin Quaas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karin Quaas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14830026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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.9980999827384949,"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.9954000115394592,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9925000071525574,"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.8398523926734924},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.8299946784973145},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.7768067121505737},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7153756618499756},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.600705623626709},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5773199200630188},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5313730239868164},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5224220752716064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5108163356781006},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5092722177505493},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4937838017940521},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.48244625329971313},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4797212481498718},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4232880771160126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4169508218765259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41335737705230713},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3352702856063843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2974253296852112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2633499205112457},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.11050504446029663},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.10882532596588135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09091341495513916},{"id":"https://openalex.org/keywords/cd8","display_name":"CD8","score":0.07192307710647583}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8398523926734924},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.8299946784973145},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.7768067121505737},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7153756618499756},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.600705623626709},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5773199200630188},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5313730239868164},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5224220752716064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5108163356781006},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5092722177505493},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4937838017940521},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.48244625329971313},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4797212481498718},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4232880771160126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4169508218765259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41335737705230713},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3352702856063843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2974253296852112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2633499205112457},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.11050504446029663},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.10882532596588135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09091341495513916},{"id":"https://openalex.org/C167672396","wikidata":"https://www.wikidata.org/wiki/Q417800","display_name":"CD8","level":3,"score":0.07192307710647583},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C147483822","wikidata":"https://www.wikidata.org/wiki/Q103537","display_name":"Antigen","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(2:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:16)2025","pdf_url":"https://lmcs.episciences.org/15908/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-05122746v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05122746","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":"Logical Methods in Computer Science, 2025, 21 (2), pp.16:1-16:79. ⟨10.46298/lmcs-21(2:16)2025⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:7516c80c33784f64ac5f20e8ebac6863","is_oa":true,"landing_page_url":"https://doaj.org/article/7516c80c33784f64ac5f20e8ebac6863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 2 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:16)2025","pdf_url":"https://lmcs.episciences.org/15908/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":[{"score":0.8299999833106995,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G7693682080","display_name":"Temporale Logiken \u00fcber endlichen W\u00f6rtern und der Pr\u00e4fixordnung","funder_award_id":"504343613","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411467297.pdf","grobid_xml":"https://content.openalex.org/works/W4411467297.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2806052477","https://openalex.org/W2017695771","https://openalex.org/W4243835908","https://openalex.org/W1551901662","https://openalex.org/W2963693828","https://openalex.org/W2033934646","https://openalex.org/W2087431796","https://openalex.org/W4320560294","https://openalex.org/W2102886905","https://openalex.org/W1986350521"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,15,28,40,53],"class":[3],"of":[4],"tree":[5],"constraint":[6],"automata":[7],"with":[8,14,46,73,84],"data":[9],"values":[10],"in":[11,48],"Z":[12],"(equipped":[13],"less":[16],"than":[17],"relation":[18],"and":[19,24,52,77],"equality":[20],"predicates":[21],"to":[22],"constants)":[23],"we":[25,37],"show":[26],"that":[27,39],"nonemptiness":[29],"problem":[30,42,55,64],"is":[31,50,58],"ExpTime-complete.":[32],"Using":[33],"an":[34],"automata-based":[35],"approach,":[36],"establish":[38],"satisfiability":[41,54],"for":[43,56],"CTL(Z)":[44],"(CTL":[45],"constraints":[47],"Z)":[49],"ExpTime-complete":[51],"CTL*(Z)":[57],"2ExpTime-complete":[59],"solving":[60],"a":[61],"longstanding":[62],"open":[63],"(only":[65],"decidability":[66],"was":[67],"known":[68],"so":[69],"far).":[70],"By-product":[71],"results":[72],"other":[74,78],"concrete":[75,85],"domains":[76],"logics,":[79],"such":[80],"as":[81],"description":[82],"logics":[83],"domains,":[86],"are":[87],"also":[88],"briefly":[89],"presented.":[90]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}