{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:09:25Z","timestamp":1787508565984,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["681988"],"award-info":[{"award-number":["681988"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394750","type":"proceedings-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T20:23:18Z","timestamp":1590438198000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Temporal Constraint Satisfaction Problems in Fixed-Point Logic"],"prefix":"10.1145","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[{"name":"TU Dresden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wied","family":"Pakusa","sequence":"additional","affiliation":[{"name":"RWTH Aachen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Rydval","sequence":"additional","affiliation":[{"name":"TU Dresden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.049"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz022"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061319500107"},{"key":"e_1_3_2_1_4_1","volume-title":"Constraint Satisfaction Problems of Bounded Width. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE","author":"Barto L.","unstructured":"L. Barto and M. Kozik . 2009 . Constraint Satisfaction Problems of Bounded Width. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE , Atlanta, GA, USA, 595--603. L. Barto and M. Kozik. 2009. Constraint Satisfaction Problems of Bounded Width. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE, Atlanta, GA, USA, 595--603."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-017-1621-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1190150152"},{"key":"e_1_3_2_1_7_1","unstructured":"M. Bodirsky. 2012. Complexity Classification in Infinite-Domain Constraint Satisfaction. (2012). M\u00e9moire d'habilitation \u00e0 diriger des recherches Universit\u00e9 Diderot -- Paris 7. Available at arXiv:1201.0856.  M. Bodirsky. 2012. Complexity Classification in Infinite-Domain Constraint Satisfaction. (2012). M\u00e9moire d'habilitation \u00e0 diriger des recherches Universit\u00e9 Diderot -- Paris 7. Available at arXiv:1201.0856."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196714500507"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.05.012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176764.3176773"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667058"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1740582.1740583"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science. ACM, IEEE","author":"Bodirsky M.","unstructured":"M. Bodirsky and A. Mottet . 2016. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction . In Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science. ACM, IEEE , New York, NY, USA, 623--632. M. Bodirsky and A. Mottet. 2016. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. In Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science. ACM, IEEE, New York, NY, USA, 623--632."},{"key":"e_1_3_2_1_14_1","volume-title":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE","author":"Bodirsky M.","year":"1901","unstructured":"M. Bodirsky , A. Mottet , M. Ol\u0161\u00e1k , J. Opr\u0161al , M. Pinsker , and R. Willard . 2019. Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) . In 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE , Vancouver, BC, Canada, 1--12. Available at arXiv : 1901 .04237. M. Bodirsky, A. Mottet, M. Ol\u0161\u00e1k, J. Opr\u0161al, M. Pinsker, and R. Willard. 2019. Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). In 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE, Vancouver, BC, Canada, 1--12. Available at arXiv:1901.04237."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/558\/11058"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the ninth annual ACM symposium on Theory of computing. ACM","author":"Chandra A. K.","unstructured":"A. K. Chandra and P. M. Merlin . 1977. Optimal implementation of conjunctive queries in relational databases . In Proceedings of the ninth annual ACM symposium on Theory of computing. ACM , New York, NY, United States, 77--90. A. K. Chandra and P. M. Merlin. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the ninth annual ACM symposium on Theory of computing. ACM, New York, NY, United States, 77--90."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1998.0641"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2728816.2728820"},{"key":"e_1_3_2_1_20_1","volume-title":"2009 24th Annual IEEE Symposium on Logic In Computer Science. IEEE","author":"Dawar A.","unstructured":"A. Dawar , M. Grohe , B. Holm , and B. Laubner . 2009. Logics with rank operators . In 2009 24th Annual IEEE Symposium on Logic In Computer Science. IEEE , Los Angeles, CA, USA, 113--122. A. Dawar, M. Grohe, B. Holm, and B. Laubner. 2009. Logics with rank operators. In 2009 24th Annual IEEE Symposium on Logic In Computer Science. IEEE, Los Angeles, CA, USA, 113--122."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"A. Dawar and S. Kreutzer. 2008. On Datalog vs. LFP. In International Colloquium on Automata Languages and Programming. Springer Reykjavik Iceland 160--171.  A. Dawar and S. Kreutzer. 2008. On Datalog vs. LFP. In International Colloquium on Automata Languages and Programming. Springer Reykjavik Iceland 160--171.","DOI":"10.1007\/978-3-540-70583-3_14"},{"key":"e_1_3_2_1_22_1","volume-title":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE","author":"Dawar A.","unstructured":"A. Dawar and P. Wang . 2017. Definability of semidefinite programming and Lasserre lower bounds for CSPs . In 2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE , Reykjavik, Iceland, 1--12. A. Dawar and P. Wang. 2017. Definability of semidefinite programming and Lasserre lower bounds for CSPs. In 2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE, Reykjavik, Iceland, 1--12."},{"key":"e_1_3_2_1_23_1","volume-title":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. IEEE","author":"Feder T.","unstructured":"T. Feder and M. Y. Vardi . 2003. Homomorphism closed vs. existential positive . In 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. IEEE , Ottawa, Ont., Canada, 311--320. T. Feder and M. Y. Vardi. 2003. Homomorphism closed vs. existential positive. In 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. IEEE, Ottawa, Ont., Canada, 311--320."},{"key":"e_1_3_2_1_24_1","unstructured":"P. Gillibert J. Jonu\u0161as M. Kompatscher A. Mottet and M. Pinsker. 2020. Hrushovski's encoding and \u03c9-categorical CSP monsters. In International Colloquium on Automata Languages and Programming. ACM Saarbr\u00fccken Germany to appear. Available at arXiv:2002.07054.  P. Gillibert J. Jonu\u0161as M. Kompatscher A. Mottet and M. Pinsker. 2020. Hrushovski's encoding and \u03c9-categorical CSP monsters. In International Colloquium on Automata Languages and Programming. ACM Saarbr\u00fccken Germany to appear. Available at arXiv:2002.07054."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03351-3_12"},{"key":"e_1_3_2_1_26_1","unstructured":"E. Gr\u00e4del P. G. Kolaitis L. Libkin M. Marx J. Spencer M. Y. Vardi Y. Venema and S. Weinstein. 2007. Finite Model Theory and its applications. Springer Berlin Heidelberg New York.  E. Gr\u00e4del P. G. Kolaitis L. Libkin M. Marx J. Spencer M. Y. Vardi Y. Venema and S. Weinstein. 2007. Finite Model Theory and its applications. Springer Berlin Heidelberg New York."},{"key":"e_1_3_2_1_27_1","volume-title":"6th Workshop, CSL '92","volume":"702","author":"Gr\u00e4del E.","year":"1992","unstructured":"E. Gr\u00e4del and M. Otto . 1993. Inductive Definability with Counting on Finite Structures. In Computer Science Logic , 6th Workshop, CSL '92 , San Miniato 1992 , Selected Papers, Vol. 702 . Springer, San Miniato, Italy, 231--247. E. Gr\u00e4del and M. Otto. 1993. Inductive Definability with Counting on Finite Structures. In Computer Science Logic, 6th Workshop, CSL '92, San Miniato 1992, Selected Papers, Vol. 702. Springer, San Miniato, Italy, 231--247."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del and W. Pakusa. 2019. Rank logic is dead long live rank logic! The Journal of Symbolic Logic 84 1 (2019) 54--87.  E. Gr\u00e4del and W. Pakusa. 2019. Rank logic is dead long live rank logic! The Journal of Symbolic Logic 84 1 (2019) 54--87.","DOI":"10.1017\/jsl.2018.33"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.11"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275675"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756144"},{"key":"e_1_3_2_1_32_1","volume-title":"A shorter model theory","author":"Hodges W.","unstructured":"W. Hodges . 1997. A shorter model theory . Cambridge university press , Cambridge, United Kingdom. W. Hodges. 1997. A shorter model theory. Cambridge university press, Cambridge, United Kingdom."},{"key":"e_1_3_2_1_33_1","first-page":"229","article-title":"Homomorphism and Embedding Universal Structures for Restricted Classes","volume":"27","author":"Hubi\u010dka J.","year":"2016","unstructured":"J. Hubi\u010dka and J. Ne\u0161et\u0159il . 2016 . Homomorphism and Embedding Universal Structures for Restricted Classes . Journal of Multiple-Valued Logic & Soft Computing 27 (2016), 229 -- 253 . Available at arXiv:0909.4939. J. Hubi\u010dka and J. Ne\u0161et\u0159il. 2016. Homomorphism and Embedding Universal Structures for Restricted Classes. Journal of Multiple-Valued Logic & Soft Computing 27 (2016), 229--253. Available at arXiv:0909.4939.","journal-title":"Journal of Multiple-Valued Logic & Soft Computing"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-005-0503-1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"M. Kozik A. Krokhin M. Valeriote and R. Willard. 2015. Characterizations of several Maltsev conditions. Algebra universalis 73 3-4 (2015) 205--224.  M. Kozik A. Krokhin M. Valeriote and R. Willard. 2015. Characterizations of several Maltsev conditions. Algebra universalis 73 3-4 (2015) 205--224.","DOI":"10.1007\/s00012-015-0327-2"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.02.001"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"B. Larose and L. Z\u00e1dori. 2007. Bounded width problems and algebras. Algebra universalis 56 3-4 (2007) 439--466.  B. Larose and L. Z\u00e1dori. 2007. Bounded width problems and algebras. Algebra universalis 56 3-4 (2007) 439--466.","DOI":"10.1007\/s00012-007-2012-6"},{"key":"e_1_3_2_1_38_1","volume-title":"Elements of finite model theory","author":"Libkin L.","unstructured":"L. Libkin . 2013. Elements of finite model theory . Springer , Berlin, Heidelberg , New York. L. Libkin. 2013. Elements of finite model theory. Springer, Berlin, Heidelberg, New York."},{"key":"e_1_3_2_1_39_1","volume-title":"Existence theorems for weakly symmetric operations. Algebra universalis 59, 3","author":"Mar\u00f3ti M.","year":"2008","unstructured":"M. Mar\u00f3ti and R. McKenzie . 2008. Existence theorems for weakly symmetric operations. Algebra universalis 59, 3 ( 2008 ), 463--489. M. Mar\u00f3ti and R. McKenzie. 2008. Existence theorems for weakly symmetric operations. Algebra universalis 59, 3 (2008), 463--489."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200848"},{"key":"e_1_3_2_1_41_1","unstructured":"M. Ol\u0161\u00e1k. 2018. Maltsev conditions for general congruence meet-semidistributive algebras. (2018). Available at arXiv:1810.03178.  M. Ol\u0161\u00e1k. 2018. Maltsev conditions for general congruence meet-semidistributive algebras. (2018). Available at arXiv:1810.03178."},{"key":"e_1_3_2_1_43_1","volume-title":"Bounded Variable Logics and Counting. A Study in Finite Model Theory","author":"Otto M.","unstructured":"M. Otto . 2000. Bounded Variable Logics and Counting. A Study in Finite Model Theory . Springer, Berlin , Heidelberg, New York. M. Otto. 2000. Bounded Variable Logics and Counting. A Study in Finite Model Theory. Springer, Berlin, Heidelberg, New York."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Saarbr\u00fccken Germany","acronym":"LICS '20","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:02:35Z","timestamp":1750183355000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":42,"alternative-id":["10.1145\/3373718.3394750","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394750","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}