{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:18:22Z","timestamp":1760080702700,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["681988"],"award-info":[{"award-number":["681988"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The constraint satisfaction problem (CSP) of a first-order theory T is the\ncomputational problem of deciding whether a given conjunction of atomic\nformulas is satisfiable in some model of T. We study the computational\ncomplexity of CSP$(T_1 \\cup T_2)$ where $T_1$ and $T_2$ are theories with\ndisjoint finite relational signatures. We prove that if $T_1$ and $T_2$ are the\ntheories of temporal structures, i.e., structures where all relations have a\nfirst-order definition in $(Q;&lt;)$, then CSP$(T_1 \\cup T_2)$ is in P or\nNP-complete. To this end we prove a purely algebraic statement about the\nstructure of the lattice of locally closed clones over the domain $Q$ that\ncontain Aut$(Q;&lt;)$.<\/jats:p>","DOI":"10.46298\/lmcs-18(2:11)2022","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T13:06:14Z","timestamp":1654002374000},"source":"Crossref","is-referenced-by-count":1,"title":["Tractable Combinations of Temporal CSPs"],"prefix":"10.46298","volume":"Volume 18, Issue 2","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Greiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Rydval","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,5,25]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9609\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9609\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:19:11Z","timestamp":1687292351000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(2:11)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2012.05682v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2012.05682v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2012.05682","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2012.05682","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,5,25]]},"article-number":"7013"}}