{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:55Z","timestamp":1753889875376,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["714532"],"award-info":[{"award-number":["714532"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"crossref","award":["EP\/L021226\/1"],"award-info":[{"award-number":["EP\/L021226\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) provides a means of defining CSP fragments which are neither exclusively language-based nor exclusively structure-based. It is known that the class of binary CSP instances in which the broken-triangle pattern (BTP) does not occur, a class which includes all tree-structured instances, are decided by arc consistency (AC), a ubiquitous reduction operation in constraint solvers. We provide a characterisation of simple partially-ordered forbidden patterns which have this AC-solvability property. It turns out that BTP is just one of five such AC-solvable patterns. The four other patterns allow us to exhibit new tractable classes.<\/jats:p>","DOI":"10.23638\/lmcs-13(4:26)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:54Z","timestamp":1743701694000},"source":"Crossref","is-referenced-by-count":0,"title":["The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4853-053X","authenticated-orcid":false,"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"\u017divn\u00fd","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,12,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1604.07981v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1604.07981v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:54Z","timestamp":1743701694000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:26)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1604.07981v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1604.07981","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1604.07981","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,12,27]]},"article-number":"4049"}}