{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:36:41Z","timestamp":1773160601649,"version":"3.50.1"},"reference-count":105,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:p>In this short survey, we present logical formalisms in which reasoning about concrete domains is embedded in formulae at the atomic level. These include temporal logics with concrete domains, description logics with concrete domains as well as variant formalisms. We discuss several proof techniques to solve logical decision problems for such formalisms, including those based on constrained automata or on translation into decidable second-order logics. We also present recent results mainly related to decidability and complexity as well as a selection of open problems.<\/jats:p>","DOI":"10.1145\/3477986.3477988","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T13:28:01Z","timestamp":1627478881000},"page":"6-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Concrete domains in logics"],"prefix":"10.1145","volume":"8","author":[{"given":"St\u00e9phane","family":"Demri","sequence":"first","affiliation":[{"name":"CNRS, LMF, ENS Paris-Saclay, Universit\u00e9 Paris-Saclay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karin","family":"Quaas","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/2695090"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54458-7_12"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/227595.227602"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1025"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174651"},{"key":"e_1_2_1_7_1","first-page":"481","volume-title":"FST&TCS'10","author":"Kara Th.","year":"2010","unstructured":"Th. Zeume A. Kara , Th. Schwentick . Temporal logics on words with multiple data values . In FST&TCS'10 , pages 481 - 492 . LZI, 2010 . Th. Zeume A. Kara, Th. Schwentick. Temporal logics on words with multiple data values. In FST&TCS'10, pages 481-492. LZI, 2010."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/182.358434"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00596-1_30"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646821.706727"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.17"},{"key":"e_1_2_1_12_1","volume-title":"Boundedness in languages of infinite words. Logical Methods in Computer Science, 13(4:3):1-54","author":"Boja\u0144czyk M.","year":"2017","unstructured":"M. Boja\u0144czyk and Th. Colcombet . Boundedness in languages of infinite words. Logical Methods in Computer Science, 13(4:3):1-54 , 2017 . M. Boja\u0144czyk and Th. Colcombet. Boundedness in languages of infinite words. Logical Methods in Computer Science, 13(4:3):1-54, 2017."},{"key":"e_1_2_1_13_1","volume-title":"Undecidability of a weak version of MSO+U. Logical Methods in Computer Science, 16(1)","author":"Boja\u0144czyk M.","year":"2020","unstructured":"M. Boja\u0144czyk , L. Daviaud , B. Guillon , V. Penelle , and A.V. Sreejith . Undecidability of a weak version of MSO+U. Logical Methods in Computer Science, 16(1) , 2020 . M. Boja\u0144czyk, L. Daviaud, B. Guillon, V. Penelle, and A.V. Sreejith. Undecidability of a weak version of MSO+U. Logical Methods in Computer Science, 16(1), 2020."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2009.07.004"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/788017.788754"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11916277_14"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1631171.1631239"},{"key":"e_1_2_1_19_1","volume-title":"LTL with Local and Remote Data. Master's thesis","author":"Bhaskar A.","year":"2020","unstructured":"A. Bhaskar . LTL with Local and Remote Data. Master's thesis , Chennai Mathematical Institute , 2020 . A. Bhaskar. LTL with Local and Remote Data. Master's thesis, Chennai Mathematical Institute, 2020."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3154062"},{"key":"e_1_2_1_21_1","volume-title":"Version on","author":"Bodirsky M.","year":"2020","unstructured":"M. Bodirsky . Complexity of Infinite-Domain Constraint Satisfaction. 2020 . Version on Dec. 16, 2020 available on the author's web page. M. Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction. 2020. Version on Dec. 16, 2020 available on the author's web page."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30124-0_7"},{"key":"e_1_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-662-43951-7_4","volume-title":"ICALP'14","author":"Boja\u0144czyk M.","year":"2014","unstructured":"M. Boja\u0144czyk . Weak MSO+U with path quantifiers over infinite trees. In ICALP'14 , volume 8573 of Lecture Notes in Computer Science , pages 38 - 49 . Springer , 2014 . M. Boja\u0144czyk. Weak MSO+U with path quantifiers over infinite trees. In ICALP'14, volume 8573 of Lecture Notes in Computer Science, pages 38-49. Springer, 2014."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00229-6"},{"key":"e_1_2_1_25_1","series-title":"LIPIcs","first-page":"1","volume-title":"STACS'16","author":"Boja\u0144czyk M.","year":"2016","unstructured":"M. Boja\u0144czyk , P. Parys , and S. Toru\u0144czyk . The MSO+U theory of (N, &lt;) is undecidable . In STACS'16 , volume 47 of LIPIcs , pages 21: 1 - 21 :8. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2016 . M. Boja\u0144czyk, P. Parys, and S. Toru\u0144czyk. The MSO+U theory of (N, &lt;) is undecidable. In STACS'16, volume 47 of LIPIcs, pages 21:1-21:8. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2016."},{"key":"e_1_2_1_26_1","volume-title":"The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3)","author":"Bollig B.","year":"2019","unstructured":"B. Bollig , K. Quaas , and A. Sangnier . The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3) , 2019 . B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3), 2019."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51074-9_24"},{"key":"e_1_2_1_28_1","first-page":"648","volume-title":"STACS'12","author":"Boja\u0144czyk M.","year":"2012","unstructured":"M. Boja\u0144czyk and S. Toru\u0144czyk . Weak MSO+U over infinite trees . In STACS'12 , LIPIcs, pages 648 - 660 , 2012 . M. Boja\u0144czyk and S. Toru\u0144czyk. Weak MSO+U over infinite trees. In STACS'12, LIPIcs, pages 648-660, 2012."},{"key":"e_1_2_1_29_1","volume-title":"Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, (6):66-92","author":"B\u00fcchi J.R.","year":"1960","unstructured":"J.R. B\u00fcchi . Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, (6):66-92 , 1960 . J.R. B\u00fcchi. Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, (6):66-92, 1960."},{"key":"e_1_2_1_30_1","first-page":"1","volume-title":"International Congress on Logic, Method and Philosophical Science'60","author":"B\u00fcchi J.R.","year":"1962","unstructured":"J.R. B\u00fcchi . On a decision method in restricted second-order arithmetic . In International Congress on Logic, Method and Philosophical Science'60 , pages 1 - 11 , 1962 . J.R. B\u00fcchi. On a decision method in restricted second-order arithmetic. In International Congress on Logic, Method and Philosophical Science'60, pages 1-11, 1962."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292048.3292050"},{"key":"e_1_2_1_33_1","volume-title":"Leipzig University","author":"Carapelle C.","year":"2015","unstructured":"C. Carapelle . On the satisfiability of temporal logics with concrete domains. PhD thesis , Leipzig University , 2015 . C. Carapelle. On the satisfiability of temporal logics with concrete domains. PhD thesis, Leipzig University, 2015."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/647850.737218"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/3461017.3461064"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646248.685205"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9724-y"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_32"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.02.002"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-672-9-1440"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.09.006"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exv028"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90043-W"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.02.019"},{"key":"e_1_2_1_45_1","volume-title":"Reasoning about data repetitions with counter systems. Logical Methods in Computer Science, 12(3)","author":"Demri S.","year":"2016","unstructured":"S. Demri , D. Figueira , and M. Praveen . Reasoning about data repetitions with counter systems. Logical Methods in Computer Science, 12(3) , 2016 . S. Demri, D. Figueira, and M. Praveen. Reasoning about data repetitions with counter systems. Logical Methods in Computer Science, 12(3), 2016."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.023"},{"key":"e_1_2_1_47_1","unstructured":"N. Decker P. Habermehl M. Leucker and D. Thoma. Ordered navigation on multi-attributed data words. In  N. Decker P. Habermehl M. Leucker and D. Thoma. Ordered navigation on multi-attributed data words. In"},{"key":"e_1_2_1_48_1","unstructured":"CONCUR'14 volume \n  8704\n   of \n  Lecture Notes in Computer Science pages \n  497\n  -\n  511 2014\n  .  CONCUR'14 volume 8704 of Lecture Notes in Computer Science pages 497-511 2014."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514924"},{"key":"e_1_2_1_50_1","first-page":"252","volume-title":"ACM International Conference Proceeding Series","year":"2009","unstructured":"ICDT'09, volume 361 of ACM International Conference Proceeding Series , pages 252 - 267 . ACM, 2009 . ICDT'09, volume 361 of ACM International Conference Proceeding Series, pages 252-267. ACM, 2009."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694428.2694430"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507244.1507246"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2005.28"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Information and Computation 205(1):2-24 2007.  Information and Computation 205(1):2-24 2007.","DOI":"10.1016\/j.ic.2006.08.003"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.021"},{"key":"e_1_2_1_56_1","volume-title":"Synthesis of data word transducers. Logical Methods in Computer Science, 17(1)","author":"Exibard L.","year":"2021","unstructured":"L. Exibard , E. Filiot , and P.-A. Reynier . Synthesis of data word transducers. Logical Methods in Computer Science, 17(1) , 2021 . L. Exibard, E. Filiot, and P.-A. Reynier. Synthesis of data word transducers. Logical Methods in Computer Science, 17(1), 2021."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269808"},{"key":"e_1_2_1_58_1","volume-title":"Volume III: Interfaces and Applications of AI","author":"Fages F.","year":"2020","unstructured":"F. Fages . A Guided Tour of Artificial Intelligence Research , Volume III: Interfaces and Applications of AI , chapter Artificial Intelligence in Biological Modeling. Springer , 2020 . F. Fages. A Guided Tour of Artificial Intelligence Research, Volume III: Interfaces and Applications of AI, chapter Artificial Intelligence in Biological Modeling. Springer, 2020."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/12.6.1017"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.29007\/wpg3"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1_5"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788994.1789023"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_29"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.05.040"},{"key":"e_1_2_1_67_1","volume-title":"Journal of Logic, Language, and Information, 5:1-24","author":"Goranko V.","year":"1996","unstructured":"V. Goranko . Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information, 5:1-24 , 1996 . V. Goranko. Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information, 5:1-24, 1996."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90136-3"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242953.3242964"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.5555\/3329995.3330076"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-012-0111-x"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929954.1929956"},{"key":"e_1_2_1_73_1","volume-title":"Universit\u00e4t Dortmund","author":"Kara A.","year":"2016","unstructured":"A. Kara . Logics on Data Words. PhD thesis , Universit\u00e4t Dortmund , 2016 . A. Kara. Logics on Data Words. PhD thesis, Universit\u00e4t Dortmund, 2016."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94205-6_30"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90161-A"},{"key":"e_1_2_1_76_1","series-title":"LIPIcs","first-page":"84","volume-title":"FST&TCS'15","author":"Karandikar P.","year":"2015","unstructured":"P. Karandikar and Ph. Schnoebelen . Decidability in the logic of subsequences and supersequences . In FST&TCS'15 , volume 45 of LIPIcs , pages 84 - 97 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2015 . P. Karandikar and Ph. Schnoebelen. Decidability in the logic of subsequences and supersequences. In FST&TCS'15, volume 45 of LIPIcs, pages 84-97. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2015."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005039"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333987"},{"key":"e_1_2_1_79_1","volume-title":"Model checking constraint LTL over trees. CoRR, abs\/1504.06105","author":"Kartzow A.","year":"2015","unstructured":"A. Kartzow and Th. Weidner . Model checking constraint LTL over trees. CoRR, abs\/1504.06105 , 2015 . A. Kartzow and Th. Weidner. Model checking constraint LTL over trees. CoRR, abs\/1504.06105, 2015."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877714.1877716"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9049-7"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/61"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2005.34"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.5555\/1642090.1642102"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.5555\/3087093.3087110"},{"key":"e_1_2_1_87_1","first-page":"265","volume-title":"Advances in Modal Logics","author":"Lutz C.","year":"2003","unstructured":"C. Lutz . Description logics with concrete domains---a survey. In Advances in Modal Logics Volume 4 , pages 265 - 296 . King's College Publications , 2003 . C. Lutz. Description logics with concrete domains---a survey. In Advances in Modal Logics Volume 4, pages 265-296. King's College Publications, 2003."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.08.001"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024922.1024925"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90021-1"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990312"},{"key":"e_1_2_1_94_1","first-page":"92","volume-title":"Warszawa","author":"Presburger M.","year":"1929","unstructured":"M. Presburger . \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du premier congr\u00e8s de math\u00e9maticiens des Pays Slaves , Warszawa , pages 92 - 101 , 1929 . M. Presburger. \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du premier congr\u00e8s de math\u00e9maticiens des Pays Slaves, Warszawa, pages 92-101, 1929."},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268308"},{"key":"e_1_2_1_96_1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"1","author":"Rabin M. O.","year":"1969","unstructured":"M. O. Rabin . Decidability of second-order theories and automata on infinite trees . Transactions of the AMS, (141) : 1-23 , 1969 . M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the AMS, (141):1-23, 1969.","journal-title":"Transactions of the AMS, (141)"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.5555\/509046"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473714.3473837"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.5555\/1631171.1631241"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211865"},{"key":"e_1_2_1_101_1","first-page":"81","volume-title":"STACS'11","author":"Segoufin L.","year":"2011","unstructured":"L. Segoufin and S. Toru\u0144czyk . Automata based verification over linearly ordered data domains . In STACS'11 , pages 81 - 92 , 2011 . L. Segoufin and S. Toru\u0144czyk. Automata based verification over linearly ordered data domains. In STACS'11, pages 81-92, 2011."},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.5555\/114891.114895"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/11.1.85"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/MODELS-C.2019.00103"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1092"},{"key":"e_1_2_1_106_1","first-page":"629","volume-title":"Logic and Automata: History and Perspectives, number 2 in Texts in Logic and Games","author":"Vardi M.","year":"2007","unstructured":"M. Vardi and Th. Wilke . Automata: from logics to algorithms . In Logic and Automata: History and Perspectives, number 2 in Texts in Logic and Games , pages 629 - 736 . Amsterdam University Press , 2007 . M. Vardi and Th. Wilke. Automata: from logics to algorithms. In Logic and Automata: History and Perspectives, number 2 in Texts in Logic and Games, pages 629-736. Amsterdam University Press, 2007."},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.5555\/3087011.3087013"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.38"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477986.3477988","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477986.3477988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:38Z","timestamp":1750183838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477986.3477988"}},"subtitle":["a survey"],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":105,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10.1145\/3477986.3477988"],"URL":"https:\/\/doi.org\/10.1145\/3477986.3477988","relation":{},"ISSN":["2372-3491"],"issn-type":[{"value":"2372-3491","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"2021-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}