{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:20:55Z","timestamp":1777994455929,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":65,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540927990","type":"print"},{"value":"9783540928003","type":"electronic"}],"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_5","type":"book-chapter","created":{"date-parts":[[2008,12,22]],"date-time":"2008-12-22T08:39:25Z","timestamp":1229935165000},"page":"93-124","source":"Crossref","is-referenced-by-count":42,"title":["Dualities for Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Andrei A.","family":"Bulatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Krokhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benoit","family":"Larose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Cosmodakis, S.: Expressiveness of restricted recursive queries. In: STOC 1989, pp. 113\u2013126 (1989)","DOI":"10.1145\/73007.73018"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.ejc.2007.11.004","volume":"29","author":"A. Atserias","year":"2008","unstructured":"Atserias, A.: On digraph coloring problems and treewidth duality. European Journal of Combinatorics\u00a029(4), 796\u2013820 (2008)","journal-title":"European Journal of Combinatorics"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-73420-8_49","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2007","unstructured":"Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 558\u2013570. Springer, Heidelberg (2007)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_8","volume-title":"Complexity of Constraints","author":"M. Bodirsky","year":"2008","unstructured":"Bodirsky, M.: Constraint satisfaction problems with infinite templates. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.\u00a05250. Springer, Heidelberg (2008)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/11672142_53","volume-title":"STACS 2006","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 646\u2013659. Springer, Heidelberg (2006)"},{"key":"5_CR6","unstructured":"Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates (2008) arXiv: 0809.2386v1"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS 2003, pp. 321\u2013330 (2003)","DOI":"10.1109\/LICS.2003.1210072"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: LICS 2004, pp. 448\u2013457 (2004)","DOI":"10.1109\/LICS.2004.1319639"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jalgebra.2004.07.044","volume":"298","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: Combinatorial problems raised from 2-semilattices. Journal of Algebra\u00a0298(2), 321\u2013339 (2006)","journal-title":"Journal of Algebra"},{"issue":"1","key":"5_CR10","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"},{"key":"5_CR11","unstructured":"Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische Universit\u00e4t Dresden, Germany (2001)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-92800-3_4","volume-title":"Complexity of Constraints","author":"A. Bulatov","year":"2008","unstructured":"Bulatov, A., Valeriote, M.: Recent results on the algebraic approach to the CSP. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.\u00a05250, pp. 68\u201392. Springer, Heidelberg (2008)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Carvalho, C., Dalmau, V., Krokhin, A.: Caterpillar duality for constraint satisfaction problems. In: LICS 2008, pp. 307\u2013316 (2008)","DOI":"10.1109\/LICS.2008.19"},{"key":"5_CR15","unstructured":"Carvalho, C., Dalmau, V., Markovi\u0107, P., Mar\u00f3ti, M.: CD(4) has bounded width. Algebra Universalis (accepted)"},{"key":"5_CR16","unstructured":"Clasen, M., Valeriote, M.: Tame congruence theory. In: Lectures on Algebraic Model Theory. Fields Institute Monographs, vol.\u00a015, pp. 67\u2013111 (2002)"},{"key":"5_CR17","volume-title":"Handbook of Constraint Programming","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch.\u00a08. Elsevier, Amsterdam (2006)"},{"key":"5_CR18","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.: Characterising tractable constraints. Artificial Intelligence\u00a065, 347\u2013361 (1994)","journal-title":"Artificial Intelligence"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a07 (2001)","DOI":"10.1137\/1.9780898718546"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Dalmau, V.: Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer Science\u00a01(1) (2005) (electronic)","DOI":"10.2168\/LMCS-1(1:5)2005"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Dalmau, V.: There are no pure relational width 2 constraint satisfaction problems (submitted, 2008)","DOI":"10.1016\/j.ipl.2008.10.005"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.ejc.2007.11.020","volume":"29","author":"V. Dalmau","year":"2008","unstructured":"Dalmau, V., Krokhin, A.: Majority constraints have bounded pathwidth duality. European Journal of Combinatorics\u00a029(4), 821\u2013837 (2008)","journal-title":"European Journal of Combinatorics"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Dalmau, V., Larose, B.: Maltsev + Datalog $\\Rightarrow$ Symmetric Datalog. In: LICS 2008, pp. 297\u2013306 (2008)","DOI":"10.1109\/LICS.2008.14"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-48085-3_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"V. Dalmau","year":"1999","unstructured":"Dalmau, V., Pearson, J.: Set functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 159\u2013173. Springer, Heidelberg (1999)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Egri, L., Larose, B., Tesson, P.: Symmetric Datalog and constraint satisfaction problems in Logspace. In: LICS 2007, pp. 193\u2013202 (2007)","DOI":"10.1109\/LICS.2007.47"},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/S0895480199383353","volume":"14","author":"T. Feder","year":"2001","unstructured":"Feder, T.: Classification of homomorphisms to oriented cycles and of k-partite satisfiability. SIAM Journal on Discrete Mathematics\u00a014(4), 471\u2013480 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/jgt.10073","volume":"42","author":"T. Feder","year":"2003","unstructured":"Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms. Journal of Graph Theory\u00a042, 61\u201380 (2003)","journal-title":"Journal of Graph Theory"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing\u00a028, 57\u2013104 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.Y.: Homomorphism closed vs. existential positive. In: Proc. 18th IEEE Symp. on Logic in Computer Science, LICS 2003, pp. 311\u2013320 (2003)","DOI":"10.1109\/LICS.2003.1210071"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory\u00a017(1), 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"5_CR31","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"5_CR32","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-33700-8_20","volume-title":"Topics in Discrete Mathematics","author":"P. Hell","year":"2006","unstructured":"Hell, P.: From graph colouring to constraint satisfaction: there and back again. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, vol.\u00a026, pp. 407\u2013432. Springer, Heidelberg (2006)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Ser. B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"5_CR34","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1090\/S0002-9947-96-01537-1","volume":"348","author":"P. Hell","year":"1996","unstructured":"Hell, P., Ne\u0161et\u0159il, J., Zhu, X.: Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc.\u00a0348, 147\u2013156 (1996)","journal-title":"Trans. Amer. Math. Soc."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J., Zhu, X.: Duality of graph homomorphisms. In: Combinatorics, Paul Erd\u00f6s is Eighty. Bolyai Soc. Math. Stud., vol.\u00a02, pp. 271\u2013282. J\u00e1nos Bolyai Math. Soc. (1996)","DOI":"10.1017\/S0305004100074806"},{"issue":"4","key":"5_CR37","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/jgt.3190200410","volume":"20","author":"P. Hell","year":"1995","unstructured":"Hell, P., Zhou, H., Zhu, X.: On homomorphisms to acyclic local tournaments. Journal of Graph Theory\u00a020(4), 467\u2013471 (1995)","journal-title":"Journal of Graph Theory"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0012-365X(94)90235-6","volume":"132","author":"P. Hell","year":"1994","unstructured":"Hell, P., Zhu, X.: Homomorphisms to oriented paths. Discrete Mathematics\u00a0132, 107\u2013114 (1994)","journal-title":"Discrete Mathematics"},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/S0895480192239992","volume":"8","author":"P. Hell","year":"1995","unstructured":"Hell, P., Zhu, X.: The existence of homomorphisms to oriented cycles. SIAM Journal on Discrete Mathematics\u00a08, 208\u2013222 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR40","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/076","volume-title":"The Structure of Finite Algebras","author":"D. Hobby","year":"1988","unstructured":"Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics, vol.\u00a076. American Mathematical Society, Providence (1988)"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS 2007, pp. 213\u2013222 (2007)","DOI":"10.1109\/LICS.2007.50"},{"key":"5_CR42","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"},{"issue":"1-2","key":"5_CR43","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0004-3702(98)00022-8","volume":"101","author":"P.G. Jeavons","year":"1998","unstructured":"Jeavons, P.G., Cohen, D.A., Cooper, M.C.: Constraints, consistency and closure. Artificial Intelligence\u00a0101(1-2), 251\u2013265 (1998)","journal-title":"Artificial Intelligence"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Kiss, E.W., Valeriote, M.: On tractability and congruence distributivity. Logical Methods in Computer Science\u00a03(2) (2007) (electronic)","DOI":"10.2168\/LMCS-3(2:6)2007"},{"key":"5_CR45","series-title":"EATCS Series: Texts in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-68804-8_2","volume-title":"Finite Model Theory and its Applications","author":"P.G. Kolaitis","year":"2007","unstructured":"Kolaitis, P.G.: On the expressive power of logics on finite models. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 27\u2013124. Springer, Heidelberg (2007)"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jcss.1995.1055","volume":"51","author":"P.G. Kolaitis","year":"1995","unstructured":"Kolaitis, P.G., Vardi, M.Y.: On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences\u00a051, 110\u2013134 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR47","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences\u00a061, 302\u2013332 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR48","series-title":"EATCS Series: Texts in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-68804-8_6","volume-title":"Finite Model Theory and its Applications","author":"P.G. Kolaitis","year":"2007","unstructured":"Kolaitis, P.G., Vardi, M.Y.: A logical approach to constraint satisfaction. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 339\u2013370. Springer, Heidelberg (2007)"},{"key":"5_CR49","doi-asserted-by":"crossref","first-page":"348","DOI":"10.21136\/CPM.1984.118204","volume":"51","author":"P. Kom\u00e1rek","year":"1984","unstructured":"Kom\u00e1rek, P.: Some new good characterisations of directed graphs. \u010casopis P\u011bst. Mat.\u00a051, 348\u2013354 (1984)","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"5_CR50","series-title":"NATO Science Series II: Math., Phys., Chem.","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/1-4020-3817-8_8","volume-title":"Structural Theory of Automata, Semigroups, and Universal Algebra","author":"A. Krokhin","year":"2005","unstructured":"Krokhin, A., Bulatov, A., Jeavons, P.: The complexity of constraint satisfaction: an algebraic approach. In: Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Series II: Math., Phys., Chem., vol.\u00a0207, pp. 181\u2013213. Springer, Heidelberg (2005)"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science\u00a03(4) (2007) (electronic)","DOI":"10.2168\/LMCS-3(4:6)2007"},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-73420-8_25","volume-title":"Automata, Languages and Programming","author":"B. Larose","year":"2007","unstructured":"Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 267\u2013278. Springer, Heidelberg (2007)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Larose, B., Valeriote, M., Z\u00e1dori, L.: Omitting types, bounded width and the ability to count (submitted, 2008)","DOI":"10.1142\/S021819670900524X"},{"issue":"3-4","key":"5_CR54","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00012-007-2012-6","volume":"56","author":"B. Larose","year":"2007","unstructured":"Larose, B., Z\u00e1dori, L.: Bounded width problems and algebras. Algebra Universalis\u00a056(3-4), 439\u2013466 (2007)","journal-title":"Algebra Universalis"},{"key":"5_CR55","series-title":"EATCS Series: Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. EATCS Series: Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"issue":"4","key":"5_CR56","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.ejc.2007.11.007","volume":"29","author":"C. Loten","year":"2008","unstructured":"Loten, C., Tardif, C.: Majority functions on structures with finite duality. European Journal of Combinatorics\u00a029(4), 979\u2013986 (2008)","journal-title":"European Journal of Combinatorics"},{"key":"5_CR57","unstructured":"Mar\u00f3ti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. In: Algebra Universalis (to appear, 2007)"},{"key":"5_CR58","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(78)90062-6","volume":"22","author":"J. Ne\u0161et\u0159il","year":"1978","unstructured":"Ne\u0161et\u0159il, J., Pultr, A.: On classes of relations and graphs determined by subobjects and factorobjects. Discrete Mathematics\u00a022, 287\u2013300 (1978)","journal-title":"Discrete Mathematics"},{"key":"5_CR59","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2000.1970","volume":"80","author":"J. Ne\u0161et\u0159il","year":"2000","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combinatorial Theory, Ser. B\u00a080, 80\u201397 (2000)","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"issue":"4","key":"5_CR60","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/S0895480104445630","volume":"19","author":"J. Ne\u0161et\u0159il","year":"2005","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: Short answers to exponentially long questions: extremal aspects of homomorphism duality. SIAM Journal on Discrete Mathematics\u00a019(4), 914\u2013920 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR61","volume-title":"Handbook of Constraint Programming","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Rossman, B.: Existential positive types and preservation under homomorphisms. In: LICS 2005, pp. 467\u2013476 (2005)","DOI":"10.1109\/LICS.2005.16"},{"key":"5_CR63","unstructured":"Szendrei, A.: Clones in Universal Algebra. Seminaires de Mathematiques Superieures, vol.\u00a099. University of Montreal (1986)"},{"key":"5_CR64","unstructured":"Valeriote, M.: A subalgebra intersection property for congruence-distributive varieties. Canadian Journal of Mathematics (to appear, 2007)"},{"key":"5_CR65","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S0004972700012284","volume":"47","author":"L. Z\u00e1dori","year":"1993","unstructured":"Z\u00e1dori, L.: Posets, near-unanimity functions and zigzags. Bulletin of the Australian Mathematical Society\u00a047, 79\u201393 (1993)","journal-title":"Bulletin of the Australian Mathematical Society"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T09:45:05Z","timestamp":1738835105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92800-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540927990","9783540928003"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92800-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}