{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:35Z","timestamp":1740109415604,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Austrian Science Fund","award":["I836-N23"],"award-info":[{"award-number":["I836-N23"]}]},{"DOI":"10.13039\/501100005203","name":"OeAD-GmbH","doi-asserted-by":"crossref","award":["KONTAKT CZ 04\/2017"],"award-info":[{"award-number":["KONTAKT CZ 04\/2017"]}],"id":[{"id":"10.13039\/501100005203","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Asociac\u00edon Mexicana de Cultura A.C."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00224-018-9905-y","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T03:09:03Z","timestamp":1545188943000},"page":"1298-1313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Number of Clones Determined by Disjunctions of Unary Relations"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0050-8085","authenticated-orcid":false,"given":"Mike","family":"Behrisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edith","family":"Vargas-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitriy","family":"Zhuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"9905_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and all that","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and all that. Cambridge University Press, Cambridge (1998). \n                    https:\/\/doi.org\/10.1017\/CBO9781139172752"},{"issue":"2","key":"9905_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2677161.2677165","volume":"1","author":"L Barto","year":"2014","unstructured":"Barto, L.: Constraint satisfaction problem and universal algebra. SIGLOG News 1(2), 14\u201324 (2014). \n                    https:\/\/doi.org\/10.1145\/2677161.2677165","journal-title":"SIGLOG News"},{"issue":"1:07","key":"9905_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(1:7)2012","volume":"8","author":"L Barto","year":"2012","unstructured":"Barto, L., Kozik, M.: Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem. Log. Methods Comput. Sci. 8(1:07), 1\u201327 (2012). \n                    https:\/\/doi.org\/10.2168\/LMCS-8(1:7)2012","journal-title":"Log. Methods Comput. Sci."},{"issue":"1","key":"9905_CR4","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2556646","volume":"61","author":"L Barto","year":"2014","unstructured":"Barto, L., Kozik, M.: Constraint satisfaction problems solvable by local consistency methods. J. ACM 61(1), 3:1\u20133:19 (2014). \n                    https:\/\/doi.org\/10.1145\/2556646","journal-title":"J. ACM"},{"issue":"4","key":"9905_CR5","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1137\/130915479","volume":"45","author":"L Barto","year":"2016","unstructured":"Barto, L., Kozik, M.: Robustly solvable constraint satisfaction problems. SIAM J. Comput. 45(4), 1646\u20131669 (2016). \n                    https:\/\/doi.org\/10.1137\/130915479","journal-title":"SIAM J. Comput."},{"key":"9905_CR6","doi-asserted-by":"publisher","unstructured":"Barto, L., Kozik, M.: Absorption in universal algebra and CSP. In: Krokhin, A.A., \u017eivn\u00fd, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups, vol. 7, pp. 45\u201377. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik. \n                    https:\/\/doi.org\/10.4230\/DFU.Vol7.15301.2\n                    \n                   (2017)","DOI":"10.4230\/DFU.Vol7.15301.2"},{"key":"9905_CR7","doi-asserted-by":"publisher","unstructured":"Barto, L., Kozik, M., Willard, R.: Near unanimity constraints have bounded pathwidth duality. In: Proceedings of the 27th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25\u201328, 2012, pp. 125\u2013134. IEEE Computer Soc., Los Alamitos, CA. \n                    https:\/\/doi.org\/10.1109\/LICS.2012.24\n                    \n                   (2012)","DOI":"10.1109\/LICS.2012.24"},{"key":"9905_CR8","doi-asserted-by":"publisher","unstructured":"Barto, L., Krokhin, A.A., Willard, R.: Polymorphisms, and how to use them. In: Krokhin, A.A., \u017eivn\u00fd, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups, vol. 7, pp. 1\u201344. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik. \n                    https:\/\/doi.org\/10.4230\/DFU.Vol7.15301.1\n                    \n                   (2017)","DOI":"10.4230\/DFU.Vol7.15301.1"},{"key":"9905_CR9","doi-asserted-by":"publisher","unstructured":"Barto, L., Pinsker, M.: The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, July 5\u20138, 2016, pp. 615\u2013622. ACM. \n                    https:\/\/doi.org\/10.1145\/2933575.2934544\n                    \n                   (2016)","DOI":"10.1145\/2933575.2934544"},{"key":"9905_CR10","unstructured":"Behrisch, M., Vargas, E.M.: C-clones and C-automorphism groups. In: Contributions to general algebra 19, pp. 1\u201312. Heyn, Klagenfurt (2010)"},{"issue":"2","key":"9905_CR11","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1007\/s00012-018-0497-9","volume":"79","author":"M Behrisch","year":"2018","unstructured":"Behrisch, M., Vargas-Garc\u00eda, E.: Unique inclusions of maximal C-clones in maximal clones. Algebra Universalis 79(2), 31:1\u201321 (2018). \n                    https:\/\/doi.org\/10.1007\/s00012-018-0497-9","journal-title":"Algebra Universalis"},{"issue":"3","key":"9905_CR12","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1090\/S0002-9947-09-04874-0","volume":"362","author":"JD Berman","year":"2010","unstructured":"Berman, J.D., Idziak, P., Markovi\u0107, P., McKenzie, R.N., Valeriote, M.A., Willard, R.: Varieties with few subalgebras of powers. Trans. Amer. Math. Soc. 362(3), 1445\u20131473 (2010). \n                    https:\/\/doi.org\/10.1090\/S0002-9947-09-04874-0","journal-title":"Trans. Amer. Math. Soc."},{"key":"9905_CR13","doi-asserted-by":"publisher","unstructured":"Bulatov, A., Valeriote, M. A.: Recent Results on the Algebraic Approach to the CSP. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints \u2013 an Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science, vol. 5250, pp. 68\u201392. Springer-Verlag (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-92800-3_4","DOI":"10.1007\/978-3-540-92800-3_4"},{"key":"9905_CR14","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. arXiv:\n                    1703.03021\n                    \n                   [cs.CC], pp. 1\u2013101. \n                    1703.03021v2\n                    \n                  (2017)"},{"issue":"4","key":"9905_CR15","doi-asserted-by":"publisher","first-page":"4:18","DOI":"10.2168\/LMCS-11(4:18)2015","volume":"11","author":"J Bul\u00edn","year":"2015","unstructured":"Bul\u00edn, J., Deli\u0107, D., Jackson, M., Niven, T.: A finer reduction of constraint problems to digraphs. Log. Methods Comput. Sci. 11(4), 4:18\u201333 (2015). \n                    https:\/\/doi.org\/10.2168\/LMCS-11(4:18)2015","journal-title":"Log. Methods Comput. Sci."},{"key":"9905_CR16","doi-asserted-by":"publisher","unstructured":"Chen, H., Mayr, P.: Quantified constraint satisfaction on monoids. In: Talbot, J., Regnier, L. (eds.) 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 \u2013 September 1, 2016, Marseille, France, LIPIcs. Leibniz Int. Proc. Inform., vol. 62, pp. 15:1\u201314. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Wadern. \n                    https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2016.15\n                    \n                   (2016)","DOI":"10.4230\/LIPIcs.CSL.2016.15"},{"key":"9905_CR17","doi-asserted-by":"publisher","unstructured":"Chen, H., Valeriote, M., Yoshida, Y.: Testing assignments to constraint satisfaction problems. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 525\u2013534. IEEE Computer Soc., Los Alamitos, CA. \n                    https:\/\/doi.org\/10.1109\/FOCS.2016.63\n                    \n                   (2016)","DOI":"10.1109\/FOCS.2016.63"},{"issue":"2","key":"9905_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00224-007-9003-z","volume":"42","author":"N Creignou","year":"2008","unstructured":"Creignou, N., Hermann, M., Krokhin, A., Salzer, G.: Complexity of clausal constraints over chains. Theory Comput. Syst. 42(2), 239\u2013255 (2008). \n                    https:\/\/doi.org\/10.1007\/s00224-007-9003-z","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9905_CR19","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/3007899","volume":"18","author":"P \u00d0api\u0107","year":"2017","unstructured":"\u00d0api\u0107, P., Markovi\u0107, P., Martin, B.: Quantified constraint satisfaction problem on semicomplete digraphs. ACM Trans. Comput. Log. 18(1), 2:1\u201347 (2017). \n                    https:\/\/doi.org\/10.1145\/3007899","journal-title":"ACM Trans. Comput. Log."},{"key":"9905_CR20","doi-asserted-by":"publisher","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. 2nd edn. \n                    https:\/\/doi.org\/10.1017\/CBO9780511809088\n                    \n                  . Cambridge University Press, New York (2002)","DOI":"10.1017\/CBO9780511809088"},{"issue":"4","key":"9905_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35(4), 413\u2013422 (1913). \n                    https:\/\/doi.org\/10.2307\/2370405","journal-title":"Amer. J. Math."},{"issue":"1","key":"9905_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T Feder","year":"1999","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28(1), 57\u2013104 (electronic) (1999). \n                    https:\/\/doi.org\/10.1137\/S0097539794266766","journal-title":"SIAM J. Comput."},{"key":"9905_CR23","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-valued Logics. International Series of Monographs on Computer Science, vol. 10. The Clarendon Press, Oxford University Press, Oxford Science Publications, New York (1993)"},{"key":"9905_CR24","doi-asserted-by":"publisher","unstructured":"H\u00e4hnle, R.: Tutorial: Complexity of many-valued logics. In: Proceedings of the Symposium Held in Warsaw, Poland, May 22\u201324, 2001, 31st IEEE International Symposium on Multiple-Valued Logic ISMVL 2001, pp. 137\u2013146. IEEE Computer Society, Los Alamitos, CA. \n                    https:\/\/doi.org\/10.1109\/ISMVL.2001.924565\n                    \n                   (2001)","DOI":"10.1109\/ISMVL.2001.924565"},{"issue":"1","key":"9905_CR25","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. J. Combin. Theory Ser. B 48(1), 92\u2013110 (1990). \n                    https:\/\/doi.org\/10.1016\/0095-8956(90)90132-J","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1-2","key":"9905_CR26","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. Theoret. Comput. Sci. 200(1-2), 185\u2013204 (1998). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(97)00230-2","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"9905_CR27","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00012-017-0476-6","volume":"78","author":"KA Kearnes","year":"2017","unstructured":"Kearnes, K.A., Szendrei, \u00c1.: Cube term blockers without finiteness. Algebra Universalis 78(4), 437\u2013459 (2017). \n                    https:\/\/doi.org\/10.1007\/s00012-017-0476-6","journal-title":"Algebra Universalis"},{"issue":"18","key":"9905_CR28","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.tcs.2008.12.048","volume":"410","author":"B Larose","year":"2009","unstructured":"Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. Theoret. Comput. Sci. 410(18), 1629\u20131647 (2009). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2008.12.048","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9905_CR29","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s11083-011-9232-2","volume":"29","author":"P Markovi\u0107","year":"2012","unstructured":"Markovi\u0107, P., Mar\u00f3ti, M., McKenzie, R.N.: Finitely related clones and algebras with cube terms. Order 29(2), 345\u2013359 (2012). \n                    https:\/\/doi.org\/10.1007\/s11083-011-9232-2","journal-title":"Order"},{"issue":"3-4","key":"9905_CR30","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00012-008-2122-9","volume":"59","author":"M Mar\u00f3ti","year":"2008","unstructured":"Mar\u00f3ti, M., McKenzie, R.N.: Existence theorems for weakly symmetric operations. Algebra Universalis 59(3-4), 463\u2013489 (2008). \n                    https:\/\/doi.org\/10.1007\/s00012-008-2122-9","journal-title":"Algebra Universalis"},{"key":"9905_CR31","doi-asserted-by":"publisher","unstructured":"Mart\u00edn-Mateos, F., Alonso, J., Hidalgo, M., Ruiz-Reina, J.: A formal proof of Dickson\u2019s Lemma in ACL2. In: Vardi, M.Y., Voronkov, A. (eds.) Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2003, Almaty, Kazakhstan, September 22\u201326, 2003. Lecture Notes in Artificial Intelligence, vol. 2850, pp. 49\u201358. Springer, Berlin (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-39813-4_3","DOI":"10.1007\/978-3-540-39813-4_3"},{"issue":"3","key":"9905_CR32","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s11083-017-9441-4","volume":"35","author":"J Opr\u0161al","year":"2018","unstructured":"Opr\u0161al, J.: Taylor\u2019s modularity conjecture and related problems for idempotent varieties. Order 35(3), 433\u2013460 (2018). \n                    https:\/\/doi.org\/10.1007\/s11083-017-9441-4","journal-title":"Order"},{"key":"9905_CR33","volume-title":"Funktionen- und Relationenalgebren. Ein Kapitel der diskreten Mathematik. [A Chapter in Discrete Mathematics] Mathematische Monographien [Mathematical Monographs], vol. 15","author":"R P\u00f6schel","year":"1979","unstructured":"P\u00f6schel, R., Kalu\u017enin, L.A.: Funktionen- und Relationenalgebren. Ein Kapitel der diskreten Mathematik. [A Chapter in Discrete Mathematics] Mathematische Monographien [Mathematical Monographs], vol. 15. VEB Deutscher Verlag der Wissenschaften, Berlin (1979)"},{"key":"9905_CR34","doi-asserted-by":"publisher","unstructured":"Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints \u2013 An Overview of Current Research Themes [Result of a Dagstuhl Seminar]., Lecture Notes in Computer Science, vol. 5250, pp. 229\u2013254. Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-540-92800-3_9\n                    \n                   (2008)","DOI":"10.1007\/978-3-540-92800-3_9"},{"key":"9905_CR35","volume-title":"Clones in Universal Algebra. S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures [Seminar on Higher Mathematics], vol. 99","author":"\u00c1 Szendrei","year":"1986","unstructured":"Szendrei, \u00c1.: Clones in Universal Algebra. S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures [Seminar on Higher Mathematics], vol. 99. Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1986)"},{"issue":"1-2","key":"9905_CR36","first-page":"251","volume":"51","author":"\u00c1 Szendrei","year":"1987","unstructured":"Szendrei, \u00c1.: Idempotent algebras with restrictions on subalgebras. Acta Sci. Math. (Szeged) 51(1-2), 251\u2013268 (1987)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"2","key":"9905_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7151\/dmgaa.1167","volume":"30","author":"E Vargas","year":"2010","unstructured":"Vargas, E.: Clausal relations and C-clones. Discuss. Math. Gen. Algebra Appl. 30(2), 147\u2013171 (2010). \n                    https:\/\/doi.org\/10.7151\/dmgaa.1167","journal-title":"Discuss. Math. Gen. Algebra Appl."},{"key":"9905_CR38","unstructured":"Vargas, E.M.: Clausal relations and C-clones. Doktorarbeit [PhD thesis], TU Dresden. \n                    http:\/\/nbn-resolving.de\/urn:nbn:de:bsz:14-qucosa-70905\n                    \n                   (2011)"},{"issue":"3","key":"9905_CR39","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1515\/dema-2013-0322","volume":"44","author":"EM Vargas","year":"2011","unstructured":"Vargas, E.M.: Maximal and minimal C-monoids. Demonstratio Math. 44(3), 615\u2013627 (2011). \n                    https:\/\/doi.org\/10.1515\/dema-2013-0322","journal-title":"Demonstratio Math."},{"key":"9905_CR40","doi-asserted-by":"publisher","unstructured":"Zhuk, D.: An algorithm for constraint satisfaction problem. In: Proceedings of the Symposium Held in Novi Sad, May 22\u201324, 2017, 47th IEEE International Symposium on Multiple-Valued Logic ISMVL 2017, pp. 1\u20136. IEEE Computer Society, Los Alamitos (2017). \n                    https:\/\/doi.org\/10.1109\/ISMVL.2017.20","DOI":"10.1109\/ISMVL.2017.20"},{"key":"9905_CR41","unstructured":"Zhuk, D.: The proof of CSP dichotomy conjecture. arXiv:\n                    1704.01914\n                    \n                   [cs.CC], pp. 1\u201340. \n                    1704.01914v8\n                    \n                   (2017)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9905-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9905-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9905-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T16:10:50Z","timestamp":1589991050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9905-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9905"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9905-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"19 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}