{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:16:05Z","timestamp":1765545365689},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1-2","license":[{"start":{"date-parts":[[2006,1,27]],"date-time":"2006-01-27T00:00:00Z","timestamp":1138320000000},"content-version":"unspecified","delay-in-days":26,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2006,1]]},"abstract":"<jats:p>Constraint Handling Rules (CHR) is a committed-choice rule-based language that was originally intended for writing constraint solvers. In this paper we show that it is also possible to write the classic union-find algorithm and variants in CHR. The programs neither compromise in declarativeness nor efficiency. We study the time complexity of our programs: they match the almost-linear complexity of the best known imperative implementations. This fact is illustrated with experimental results.<\/jats:p>","DOI":"10.1017\/s1471068405002541","type":"journal-article","created":{"date-parts":[[2006,1,27]],"date-time":"2006-01-27T05:04:37Z","timestamp":1138338277000},"page":"213-224","source":"Crossref","is-referenced-by-count":19,"title":["Optimal union-find in Constraint Handling Rules"],"prefix":"10.1017","volume":"6","author":[{"given":"TOM","family":"SCHRIJVERS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"THOM","family":"FR\u00dcHWIRTH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2006,1,27]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068405002541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:49:24Z","timestamp":1553957364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068405002541\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["S1471068405002541"],"URL":"https:\/\/doi.org\/10.1017\/s1471068405002541","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}