{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:55:18Z","timestamp":1672253718076},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> We extend here the work on interleaved distributed graph based backjumping, IDIBT\/GBJ<jats:sup>7,6,5<\/jats:sup> by considering conflicting agents.<jats:sup>13<\/jats:sup> The resulting method IDIBT\/CBJ-DkC for Conflict-directed Back-Jumbing and Directed k-Consistency combines distributed and parallel explorations of search spaces with more efficient backtrack steps. We take advantage of the asynchronous framework to implement a more refined and efficient update of conflicts. A fine analysis of these conflicts allows to some extent the detection of k-inconsistent values. Our experiments show a large improvement over graph based distributed\/interleaved search. <\/jats:p>","DOI":"10.1142\/s021821300500220x","type":"journal-article","created":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T08:56:03Z","timestamp":1117616163000},"page":"459-475","source":"Crossref","is-referenced-by-count":1,"title":["CONFLICTING AGENTS IN DISTRIBUTED SEARCH"],"prefix":"10.1142","volume":"14","author":[{"given":"YOUSSEF","family":"HAMADI","sequence":"first","affiliation":[{"name":"Microsoft Research Ltd., 7 J J Thomson Avenue,  Cambridge CB3 0FB, United Kingdom"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"rf3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"Ginsberg M. L.","journal-title":"JAIR"},{"key":"rf6","unstructured":"Y.\u00a0Hamadi, 13th International Conference on Tools with Artificial Intelligence (IEEE, 2001)\u00a0pp. 33\u201341."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213002000836"},{"key":"rf8","unstructured":"T.\u00a0Hogg and B. A.\u00a0Huberman, 1992 Lectures in Complex Systems, SFI Studies in the Sciences of Complexity\u00a0V, eds. Lynn\u00a0Nadel and Daniel\u00a0Stein (Addison-Wesley, Reading, MA, 1993)\u00a0pp. 165\u2013184."},{"key":"rf13","first-page":"262","author":"Prosser P.","journal-title":"IJCAI"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/71.219757"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021821300500220X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:31:29Z","timestamp":1565130689000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021821300500220X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S021821300500220X"],"URL":"https:\/\/doi.org\/10.1142\/s021821300500220x","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}