{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T02:53:35Z","timestamp":1775184815281,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T00:00:00Z","timestamp":1526947200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T00:00:00Z","timestamp":1526947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T00:00:00Z","timestamp":1526947200000},"content-version":"tdm","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":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite domains. Our first result is a general polynomial-time reduction from such infinite-domain CSPs to finite-domain CSPs. We use this reduction to obtain new powerful polynomial-time tractability conditions that can be expressed in terms of the topological polymorphism clone of $\\mathbb{A}$. Moreover, we study the subclass $\\mathcal{C}$ of CSPs for structures $\\mathbb{A}$ that are reducts of a structure with a unary language. Also this class $\\mathcal{C}$ properly extends the class of all finite-domain CSPs. We apply our new tractability conditions to prove the general tractability conjecture of Bodirsky and Pinsker for reducts of finitely bounded homogeneous structures for the class $\\mathcal{C}$.<\/jats:p>","DOI":"10.23638\/lmcs-14(2:13)2018","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:17Z","timestamp":1743701537000},"source":"Crossref","is-referenced-by-count":3,"title":["A Dichotomy for First-Order Reducts of Unary Structures"],"prefix":"10.23638","volume":"Volume 14, Issue 2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8228-3611","authenticated-orcid":false,"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Mottet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2018,5,22]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1601.04520v6","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1601.04520v6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:18Z","timestamp":1743701538000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,22]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-14(2:13)2018","relation":{"has-preprint":[{"id-type":"arxiv","id":"1601.04520v5","asserted-by":"subject"},{"id-type":"arxiv","id":"1601.04520v4","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1601.04520","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1601.04520","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,22]]},"article-number":"3264"}}