{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:32:05Z","timestamp":1758270725455},"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_12","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"137-151","source":"Crossref","is-referenced-by-count":4,"title":["Propagation in CSP and SAT"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Dimopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Bacchus, F.: Enhancing Davis Putnam with Extended Binary Clause Reasoning. In: Proceedings of AAAI 2002, pp. 613\u2013619 (2002)"},{"key":"12_CR2","unstructured":"Bennaceur, H.: The satisfiability problem regarded as a constraint satisfaction problem. In: Proceedings of ECAI 1996, pp. 125\u2013130 (1996)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/B:CONS.0000024048.03454.c0","volume":"9","author":"H. Bennaceur","year":"2004","unstructured":"Bennaceur, H.: A Comparison between SAT and CSP Techniques. Constraints\u00a09, 123\u2013138 (2004)","journal-title":"Constraints"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-24605-3_23","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 299\u2013314. Springer, Heidelberg (2004)"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R. Debruyne","year":"2001","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Domain Filtering Consistencies. Journal of Artificial Intelligence Research\u00a014, 205\u2013230 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12_CR6","unstructured":"Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D thesis (1995)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. Freuder","year":"1985","unstructured":"Freuder, E.: A Sufficient Condition for Backtrack-bounded Search. JACM\u00a032(4), 755\u2013761 (1985)","journal-title":"JACM"},{"key":"12_CR8","unstructured":"Freuder, E., Elfe, C.: Neighborhood Inverse Consistency Preprocessing. In: Proceedings of AAAI 1996, pp. 202\u2013208 (1996)"},{"key":"12_CR9","unstructured":"Gent, I.: Arc Consistency in SAT. In: Proceedings of ECAI 2002, pp. 121\u2013125 (2002)"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S.: On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence\u00a045(3), 275\u2013286 (1990)","journal-title":"Artificial Intelligence"},{"key":"12_CR11","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of IJCAI 1997, pp. 366\u2013371 (1997)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-30201-8_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"S.D. Prestwich","year":"2004","unstructured":"Prestwich, S.D.: Full dynamic substitutability by SAT encoding. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 512\u2013526. Springer, Heidelberg (2004)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"van Gelder, A., Tsuji, Y.: Satisfiability testing with more reasoning and less guessing. In: Cliques, Coloring and Satisfiability, pp. 559\u2013586 (1996)","DOI":"10.1090\/dimacs\/026\/27"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"}],"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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:30:31Z","timestamp":1619494231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11889205_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}