{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:21Z","timestamp":1725470841730},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_15","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"182-197","source":"Crossref","is-referenced-by-count":26,"title":["Watched Literals for Constraint Propagation in Minion"],"prefix":"10.1007","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Jefferson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Arc consistency for general constraint networks: Preliminary results. In: IJCAI, pp. 398\u2013404 (1997)"},{"issue":"1","key":"15_CR2","first-page":"179","volume":"65","author":"C. Bessi\u00e8re","year":"1994","unstructured":"Bessi\u00e8re, C.: Arc-consistency and arc-consistency again. AIJ\u00a065(1), 179\u2013190 (1994)","journal-title":"AIJ"},{"key":"15_CR3","unstructured":"Bessi\u00e8re, C., Freuder, E.C., R\u00e9gin, J.-C.: Using inference to reduce arc consistency computation. In: IJCAI, pp. 592\u2013599 (1995)"},{"issue":"2","key":"15_CR4","first-page":"165","volume":"165","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. AIJ\u00a0165(2), 165\u2013185 (2005)","journal-title":"AIJ"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1145\/775832.776041","volume-title":"DAC","author":"D. Chai","year":"2003","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: DAC, pp. 830\u2013835. ACM, New York (2003)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"15_CR7","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast, scalable, constraint solver. In: ECAI (2006)"},{"key":"15_CR8","unstructured":"Van Hentenryck, P., Carillon, J.-P.: Generality versus specificity: An experience with ai and or techniques. In: AAAI, pp. 660\u2013664 (1988)"},{"issue":"1-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. Hentenryck Van","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V.A., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). J. Log. Program.\u00a037(1-3), 139\u2013164 (1998)","journal-title":"J. Log. Program."},{"key":"15_CR10","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: SAT, pp. 283\u2013292 (2000)"},{"key":"15_CR11","unstructured":"Laburthe, F.: CHOCO: implementing a CP kernel. In: Workshop on Techniques for Implementing Constraint programming Systems (TRICS) (2000)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, S., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC (2001)","DOI":"10.1145\/378239.379017"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/11564751_39","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.-C. R\u00e9gin","year":"2005","unstructured":"R\u00e9gin, J.-C.: Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 520\u2013533. Springer, Heidelberg (2005)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-540-30201-8_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C. Schulte","year":"2004","unstructured":"Schulte, C., Stuckey, P.J.: Speeding up constraint propagation. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 619\u2013633. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:32:15Z","timestamp":1683592335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11889205_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}