{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:23Z","timestamp":1725485543587},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440253"},{"type":"electronic","value":"9783540456759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45675-9_49","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T18:36:10Z","timestamp":1180895770000},"page":"318-328","source":"Crossref","is-referenced-by-count":5,"title":["Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains"],"prefix":"10.1007","author":[{"given":"Xiaolong","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"49_CR1","unstructured":"B. J. Bayardo Jr. and R. C. Schrag, Using CSP Look-back Techniques to Solve Real-world SAT Instances, in Proceedings of the 14th National Conference on Artificial Intelligence, pp. 203\u2013208, 1997."},{"issue":"1-2","key":"49_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","volume":"81","author":"J. M. Crawford","year":"1996","unstructured":"J. M. Crawford and L. D. Auton, Experimental Results on the Crossover Point in Random 3SAT, Artificial Intelligence, Vol. 81, No. 1-2, pp. 31\u201357, 1996.","journal-title":"Artificial Intelligence"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The Complexity of theorem proving procedures, in Proceedings of the 3rd Annual ACM Symposium on the Theory of Computation, pp. 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J. Gu","year":"1992","unstructured":"J. Gu, Efficient local search for very large-scale satisfiability problem, SIGART Bulletin, vol. 3, pp. 8\u201312, 1992.","journal-title":"SIGART Bulletin"},{"key":"49_CR5","unstructured":"E. A. Hirsch and A. Kojevnikov, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, in Proceedings of the 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002), pp. 35\u201342, 2002."},{"key":"49_CR6","unstructured":"H. H. Hoos, On the run-time behavior of stochastic local search algorithms for SAT, in Proceedings of the 16th National Conference on Artificial Intelligence, AAAI\u201999, pp. 661\u2013666, 1999."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"C. M. Li and Anbulagan, Look-ahead Versus Look-back for Satisfiability Problems, in Proceedings of CP\u201997, pp. 341\u2013345, 1997.","DOI":"10.1007\/BFb0017450"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"J. Liu, Autonomous Agents And Multi-Agent Systems: Explorations in Learning, Self-Organization and Adaptive Computation, World Scientific, 2001.","DOI":"10.1142\/4399"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0004-3702(01)00174-6","volume":"136","author":"J. Liu","year":"2002","unstructured":"J. Liu, H. Jing and Y. Y. Tang, Multi-agent oriented constraint satisfaction Artificial Intelligence, vol. 136, pp. 101\u2013144, 2002.","journal-title":"Artificial Intelligence"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"J. P. Marques-Silva and K. A. Sakallah, GRASP-A New Search Algorithm for Satisfiability, in Proceedings of IEEE\/ACM International Conference on Computer-Aided Design, 1996.","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"49_CR11","unstructured":"B. Mazure, L. Sais, and \u00c9. Gr\u00e9goire, Tabu Search for SAT, in Proceedings of AAAI\u201997, pp. 281\u2013285, 1997."},{"key":"49_CR12","unstructured":"D. McAllester, B. Selman, and H. Levesque, Evidence for Invariants in Local Search, in Proceedings of AAAI\u201997, pp. 321\u2013326, 1997."},{"issue":"2","key":"49_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D. Schuurmans","year":"2001","unstructured":"D. Schuurmans and F. Southey, Local search characteristics of incomplete SAT procedures, Artificial Intelligence, vol. 132, no. 2, pp. 121\u2013150, 2001.","journal-title":"Artificial Intelligence"},{"key":"49_CR14","unstructured":"B. Selman, H. A. Kautz, and B. Cohen, Noise Strategies for Improving Local Search, in Proceedings of AAAI\u201994, pp. 337\u2013343, 1994."},{"key":"49_CR15","unstructured":"B. Selman, H. Levesque, and D. Mitchell, A New Method for Solving Hard Satisfiability Problems, in Proceedings of AAAI\u201992, pp. 440\u2013446, 1992."},{"key":"49_CR16","unstructured":"http:\/\/www.intellektik.informatick.tu-darmstadt.de\/SATLIB\/ ."}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2014 IDEAL 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45675-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T13:01:09Z","timestamp":1556456469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45675-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440253","9783540456759"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45675-9_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}