{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T12:52:36Z","timestamp":1773406356719,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677154","type":"print"},{"value":"9783540450221","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_24","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:57:25Z","timestamp":1194980245000},"page":"272-282","source":"Crossref","is-referenced-by-count":51,"title":["Constraint Satisfaction Problems and Finite Algebras"],"prefix":"10.1007","author":[{"given":"Andrei A.","family":"Bulatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei A.","family":"Krokhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jeavons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0004-3702(88)90023-9","volume":"35","author":"W. Bibel","year":"1988","unstructured":"W. Bibel. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence, 35, 1988, 401\u2013413.","journal-title":"Artificial Intelligence"},{"key":"24_CR2","unstructured":"A. Bulatov, A. Krokhin, P. Jeavons. Constraint satisfaction problems and finite algebras. Oxford University Computing Lab. Technical Report, PRG-TR-4-99."},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"T. Feder, M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Computing, 28(1), 1998, 57\u2013104.","journal-title":"SIAM J. Computing"},{"key":"24_CR4","volume-title":"Computers and Intractabilty: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey, D.S. Johnson. Computers and Intractabilty: A Guide to the Theory of NP-Completeness. Freeman, San-Fransisco, CA, 1979."},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"M. Gyssens, P. Jeavons, D. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1), 1994, 57\u201389.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P. Jeavons","year":"1995","unstructured":"P. Jeavons, M.C. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79(2), 1995, 327\u2013339.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"P. Jeavons, D. Cohen, M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4), 1997, 527\u2013548.","journal-title":"Journal of the ACM"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018941030227","volume":"24","author":"P. Jeavons","year":"1998","unstructured":"P. Jeavons, D. Cohen, J. Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence 24, 1998, 51\u201367.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P. Jeavons","year":"1998","unstructured":"P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200, 1998, 185\u2013204.","journal-title":"Theoretical Computer Science"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","volume":"64","author":"L. Kirousis","year":"1993","unstructured":"L. Kirousis. Fast parallel constraint satisfaction. Artificial Intelligence, 64, 1993, 147\u2013160.","journal-title":"Artificial Intelligence"},{"key":"24_CR11","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. Artificial Intelligence, 8, 1977, 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"A.K. Mackworth. Constraint satisfaction. In Encyclopedia of Artificial Intelligence, vol. 1 (Ed. S.C. Shapiro), Wiley Interscience, 1992, 285\u2013293.","DOI":"10.1016\/0004-3702(92)90003-G"},{"key":"24_CR13","volume-title":"Algebras, Lattices, Varieties","author":"R.N. McKenzie","year":"1987","unstructured":"R.N. McKenzie, G.F. McNulty, W. Taylor. Algebras, Lattices, Varieties, vol. 1, Wadsworth and Brooks, California, 1987."},{"key":"24_CR14","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. Information Sciences, 7, 1974, 95\u2013132.","journal-title":"Information Sciences"},{"key":"24_CR15","unstructured":"J. Pearson, P. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway, University of London, 1997."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"E.L. Post. The two-valued iterative systems of mathematical logic, Ann. Math. Studies 5, Princeton Univ. Press, 1941.","DOI":"10.1515\/9781400882366"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer. The complexity of satisfiability problems. In Proceedings of 10th ACM Symposium on Theory of Computing (STOC), 1978, 216\u2013226.","DOI":"10.1145\/800133.804350"},{"key":"24_CR18","unstructured":"\u00c1. Szendrei. Clones in universal algebra (S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieurs, vol. 99). Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, 1986."},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1017\/S1446788700029979","volume":"48","author":"Szendrei","year":"1990","unstructured":"\u00c1. Szendrei. Simple surjective algebras having no proper subalgebras, J. Austral. Math. Soc. (Series A), 48, 1990, 434\u2013454.","journal-title":"J. Austral. Math. Soc. (Series A)"},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF01195723","volume":"32","author":"A. Szendrei","year":"1994","unstructured":"A. Szendrei. Term minimal algebras. Algebra Universalis, 32(4), 1994, 439\u2013477.","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:25:35Z","timestamp":1556954735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}