{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:24Z","timestamp":1725486084036},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_26","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T20:54:55Z","timestamp":1181163295000},"page":"353-368","source":"Crossref","is-referenced-by-count":26,"title":["Singleton Consistencies"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Prosser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"unstructured":"C. Bessi\u00e8re and J. C. R\u00e9gin. Arc consistency for general constraint networks: Preliminary results. In Proceedings IJCAI-97, pages 398\u2013404, 1997.","key":"26_CR1"},{"unstructured":"R. Debruyne and C. Bessi\u00e8re. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of the 15th IJCAI, pages 412\u2013417. International Joint Conference on Artificial Intelligence, 1997.","key":"26_CR2"},{"unstructured":"R. Dechter. On the expressiveness of networks with hidden variables. In Proceedings of the 8th National Conference on AI, pages 555\u2013562. American Association for Artificial Intelligence, 1990.","key":"26_CR3"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394\u2013397, 1962.","journal-title":"Communications of the ACM"},{"unstructured":"E. Freuder and C. D. Elfe. Neighborhood inverse consistency preprocessing. In Proceedings of the 12th National Conference on AI, pages 202\u2013208. American Association for Artificial Intelligence, 1996.","key":"26_CR5"},{"issue":"4","key":"26_CR6","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. Freuder","year":"1985","unstructured":"E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery, 32(4):755\u2013761, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"unstructured":"J. Gaschnig. Performance measurement and analysis of certain search algorithms. Technical report CMU-CS-79-124, Carnegie-Mellon University, 1979. PhD thesis.","key":"26_CR7"},{"unstructured":"C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th IJCAI, pages 366\u2013371. International Joint Conference on Artificial Intelligence, 1997.","key":"26_CR8"},{"unstructured":"R. Mohr and G. Masini. Good old discrete relaxation. In Proceedings of the European Conference on Artificial Intelligence (ECAI-88), pages 651\u2013656, 1988.","key":"26_CR9"},{"unstructured":"J-C. R\u00e9gin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on AI, pages 362\u2013367. American Association for Artificial Intelligence, 1994.","key":"26_CR10"},{"unstructured":"T. Schiex, J. C. R\u00e9gin, C. Gaspin, and G. Verfaillie. Lazy arc consistency. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-96), pages 216\u2013221, Portland, Oregon, 1996.","key":"26_CR11"},{"unstructured":"B. Smith, K. Stergiou, and T. Walsh. Using auxiliary variables and implied constraints to model non-binary problems. In To appear in Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), Austin, Texas, 2000.","key":"26_CR12"},{"unstructured":"K. Stergiou and T. Walsh. The difference all-difference makes. In Proceedings of 16th IJCAI. International Joint Conference on Artificial Intelligence, 1999.","key":"26_CR13"},{"unstructured":"T. Walsh. Search in a small world. In Proceedings of IJCAI-99, 1999.","key":"26_CR14"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. J. Watts","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz. Collective dynamics of\u2019 small-world\u2019 networks. Nature, 393:440\u2013442, 1998.","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:48:38Z","timestamp":1550368118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}