{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:07Z","timestamp":1759638067041},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540927990"},{"type":"electronic","value":"9783540928003"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92800-3_9","type":"book-chapter","created":{"date-parts":[[2008,12,22]],"date-time":"2008-12-22T08:39:25Z","timestamp":1229935165000},"page":"229-254","source":"Crossref","is-referenced-by-count":22,"title":["Partial Polymorphisms and Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Henning","family":"Schnoor","sequence":"first","affiliation":[]},{"given":"Ilka","family":"Schnoor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: Refining schaefer\u2019s theorem. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, pp. 71\u201382 (2005)","DOI":"10.1007\/11549345_8"},{"issue":"5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1515\/dma.1994.4.5.401","volume":"4","author":"V. Alekseev","year":"1994","unstructured":"Alekseev, V., Voronenko, A.: On some closed classes in partial two-valued logic. Discrete Mathematics and Applications\u00a04(5), 401\u2013419 (1994)","journal-title":"Discrete Mathematics and Applications"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/970831.970840","volume":"35","author":"E. B\u00f6hler","year":"2004","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: Constraint satisfaction problems. SIGACT News\u00a035(1), 22\u201335 (2004)","journal-title":"SIGACT News"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-45793-3_28","volume-title":"Computer Science Logic","author":"E. B\u00f6hler","year":"2002","unstructured":"B\u00f6hler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 412\u2013426. Springer, Heidelberg (2002)"},{"issue":"3","key":"9_CR5","first-page":"1","volume":"5","author":"V. Bodrarchuk","year":"1969","unstructured":"Bodrarchuk, V., Kaluzhnin, L., Kotov, V., Romov, B.: Galois theory for Post algebras i. Kibernetika\u00a05(3), 1\u201310 (1969)","journal-title":"Kibernetika"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2005.06.003","volume":"96","author":"E. B\u00f6hler","year":"2005","unstructured":"B\u00f6hler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Information Processing Letters\u00a096, 59\u201366 (2005)","journal-title":"Information Processing Letters"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"Journal of the ACM"},{"issue":"6","key":"9_CR8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N. Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.: On generating all solutions of generalized satisfiability problems. Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a031(6), 499\u2013511 (1997)","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"9_CR9","unstructured":"Creignou, N., Kolaitis, P., Zanuttini, B.: Preferred representations of Boolean relations. Technical Report TR05-119, Electronic Colloquium on Computational Complexity, ECCC (2005)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3","volume-title":"Complexity of Constraints","author":"N. Creignou","year":"2008","unstructured":"Creignou, N., Vollmer, H.: Boolean Constraint Satisfaction Problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.\u00a05250. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2140\/pjm.1968.27.95","volume":"27","author":"D. Geiger","year":"1968","unstructured":"Geiger, D.: Closed systems of functions and predicates. Pac. J. Math.\u00a027(1), 95\u2013100 (1968)","journal-title":"Pac. J. Math."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science\u00a0200, 185\u2013204 (1998)","journal-title":"Theoretical Computer Science"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"Ladner, R.: On the structure of polynomial-time reducibility. Journal of the ACM\u00a022, 155\u2013171 (1975)","journal-title":"Journal of the ACM"},{"key":"9_CR14","volume-title":"Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)","author":"D. Lau","year":"2006","unstructured":"Lau, D.: Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics). Springer, New York (2006)"},{"key":"9_CR15","first-page":"1","volume":"5","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies\u00a05, 1\u2013122 (1941)","journal-title":"Annals of Mathematical Studies"},{"issue":"2","key":"9_CR16","first-page":"157","volume":"17","author":"B. Romov","year":"1981","unstructured":"Romov, B.: The algebras of partial functions and their invariants. Cybernetics and Systems Analysis\u00a017(2), 157\u2013167 (1981)","journal-title":"Cybernetics and Systems Analysis"},{"key":"9_CR17","first-page":"216","volume-title":"Proceedings 10th Symposium on Theory of Computing","author":"T. Schaefer","year":"1978","unstructured":"Schaefer, T.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York (1978)"},{"key":"9_CR18","unstructured":"Schnoor, H., Schnoor, I.: Enumerating all solutions for constraint satisfaction problems. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints, number 06401 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"}],"container-title":["Lecture Notes in Computer Science","Complexity of Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92800-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T17:19:19Z","timestamp":1551719959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92800-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540927990","9783540928003"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92800-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}