{"paper":{"title":"Satisfiability of ECTL* with tree constraints","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Alexander Kartzow, Claudia Carapelle, Markus Lohrey, Shiguang Feng","submitted_at":"2014-12-09T10:44:03Z","abstract_excerpt":"Recently, we have shown that satisfiability for $\\mathsf{ECTL}^*$ with constraints over $\\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\\mathsf{ECTL}^*$ with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called EHD (for \"existence of homomorphisms is decidable\"). Here we apply this approach to concrete domains that are tree-like and obtain several results. We show that satisfiability of $\\mathsf{ECTL}^*$ with constraints is decidable over (i) semi-linear or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2905","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}