{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:58:16Z","timestamp":1648641496144},"reference-count":10,"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> Optimistic reconciliation allows, multiple update of shared data without synchronization. The assumption is that the vast majority of the actions will not conflict. In these systems, write availability is raised in the presence of network failures, high latencies or parallel development. However, in order to remain consistent, optimistic systems repair divergences. To produce a new consistent state, they use the logs of each user in a process called log-based reconciliation. The purpose of an efficient reconciliation engine is then to compute a new consistent state which preserves the maximum of previous actions. This work leverages the efficiency of constraint-based reconciliation. It provides a new efficient two step procedure built by connecting theoretical results on backtrack-free search with this hard optimisation problem. <\/jats:p>","DOI":"10.1142\/s0218213005002193","type":"journal-article","created":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T08:56:03Z","timestamp":1117616163000},"page":"445-458","source":"Crossref","is-referenced-by-count":0,"title":["PUSHING LOG-BASED RECONCILIATION"],"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"}]},{"given":"MARC","family":"SHAPIRO","sequence":"additional","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","unstructured":"P.\u00a0Cheeseman, B.\u00a0Kanefsky and W. M.\u00a0Taylor, Proceedings of IJCAI-91, eds. J.\u00a0Mylopoulos and R.\u00a0Reiter (Morgan Kaufmann, 1991)\u00a0pp. 331\u2013337."},{"key":"rf2","series-title":"Technical Report MSR-TR-2004-104","volume-title":"Distributed algorithms for log-based reconciliation","author":"Chong Y. L.","year":"2004"},{"key":"rf3","first-page":"273","volume":"41","author":"Dechter R.","journal-title":"AI"},{"key":"rf5","first-page":"24","volume":"29","author":"Freuder C.","journal-title":"Jrnl. A. C. M."},{"key":"rf6","series-title":"Technical Report 2003-91","volume-title":"Disolver: A Distributed Constraint Solver","author":"Hamadi Y.","year":"2003"},{"key":"rf7","volume-title":"Constraint Satisfaction in Logic Programming","author":"Hentenryck P. V.","year":"1989"},{"key":"rf8","first-page":"85","author":"Karp R. M.","journal-title":"Complexity of Computer Computations"},{"key":"rf9","volume-title":"Twentieth ACM Symposium on Principles of Distributed Computing PODC, Newport, RI USA","author":"Kermarrec A.","year":"2001"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/12.54838"},{"key":"rf13","first-page":"244","author":"Slaney John K.","journal-title":"European Conference on Artificial Intelligence"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213005002193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:31:25Z","timestamp":1565130685000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213005002193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0218213005002193"],"URL":"https:\/\/doi.org\/10.1142\/s0218213005002193","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}