{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:51:13Z","timestamp":1648767073084},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T00:00:00Z","timestamp":1293580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10462-010-9194-6","type":"journal-article","created":{"date-parts":[[2010,12,28]],"date-time":"2010-12-28T08:52:34Z","timestamp":1293526354000},"page":"265-285","source":"Crossref","is-referenced-by-count":1,"title":["Distributed SAT"],"prefix":"10.1007","volume":"35","author":[{"given":"Esmeralda","family":"Ruiz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,29]]},"reference":[{"issue":"20","key":"9194_CR1","first-page":"43","volume":"7","author":"C Ans\u00f3tegui","year":"2003","unstructured":"Ans\u00f3tegui C, Many\u00e0 F (2003) Una introducci\u00f3n a los algoritmos de satisfactibilidad. IberoAm J Artif Intell 7(20): 43\u201356","journal-title":"IberoAm J Artif Intell"},{"key":"9194_CR2","unstructured":"Baker A (1994) The hazards of fancy backtracking. In: Proceedings of the 12th American national conference on artificial intelligence, pp 288\u2013293"},{"key":"9194_CR3","unstructured":"B\u00e9jar B, Many\u00e0 F (2000) Solving the round robin problem using propositional logic. In: Proceedings of the 17th national conference on artificial intelligence, pp 262\u2013266"},{"issue":"3","key":"9194_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putman H (1960) A computing procedure for quantification theory. J ACM 7(3): 201\u2013215","journal-title":"J ACM"},{"issue":"7","key":"9194_CR5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5(7): 394\u2013397","journal-title":"Commun ACM"},{"key":"9194_CR6","unstructured":"Dechter R, Kauffman M (2003) Constraints processing"},{"key":"9194_CR7","doi-asserted-by":"crossref","unstructured":"Hirayama K, Yokoo M (2002) Local search for distributed sat with complex local problems. In: Proceedings of the first international joint conference on autonomous agent and multiagent systems, pp 1199\u20131206","DOI":"10.1145\/545056.545099"},{"key":"9194_CR8","unstructured":"Kaplansky E, Razgon I, Zivan R (2002) Comparing performance of distributed constraint processing algorithms. AAMAS-02 workshop on distributed constraint reasoning, pp 86\u201393"},{"key":"9194_CR9","unstructured":"Kautz H, Selman B (1996) Planning, propositional logic, and stochastic search. In: Proceedings of the 13th national conference on artificial intelligence, pp 1194\u20131201"},{"issue":"7","key":"9194_CR10","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"2002","unstructured":"Lamport L (2002) Time, clock, and the ordering of events in a distributed system. Commun ACM 21(7): 558\u2013565","journal-title":"Commun ACM"},{"key":"9194_CR11","unstructured":"Marques J, Guerra L (1999) Algorithms for satisfiability in combinational circuits based on backtrack search and recursive learning. In: Proceedings of the 12th annual symposium on integrated circuits and systems design"},{"key":"9194_CR12","doi-asserted-by":"crossref","unstructured":"Mironov I, Zhang L (2006) Applications of sat solvers to cryptanalysis of hash functions. In: Theory and applications of satisfiability testing\u2014SAT 2006, pp 102\u2013115","DOI":"10.1007\/11814948_13"},{"key":"9194_CR13","unstructured":"Miroslav V, Randal B (2001) Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors. In: Proceedings of the 38th annual design automation conference, pp 226-231"},{"key":"9194_CR14","unstructured":"Schubert B, Becker B (2005) A distributed sat solver for microcontroller. In: Proceedings of the seventh international workshop on parallel and distributed systems, pp 142\u2013147"},{"key":"9194_CR15","unstructured":"Selman B, Levesque H, Mitchell D (1992) A new method for solving hard satisfiability problems. In: Proceedings of the 10th national conference on artificial intelligence, pp 440\u2013446"},{"key":"9194_CR16","unstructured":"Selman B, Kautz A, Cohen B (1994) Noise strategies for improving local search. In: Proceedings of the 12th national conference on artificial intelligence, pp 337\u2013343"},{"key":"9194_CR17","doi-asserted-by":"crossref","unstructured":"Walsh T (2000) Sat v csp. In: Proceedings of the 6th international conference on principles of constraint programming, pp 441\u2013456","DOI":"10.1007\/3-540-45349-0_32"},{"key":"9194_CR18","unstructured":"Walsh W, Wellman M (2000) Marketsat: an extremely decentralized (but really slow) algorithm for propositional satisfiability. In: Seventeenth national conference on artificial intelligence, pp 303\u2013309"},{"issue":"5","key":"9194_CR19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M Yokoo","year":"1998","unstructured":"Yokoo M, Durfee H, Ishida T, Kuwabara K (1998) The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans Knowl Data Eng 10(5): 673\u2013685","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9194_CR20","unstructured":"Zivan R, Meisels A (2003) Synchronous vs asynchronous search on discsps. In: Proceedings of the first European workshop on multi-agent systems"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9194-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-010-9194-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9194-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T09:53:49Z","timestamp":1559901229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-010-9194-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,29]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9194"],"URL":"https:\/\/doi.org\/10.1007\/s10462-010-9194-6","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,29]]}}}