{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:19:00Z","timestamp":1760080740804,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0014, ANR-19-CE48-0013"],"award-info":[{"award-number":["ANR-21-CE48-0014, ANR-19-CE48-0013"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["444419611"],"award-info":[{"award-number":["444419611"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["948057, 683080"],"award-info":[{"award-number":["948057, 683080"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533367","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Model Checking on Interpretations of Classes of Bounded Local Cliquewidth"],"prefix":"10.1145","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[{"name":"Univ Lyon, CNRS, ENS de Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Dreier","sequence":"additional","affiliation":[{"name":"TU Wien, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Gajarsk\u00fd","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolas","family":"M\u00e4hlmann","sequence":"additional","affiliation":[{"name":"University of Bremen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Simon","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Toru\u0144czyk","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.06.048"},{"key":"e_1_3_2_1_2_1","volume-title":"Second-order quantifiers and the complexity of theories. Notre Dame Journal of Formal Logic 29 (07","author":"Baldwin John","year":"1985","unstructured":"John Baldwin and Saharon Shelah . 1985. Second-order quantifiers and the complexity of theories. Notre Dame Journal of Formal Logic 29 (07 1985 ). https:\/\/doi.org\/10.1305\/ndjfl\/1093870870 10.1305\/ndjfl John Baldwin and Saharon Shelah. 1985. Second-order quantifiers and the complexity of theories. Notre Dame Journal of Formal Logic 29 (07 1985). https:\/\/doi.org\/10.1305\/ndjfl\/1093870870"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1149037.1709615"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.118"},{"key":"e_1_3_2_1_5_1","article-title":"Twin-Width I: Tractable FO Model Checking","volume":"69","author":"Bonnet \u00c9douard","year":"2021","unstructured":"\u00c9douard Bonnet , Eun\u00a0Jung Kim , St\u00e9phan Thomass\u00e9 , and R\u00e9mi Watrigant . 2021 b. Twin-Width I: Tractable FO Model Checking . J. ACM 69 , 1, Article 3 (nov 2021), 46\u00a0pages. https:\/\/doi.org\/10.1145\/3486655 10.1145\/3486655 \u00c9douard Bonnet, Eun\u00a0Jung Kim, St\u00e9phan Thomass\u00e9, and R\u00e9mi Watrigant. 2021b. Twin-Width I: Tractable FO Model Checking. J. ACM 69, 1, Article 3 (nov 2021), 46\u00a0pages. https:\/\/doi.org\/10.1145\/3486655","journal-title":"J. ACM"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"volume-title":"Vol.\u00a0138","author":"Courcelle Bruno","key":"e_1_3_2_1_7_1","unstructured":"Bruno Courcelle and Joost Engelfriet . 2012. Graph Structure and Monadic Second-Order Logic: a Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications , Vol.\u00a0138 . Cambridge University Press . Bruno Courcelle and Joost Engelfriet. 2012. Graph Structure and Monadic Second-Order Logic: a Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications, Vol.\u00a0138. Cambridge University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002249910009"},{"volume-title":"LICS\u201907","author":"Dawar Anuj","key":"e_1_3_2_1_9_1","unstructured":"Anuj Dawar , Martin Grohe , and Stephan Kreutzer . 2007. Locally Excluding a Minor . In LICS\u201907 . IEEE Computer Society , 270\u2013279. Anuj Dawar, Martin Grohe, and Stephan Kreutzer. 2007. Locally Excluding a Minor. In LICS\u201907. IEEE Computer Society, 270\u2013279."},{"key":"e_1_3_2_1_10_1","volume-title":"Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021","author":"Dreier Jan","year":"2021","unstructured":"Jan Dreier . 2021 . Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021 , Rome, Italy, June 29 - July 2, 2021. IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470680 10.1109\/LICS52264.2021.9470680 Jan Dreier. 2021. Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470680"},{"volume-title":"FOCS\u201910","author":"Dvo\u0159\u00e1k Zdenek","key":"e_1_3_2_1_11_1","unstructured":"Zdenek Dvo\u0159\u00e1k , Daniel Kr\u00e1\u013e , and Robin Thomas . 2010. Deciding First-Order Properties for Sparse Graphs . In FOCS\u201910 . IEEE Computer Society , 133\u2013142. Zdenek Dvo\u0159\u00e1k, Daniel Kr\u00e1\u013e, and Robin Thomas. 2010. Deciding First-Order Properties for Sparse Graphs. In FOCS\u201910. IEEE Computer Society, 133\u2013142."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799360768"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"e_1_3_2_1_15_1","unstructured":"Jakub Gajarsk\u00fd Maximilian Gorsky and Stephan Kreutzer. 2020. Differential games locality and model checking for FO logic of graphs. arXiv preprint arXiv:2007.11345(2020).  Jakub Gajarsk\u00fd Maximilian Gorsky and Stephan Kreutzer. 2020. Differential games locality and model checking for FO logic of graphs. arXiv preprint arXiv:2007.11345(2020)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383206"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382093"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.005"},{"key":"e_1_3_2_1_19_1","first-page":"44","article-title":"Logic, Graphs, and Algorithms","volume":"14","author":"Grohe Martin","year":"2007","unstructured":"Martin Grohe . 2007 . Logic, Graphs, and Algorithms . Electronic Colloquium on Computational Complexity (ECCC) 14 , 091(2007), 44 . Martin Grohe. 2007. Logic, Graphs, and Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 14, 091(2007), 44.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051095"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1112-8"},{"volume-title":"Finite and Algorithmic Model Theory.","author":"Kreutzer Stephan","key":"e_1_3_2_1_22_1","unstructured":"Stephan Kreutzer . 2011. Algorithmic meta-theorems . In Finite and Algorithmic Model Theory. London Math . Soc. Lecture Note Ser., Vol.\u00a0379. Oxford University Press , Chapter\u00a05, 177\u2013270. Stephan Kreutzer. 2011. Algorithmic meta-theorems. In Finite and Algorithmic Model Theory. London Math. Soc. Lecture Note Ser., Vol.\u00a0379. Oxford University Press, Chapter\u00a05, 177\u2013270."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.39"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3116665.3117059"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00023-9"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13","author":"Ne\u0161et\u0159il Jaroslav","year":"2021","unstructured":"Jaroslav Ne\u0161et\u0159il , Patrice\u00a0Ossona de Mendez , Michal Pilipczuk , Roman Rabinovich , and Sebastian Siebertz . 2021 b. Rankwidth meets stability . In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13 , 2021, D\u00e1niel Marx (Ed.). SIAM , 2014\u20132033. https:\/\/doi.org\/10.1137\/1.9781611976465.120 10.1137\/1.9781611976465.120 Jaroslav Ne\u0161et\u0159il, Patrice\u00a0Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz. 2021b. Rankwidth meets stability. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, D\u00e1niel Marx (Ed.). SIAM, 2014\u20132033. https:\/\/doi.org\/10.1137\/1.9781611976465.120"},{"key":"e_1_3_2_1_27_1","unstructured":"Jaroslav Ne\u0161et\u0159il Patrice\u00a0Ossona de Mendez and Sebastian Siebertz. 2021a. Structural properties of the first-order transduction quasiorder. arXiv preprint arXiv:2010.02607(2021).  Jaroslav Ne\u0161et\u0159il Patrice\u00a0Ossona de Mendez and Sebastian Siebertz. 2021a. Structural properties of the first-order transduction quasiorder. arXiv preprint arXiv:2010.02607(2021)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-100-2-101-107"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500070079"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(71)90015-5"},{"volume-title":"A Guide to NIP Theories","author":"Simon Pierre","key":"e_1_3_2_1_32_1","unstructured":"Pierre Simon . 2015. A Guide to NIP Theories . Cambridge University Press . https:\/\/doi.org\/10.1017\/CBO9781107415133 10.1017\/CBO9781107415133 Pierre Simon. 2015. A Guide to NIP Theories. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9781107415133"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":32,"alternative-id":["10.1145\/3531130.3533367","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533367","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}