{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:49:06Z","timestamp":1752461346386},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:14:38Z","timestamp":1330262078000},"page":"240-257","source":"Crossref","is-referenced-by-count":10,"title":["Local and global relational consistency"],"prefix":"10.1007","author":[{"given":"Rina","family":"Dechter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Beek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding an embedding in k-trees. SIAM Journal of Algebraic Discrete Methods, 8:177\u2013184, 1987.","journal-title":"SIAM Journal of Algebraic Discrete Methods"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30:479\u2013513, 1983.","journal-title":"J. ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(89)90080-5","volume":"41","author":"M. C. Cooper","year":"1989","unstructured":"M. C. Cooper. An optimal k-consistency algorithm. Artif. Intell., 41:89\u201395, 1989.","journal-title":"Artif. Intell."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7:201\u2013215, 1960.","journal-title":"J. ACM"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","volume":"55","author":"R. Dechter","year":"1992","unstructured":"R. Dechter. From local to global consistency. Artif. Intell., 55:87\u2013107, 1992.","journal-title":"Artif. Intell."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artif. Intell., 49:61\u201395, 1991.","journal-title":"Artif. Intell."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artif. Intell., 34:1\u201338, 1988.","journal-title":"Artif. Intell."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"R. Dechter and J. Pearl. Tree clustering for constraint networks. Artif. Intell., 38:353\u2013366, 1989.","journal-title":"Artif. Intell."},{"key":"15_CR9","unstructured":"R. Dechter and J. Pearl. Directed constraint networks: A relational framework for causal modeling. In Proc. of the 12th Int'l Joint Conf. on AI, pages 1164\u20131170, 1991."},{"key":"15_CR10","unstructured":"R. Dechter and I. Rish. Directional resolution: The Davis-Putnam procedure, revisited. In Proc. of the 4th Int'l Conf. on Principles of KR&R, 1994."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E. C. Freuder","year":"1978","unstructured":"E. C. Freuder. Synthesizing constraint expressions. Comm. ACM, 21:958\u2013966, 1978.","journal-title":"Comm. ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. C. Freuder","year":"1982","unstructured":"E. C. Freuder. A sufficient condition for backtrack-free search. J. ACM, 29:24\u201332, 1982.","journal-title":"J. ACM"},{"key":"15_CR13","unstructured":"M. L. Ginsberg, M. Frank, M. P. Halpin, and M. C. Torrance. Search lessons learned from crossword puzzles. In Proc. of the 8th Nat'l Conf. on AI, pages 210\u2013215, 1990."},{"key":"15_CR14","unstructured":"P. J\u00e9gou. On the consistency of general constraint satisfaction problems. In Proc. of the 11th National Conf. on AI, pages 114\u2013119, 1993."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","volume":"64","author":"L. M. Kirousis","year":"1993","unstructured":"L. M. Kirousis. Fast parallel constraint satisfaction. Artif. Intell., 64:147\u2013160, 1993.","journal-title":"Artif. Intell."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"J-L Lassez and M. Mahler, \u201cOn Fourier's algorithm for linear constraints\u201d Journal of Automated Reasoning, Vol 9, 1992.","DOI":"10.1007\/BF00245296"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"A. K. Mackworth. Consistency in networks of relations. Artif. Intell., 8:99\u2013118, 1977.","journal-title":"Artif. Intell."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A. K. Mackworth","year":"1985","unstructured":"A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artif. Intell., 25:65\u201374, 1985.","journal-title":"Artif. Intell."},{"key":"15_CR19","unstructured":"D. Maier. The Theory of Relational Databases. Computer Science Press, 1983."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci., 7:95\u2013132, 1974.","journal-title":"Inform. Sci."},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B. A. Nadel","year":"1989","unstructured":"B. A. Nadel. Constraint satisfaction algorithms. Comput. Intell., 5:188\u2013224, 1989.","journal-title":"Comput. Intell."},{"key":"15_CR22","unstructured":"P. van Beek. On the minimality and decomposability of constraint networks. In Proc. of the 10th National Conf. on AI, pages 447\u2013452, 1992."},{"key":"15_CR23","unstructured":"P. van Beek. On the inherent level of local consistency in constraint networks. In Proc. of the 12th National Conf. on AI, pages 368\u2013373, 1994."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"P. van Beek and R. Dechter. Constraint tightness versus global consistency. In Proc. of the 4th Int'l Conf. on Principles of KR&R, pages 572\u2013582, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50148-2"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"P. van Beek and R. Dechter. On the minimality and global consistency of rowconvex constraint networks. To appear in J. ACM, 1995.","DOI":"10.1145\/210346.210347"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, Y. Deville, and C.-M. Teng. A generic arc consistency algorithm and its specializations. Artif. Intell., 57:291\u2013321, 1992.","journal-title":"Artif. Intell."},{"key":"15_CR27","unstructured":"M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proc. of the 5th National Conf. on AI, pages 377\u2013382, 1986."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:54Z","timestamp":1605628674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}