{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:40:03Z","timestamp":1744238403369,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_50","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"688-703","source":"Crossref","is-referenced-by-count":6,"title":["Revisiting Neighborhood Inverse Consistency on Binary CSPs"],"prefix":"10.1007","author":[{"given":"Robert J.","family":"Woodward","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shant","family":"Karakashian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00210-2","volume":"140","author":"F. Bacchus","year":"2002","unstructured":"Bacchus, F., Chen, X., Beek, P.V., Walsh, T.: Binary vs. Non-Binary Constraints. Artificial Intelligence\u00a0140, 1\u201337 (2002)","journal-title":"Artificial Intelligence"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C.: Constraint Propagation. In: Handbook of Constraint Programming. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BFb0017448","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"R. Debruyne","year":"1997","unstructured":"Debruyne, R., Bessi\u00e8re, C.: From Restricted Path Consistency to Max-Restricted Path Consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 312\u2013326. Springer, Heidelberg (1997)"},{"key":"50_CR4","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 412\u2013417 (1997)"},{"key":"50_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":"50_CR6","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)"},{"issue":"1","key":"50_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E.C. Freuder","year":"1982","unstructured":"Freuder, E.C.: A Sufficient Condition for Backtrack-Free Search. JACM\u00a029(1), 24\u201332 (1982)","journal-title":"JACM"},{"key":"50_CR8","unstructured":"Freuder, E.C., Elfe, C.D.: Neighborhood Inverse Consistency Preprocessing. In: Proceedings of AAAI 1996, Portland, Oregon, pp. 202\u2013208 (1996)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 75. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Janssen, P., J\u00e9gou, P., Nougier, B., Vilarem, M.C.: A Filtering Process for General Constraint-Satisfaction Problems: Achieving Pairwise-Consistency Using an Associated Binary Representation. In: IEEE Workshop on Tools for AI, pp. 420\u2013427 (1989)","DOI":"10.1109\/TAI.1989.65349"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Karakashian, S., Woodward, R., Reeson, C., Choueiry, B.Y., Bessi\u00e8re, C.: A First Practical Algorithm for High Levels of Relational Consistency. In: 24th AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 101\u2013107 (2010)","DOI":"10.1609\/aaai.v24i1.7535"},{"key":"50_CR12","unstructured":"Kj\u00e6rulff, U.: Triagulation of Graphs - Algorithms Giving Small Total State Space. Research Report R-90-09, Aalborg University, Denmark (1990)"},{"key":"50_CR13","unstructured":"Lecoutre, C., Cardon, S., Vion, J.: Conservative Dual Consistency. In: Proceedings of AAAI 2007, pp. 237\u2013242 (2007)"},{"key":"50_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1613\/jair.3180","volume":"40","author":"C. Lecoutre","year":"2011","unstructured":"Lecoutre, C., Cardon, S., Vion, J.: Second-Order Consistencies. Journal of Artificial Intelligence Research\u00a040, 175\u2013219 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in Networks of Relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting Conventional Wisdom in Constraint Satisfaction. In: Proceedings of the 11th European Conference on Artificial Intelligence, Amsterdam, The Netherlands, pp. 125\u2013129 (1994)","DOI":"10.1007\/3-540-58601-6_86"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Woodward, R., Karakashian, S., Choueiry, B.Y., Bessi\u00e8re, C.: Solving Difficult CSPs with Relational Neighborhood Inverse Consistency. In: 25th AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 112\u2013119 (2011)","DOI":"10.1609\/aaai.v25i1.7825"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:14:44Z","timestamp":1744236884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}