{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:41:01Z","timestamp":1761662461316},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,12]],"date-time":"2007-01-12T00:00:00Z","timestamp":1168560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,3,20]]},"DOI":"10.1007\/s10601-006-9013-5","type":"journal-article","created":{"date-parts":[[2007,1,11]],"date-time":"2007-01-11T17:04:45Z","timestamp":1168535085000},"page":"131-150","source":"Crossref","is-referenced-by-count":29,"title":["Asynchronous Forward-checking for DisCSPs"],"prefix":"10.1007","volume":"12","author":[{"given":"Amnon","family":"Meisels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roie","family":"Zivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,12]]},"reference":[{"key":"9013_CR1","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Maestre, A., & Messeguer, P. (2001). Distributed dynamic backtracking. In Proc. Workshop on Distributed Constraint of IJCAI01.","DOI":"10.1007\/3-540-45578-7_73"},{"issue":"1\u20132","key":"9013_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.artint.2004.10.002","volume":"161","author":"C. Bessiere","year":"2005","unstructured":"Bessiere, C., Maestre, A., Brito, I., & Meseguer, P. (January 2005). Asynchronous backtracking without adding links: A new member in the abt family. Artificial Intelligence, 161(1\u20132), 7\u201324.","journal-title":"Artificial Intelligence"},{"key":"9013_CR3","doi-asserted-by":"crossref","unstructured":"Brito, I., & Meseguer, P. (September 2003). Distributed forward checking. In Proc. CP-2003, (pp. 801\u2013806). Ireland.","DOI":"10.1007\/978-3-540-45193-8_56"},{"key":"9013_CR4","doi-asserted-by":"crossref","unstructured":"Brito, I., & Meseguer, P. (September 2004). Synchronous, asnchronous and hybrid algorithms for discsp. In Workshop on Distributed Constraints Reasoning (DCR-04) CP-2004, Toronto.","DOI":"10.1007\/978-3-540-30201-8_70"},{"key":"9013_CR5","unstructured":"Dechter, R. (2003). Constraints Processing. Morgan Kaufmann."},{"key":"9013_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. L. Ginsberg","year":"1993","unstructured":"Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9013_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","volume":"21","author":"G. Kondrak","year":"1997","unstructured":"Kondrak, G., & van Beek, P. (1997). A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 21, 365\u2013387.","journal-title":"Artificial Intelligence"},{"key":"9013_CR8","first-page":"95","volume":"2","author":"L. Lamport","year":"1978","unstructured":"Lamport, L. (April 1978). Time, clocks, and the ordering of events in distributed system. Communication of the ACM, 2, 95\u2013114.","journal-title":"Communication of the ACM"},{"key":"9013_CR9","unstructured":"Lynch, N. A. (1997). Distributed Algorithms. Morgan Kaufmann."},{"key":"9013_CR10","volume-title":"Proc. CoSolv workshop, CP02","author":"A. Meisels","year":"2002","unstructured":"Meisels, A., & Razgon, I. (2002). Distributed forward-checking with conflict-based backjumping and dynamic ordering. In Proc. CoSolv workshop, CP02. Ithaca: NY."},{"key":"9013_CR11","unstructured":"Meisels, A., Razgon, I., Kaplansky, E., & Zivan, R. (July 2002). Comparing performance of distributed constraints processing algorithms. In Proc. AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR, (pp. 86\u201393). Bologna."},{"key":"9013_CR12","unstructured":"Meseguer, P., & Jimenez, M. A. (September 2000). Distributed forward checking. In Proc. CP-2000 Workshop on Distributed Constraint Satisfaction, Singapore."},{"key":"9013_CR13","unstructured":"Nguyen, T., Sam-Hroud, D., & Faltings, B. (September 2004). Dynamic distributed backjumping. In Proc. 5th workshop on distributed constraints reasoning DCR-04, Toronto."},{"key":"9013_CR14","unstructured":"Nissim, K., & Zivan, R. (2005). Secure discsp protocols\u2014from centralized towards distributed solutions. In Proc. 6th workshop on Distributed Constraints Reasoning, DCR-05, Edinburgh."},{"key":"9013_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","volume":"81","author":"P. Prosser","year":"1996","unstructured":"Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81, 81\u2013109.","journal-title":"Artificial Intelligence"},{"key":"9013_CR16","unstructured":"Silaghi, M. C. (2002). Asynchronously Solving Problems with Privacy Requirements. PhD Thesis, Swiss Federal Institute of Technology (EPFL)."},{"issue":"1\u20132","key":"9013_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.artint.2004.10.003","volume":"191","author":"M. C. Silaghi","year":"2005","unstructured":"Silaghi, M. C., & Faltings, B. (January 2005). Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence, 191(1\u20132), 25\u201354.","journal-title":"Artificial Intelligence"},{"key":"9013_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B. M. Smith","year":"1996","unstructured":"Smith, B. M. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 155\u2013181.","journal-title":"Artificial Intelligence"},{"key":"9013_CR19","doi-asserted-by":"crossref","unstructured":"Solotorevsky, G., Gudes, E., & Meisels, A. (1996). Modeling and solving distributed constraint satisfaction problems (dcsps). In Constraint Processing-96, (pp. 561\u2013562). New Hamphshire.","DOI":"10.1007\/3-540-61551-2_116"},{"key":"9013_CR20","first-page":"198","volume":"3","author":"M. Yokoo","year":"2000","unstructured":"Yokoo, M. (2000). Algorithms for distributed constraint satisfaction problems: a review. Autonomous Agents and Multi-Agent Sys., 3, 198\u2013212.","journal-title":"Autonomous Agents and Multi-Agent Sys."},{"key":"9013_CR21","volume-title":"Distributed Constraint Satisfaction Problems","author":"M. Yokoo","year":"2000","unstructured":"Yokoo, M. (2000). Distributed Constraint Satisfaction Problems. Springer Berlin Heidelberg New York."},{"issue":"1\u20132","key":"9013_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.artint.2004.10.007","volume":"161","author":"M. Yokoo","year":"2005","unstructured":"Yokoo, M., Suzuki, K., & Hirayama, K. (January 2005). Secure distributed constraints satisfaction: Reaching agreement without revealing private information. Artificial Intelligence, 161(1\u20132), 229\u2013246.","journal-title":"Artificial Intelligence"},{"key":"9013_CR23","unstructured":"Zivan, R., & Meisels, A. (December 2003) Synchronous vs asynchronous search on discsps. In Proc. 1st European Workshop on Multi Agent System, EUMAS, Oxford."},{"key":"9013_CR24","doi-asserted-by":"crossref","unstructured":"Zivan, R., & Meisels, A. (2004). Concurrent dynamic backtracking for distributed csps. In CP-2004, (pp. 782\u2013787). Toronto.","DOI":"10.1007\/978-3-540-30201-8_66"},{"key":"9013_CR25","unstructured":"Zivan, R., & Meisels, A. (2005). Asynchronous backtracking for asymmetric discsps. In Proc. 6th workshop on Distributed Constraints Reasoning, DCR-05, Edinburgh."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9013-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-006-9013-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9013-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:13Z","timestamp":1559243653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-006-9013-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["9013"],"URL":"https:\/\/doi.org\/10.1007\/s10601-006-9013-5","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,12]]}}}