{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:24:33Z","timestamp":1725521073342},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540898115"},{"type":"electronic","value":"9783540898122"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89812-2_5","type":"book-chapter","created":{"date-parts":[[2008,11,18]],"date-time":"2008-11-18T12:12:44Z","timestamp":1227010364000},"page":"62-75","source":"Crossref","is-referenced-by-count":3,"title":["On the Integration of Singleton Consistencies and Look-Ahead Heuristics"],"prefix":"10.1007","author":[{"given":"Marco","family":"Correia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Barahona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2004)","author":"R. Bart\u00e1k","year":"2004","unstructured":"Bart\u00e1k, R., Erben, R.: A new algorithm for singleton arc consistency. In: Barr, V., Markov, Z. (eds.) Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2004), Miami Beach, Florida, USA. AAAI Press, Menlo Park (2004)"},{"key":"5_CR2","unstructured":"Bessi\u00e9re, C., R\u00e9gin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, Nagoya, Japan, pp. 398\u2013404 (1997)"},{"key":"5_CR3","unstructured":"Bessi\u00e8re, C., Debruyne, R.: Theoretical analysis of singleton arc consistency. In: Proceedings of ECAI 2004 (2004)"},{"key":"5_CR4","unstructured":"Bessi\u00e8re, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI 2005 (2005)"},{"key":"5_CR5","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceeding of IJCAI 1991, pp. 331\u2013340 (1991)"},{"key":"5_CR6","unstructured":"Culberson, J.: Graph coloring resources. on-line, http:\/\/web.cs.ualberta.ca\/joe\/Coloring\/Generators\/generate.html"},{"key":"5_CR7","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of IJCAI 1997, pp. 412\u2013417 (1997)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"D. Val del","year":"2003","unstructured":"del Val, D., Cebrian: Redundant modeling for the quasigroup completion problem. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, Springer, Heidelberg (2003)"},{"key":"5_CR9","first-page":"31","volume-title":"Proceedings of ECAI 1992","author":"P.A. Geelen","year":"1992","unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of ECAI 1992, pp. 31\u201335. John Wiley & Sons, Inc., New York (1992)"},{"key":"5_CR10","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI 1996, vol.\u00a01, pp. 246\u2013252 (1996)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1011454308633","volume":"6","author":"I.P. Gent","year":"2001","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints\u00a06(4), 345\u2013372 (2001)","journal-title":"Constraints"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kask, K., Dechter, R., Gogate, V.: New look-ahead schemes for constraint satisfaction. In: Proceeding of AMAI 2004 (2004)","DOI":"10.1007\/978-3-540-30201-8_25"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Kautz, Ruan, Achlioptas, Gomes, Selman, Stickel.: Balance and filtering in structured satisfiable problems. In: Proceedings of IJCAI 2001 (2001)","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"5_CR15","unstructured":"Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of IJCAI 2005, pp. 199\u2013204. Professional Book Center (2005)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1985","unstructured":"Mackworth, A.K., Freuder, E.C.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence\u00a025, 65\u201374 (1985)","journal-title":"Artificial Intelligence"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-45349-0_26","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"P. Prosser","year":"2000","unstructured":"Prosser, P., Stergiou, K., Walsh, T.: Singleton consistencies. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 353\u2013368. Springer, Heidelberg (2000)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"5_CR19","unstructured":"Shaw, P., Stergiou, K., Walsh, T.: Arc consistency and quasigroup completion. In: Proceedings of ECAI 1998 workshop on non-binary constraints, March 14 (1998)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89812-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:31:41Z","timestamp":1557930701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89812-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898115","9783540898122"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89812-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}