{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658833,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394767","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"479-491","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Successor-Invariant First-Order Logic on Classes of Bounded Degree"],"prefix":"10.1145","author":[{"given":"Julien","family":"Grange","sequence":"first","affiliation":[{"name":"ENS Paris, PSL, INRIA, CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume":"200","author":"Benedikt Michael","unstructured":"Michael Benedikt and Luc Segoufin . Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. , 200 9. Michael Benedikt and Luc Segoufin. Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log., 2009.","journal-title":"J. Symb. Log."},{"key":"e_1_3_2_1_2_1","volume-title":"Mathematical Foundations of Computer Science (MFCS) -39th International Symposium","author":"Eickmeyer Kord","year":"2014","unstructured":"Kord Eickmeyer , Michael Elberfeld , and Frederik Harwath . Expressivity and succinctness of order-invariant logics on depth-bounded structures . In Mathematical Foundations of Computer Science (MFCS) -39th International Symposium , 2014 . Kord Eickmeyer, Michael Elberfeld, and Frederik Harwath. Expressivity and succinctness of order-invariant logics on depth-bounded structures. In Mathematical Foundations of Computer Science (MFCS) -39th International Symposium, 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934517"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1100"},{"key":"e_1_3_2_1_5_1","volume-title":"CoRR","author":"Gajarsk\u00fd Jakub","year":"2018","unstructured":"Jakub Gajarsk\u00fd , Petr Hlinen\u00fd , Daniel Lokshtanov , Jan Obdrz\u00e1lek , and M.S. Ramanujan . A new perspective on FO model checking of dense graph classes . CoRR , 2018 . Jakub Gajarsk\u00fd, Petr Hlinen\u00fd, Daniel Lokshtanov, Jan Obdrz\u00e1lek, and M.S. Ramanujan. A new perspective on FO model checking of dense graph classes. CoRR, 2018."},{"key":"e_1_3_2_1_6_1","volume-title":"28th EACSL Annual Conference on Computer Science Logic (CSL 2020","author":"Grange Julien","year":"2020","unstructured":"Julien Grange and Luc Segoufin . Order-Invariant First-Order Logic over Hollow Trees . In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020 ). Schloss Dagstuhl , 2020 . Julien Grange and Luc Segoufin. Order-Invariant First-Order Logic over Hollow Trees. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Schloss Dagstuhl, 2020."},{"key":"e_1_3_2_1_7_1","volume":"200","author":"Grohe Martin","unstructured":"Martin Grohe and Thomas Schwentick . Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. , 200 0. Martin Grohe and Thomas Schwentick. Locality of order-invariant first-order formulas. ACM Trans. Comput. Log., 2000.","journal-title":"ACM Trans. Comput. Log."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_9_1","volume":"200","author":"Rossman Benjamin","unstructured":"Benjamin Rossman . Successor-invariant first-order logic on finite structures. J. Symb. Log. , 200 7. Benjamin Rossman. Successor-invariant first-order logic on finite structures. J. Symb. Log., 2007.","journal-title":"J. Symb. Log."},{"key":"e_1_3_2_1_10_1","volume-title":"Doklady Akademii Nauk SSSR","author":"Trakhtenbrot Boris A","year":"1950","unstructured":"Boris A Trakhtenbrot . Impossibility of an algorithm for the decision problem in finite classes . Doklady Akademii Nauk SSSR , 1950 . Boris A Trakhtenbrot. Impossibility of an algorithm for the decision problem in finite classes. Doklady Akademii Nauk SSSR, 1950."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"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.3394767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":10,"alternative-id":["10.1145\/3373718.3394767","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394767","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"}}]}}