{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:09:56Z","timestamp":1787508596125,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602996","type":"print"},{"value":"9783540447887","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:14:29Z","timestamp":1330262069000},"page":"276-291","source":"Crossref","is-referenced-by-count":26,"title":["A unifying framework for tractable constraints"],"prefix":"10.1007","author":[{"given":"Peter","family":"Jeavons","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Gyssens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"Codd, E.F., \u201cA Relational Model of Data for Large Shared Databanks,\u201d Communications of the ACM 13 (1970), pp. 377\u2013387.","journal-title":"Communications of the ACM"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","volume":"65","author":"M.C. Cooper","year":"1994","unstructured":"Cooper, M.C., Cohen, D.A., Jeavons, P.G., \u201cCharacterizing tractable constraints,\u201d Artificial Intelligence 65 (1994), pp. 347\u2013361.","journal-title":"Artificial Intelligence"},{"key":"17_CR3","volume-title":"Technical Report","author":"M.C. Cooper","year":"1994","unstructured":"Cooper, M.C., & Jeavons, P.G., \u201cTractable constraints on ordered domains,\u201d Technical Report, Dept of Computer Science, Royal Holloway, University of London (1994) and submitted to Artificial Intelligence."},{"key":"17_CR4","unstructured":"Davey B.A. & Priestley, H.A., Introduction to Lattices and Order, Cambridge University Press (1990)."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"R. Dechter","year":"1992","unstructured":"Dechter, R., & Pearl, J., \u201cStructure identification in relational data,\u201d Artificial Intelligence 58 (1992), pp. 237\u2013270.","journal-title":"Artificial Intelligence"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"Dechter, R. & Pearl J. \u201cNetwork-based heuristics for constraint-satisfaction problems,\u201d Artificial Intelligence 34 (1988), pp. 1\u201338.","journal-title":"Artificial Intelligence"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E.C. Freuder","year":"1985","unstructured":"Freuder, E.C., \u201cA sufficient condition for backtrack-bounded search,\u201d Journal of the ACM 32 (1985), pp. 755\u2013761.","journal-title":"Journal of the ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P., Cohen, D., \u201cDecomposing constraint satisfaction problems using database techniques,\u201d Artificial Intelligence 66 (1994), pp. 57\u201389.","journal-title":"Artificial Intelligence"},{"key":"17_CR9","volume-title":"Technical Report CSD-TR-95-05","author":"P.G. Jeavons","year":"1995","unstructured":"Jeavons, P.G., \u201cAn algebraic characterization of tractable constraints,\u201d Technical Report CSD-TR-95-05, Royal Holloway, University of London (1995)."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","volume":"64","author":"L. Kirousis","year":"1993","unstructured":"Kirousis, L., \u201cFast parallel constraint satisfaction,\u201d Artificial Intelligence 64 (1993), pp. 147\u2013160.","journal-title":"Artificial Intelligence"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/176584.176585","volume":"41","author":"P.B. Ladkin","year":"1994","unstructured":"Ladkin, P.B., & Maddux, R.D., \u201cOn binary constraint problems,\u201d Journal of the ACM 41 (1994), pp. 435\u2013469.","journal-title":"Journal of the ACM"},{"key":"17_CR12","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. \u201cConsistency in networks of relations,\u201d Artificial Intelligence 8 (1977), pp. 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U., \u201cNetworks of constraints: fundamental properties and applications to picture processing,\u201d Information Sciences 7 (1974), pp. 95\u2013132.","journal-title":"Information Sciences"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0004-3702(91)90059-S","volume":"48","author":"U. Montanari","year":"1991","unstructured":"Montanari, U., & Rossi, F., \u201cConstraint relaxation may be perfect,\u201d Artificial Intelligence 48 (1991), pp. 143\u2013170.","journal-title":"Artificial Intelligence"},{"key":"17_CR15","unstructured":"Papadimitriou, C.H., Computational Complexity, Addison-Wesley (1994)."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J., \u201cThe complexity of satisfiability problems,\u201d Proc 10th ACM Symposium on Theory of Computing (STOC) (1978), pp. 216\u2013226.","DOI":"10.1145\/800133.804350"},{"key":"17_CR17","unstructured":"Szendrei, A., Clones in Universal Algebra, S\u00e9minaires de Math\u00e9matiques Sup\u00e9rieures 99, Universit\u00e9 de Montr\u00e9al (1986)."},{"key":"17_CR18","unstructured":"van Beek, P., \u201cOn the Minimality and Decomposability of Row-Convex Constraint Networks,\u201d Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI-9S, MIT Press (1992), pp. 447\u2013452."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck Van","year":"1992","unstructured":"Van Hentenryck, P., Deville, Y., Teng, C-M., \u201cA generic arc-consistency algorithm and its specializations,\u201d Artificial Intelligence 57 (1992), pp. 291\u2013321.","journal-title":"Artificial Intelligence"}],"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_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:52Z","timestamp":1619559412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}