{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:39:56Z","timestamp":1769733596974,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":26,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533335","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The Pebble-Relation Comonad in Finite Model Theory"],"prefix":"10.1145","author":[{"given":"Yo\u00e0v","family":"Montacute","sequence":"first","affiliation":[{"name":"University of Cambridge, United Kingdom"}]},{"given":"Nihil","family":"Shah","sequence":"additional","affiliation":[{"name":"University of Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005129"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470594"},{"key":"e_1_3_2_1_3_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0198)","author":"Abramsky Samson","year":"2021","unstructured":"Samson Abramsky and Luca Reggio . 2021 . Arboreal Categories and Resources. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0198) , Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 115:1\u2013115:20. Samson Abramsky and Luca Reggio. 2021. Arboreal Categories and Resources. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0198), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 115:1\u2013115:20."},{"key":"e_1_3_2_1_4_1","volume-title":"Relating Structure and Power: Comonadic Semantics for Computational Resources. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018","author":"Abramsky Samson","year":"2018","unstructured":"Samson Abramsky and Nihil Shah . 2018 . Relating Structure and Power: Comonadic Semantics for Computational Resources. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018 , September 4-7, 2018, Birmingham, UK. 2:1\u20132:17. Samson Abramsky and Nihil Shah. 2018. Relating Structure and Power: Comonadic Semantics for Computational Resources. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK. 2:1\u20132:17."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exab048"},{"key":"e_1_3_2_1_6_1","volume-title":"Monads need not be endofunctors. Logical Methods in Computer Science 11, 1","author":"Altenkirch Thosten","year":"2014","unstructured":"Thosten Altenkirch , James Chapman , and Tarmo Uustalu . 2014. Monads need not be endofunctors. Logical Methods in Computer Science 11, 1 ( 2014 ). Thosten Altenkirch, James Chapman, and Tarmo Uustalu. 2014. Monads need not be endofunctors. Logical Methods in Computer Science 11, 1 (2014)."},{"key":"e_1_3_2_1_7_1","volume-title":"Game Comonads & Generalised Quantifiers. In 29th EACSL Annual Conference on Computer Science Logic (CSL","author":"Conghaile Adam\u00a0\u00d3","year":"2021","unstructured":"Adam\u00a0\u00d3 Conghaile and Anuj Dawar . 2021 . Game Comonads & Generalised Quantifiers. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Adam\u00a0\u00d3 Conghaile and Anuj Dawar. 2021. Game Comonads & Generalised Quantifiers. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-1(1:5)2005"},{"key":"e_1_3_2_1_9_1","volume-title":"Lov\u00e1sz-Type Theorems and Game Comonads. In 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE.","author":"Dawar Anuj","year":"2021","unstructured":"Anuj Dawar , Tomas Jakl , and Luca Reggio . 2021 . Lov\u00e1sz-Type Theorems and Game Comonads. In 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE. Anuj Dawar, Tomas Jakl, and Luca Reggio. 2021. Lov\u00e1sz-Type Theorems and Game Comonads. In 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE."},{"key":"e_1_3_2_1_10_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","author":"Dell Holger","year":"2018","unstructured":"Holger Dell , Martin Grohe , and Gaurav Rattan . 2018 . Lov\u00e1sz Meets Weisfeiler and Leman. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9-13, 2018, Prague, Czech Republic(LIPIcs, Vol.\u00a0107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 40:1\u201340:14. Holger Dell, Martin Grohe, and Gaurav Rattan. 2018. Lov\u00e1sz Meets Weisfeiler and Leman. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic(LIPIcs, Vol.\u00a0107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 40:1\u201340:14."},{"key":"e_1_3_2_1_11_1","first-page":"4","article-title":"On recognizing graphs by numbers of homomorphisms","volume":"64","author":"Dvo\u0159\u00e1k Zden\u011bk","year":"2009","unstructured":"Zden\u011bk Dvo\u0159\u00e1k . 2009 . On recognizing graphs by numbers of homomorphisms . Journal of Graph Theory 64 , 4 (Nov. 2009), 330\u2013342. Zden\u011bk Dvo\u0159\u00e1k. 2009. On recognizing graphs by numbers of homomorphisms. Journal of Graph Theory 64, 4 (Nov. 2009), 330\u2013342.","journal-title":"Journal of Graph Theory"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Martin Grohe. 2017. Descriptive Complexity Canonisation and Definable Graph Structure Theory. Cambridge University Press.  Martin Grohe. 2017. Descriptive Complexity Canonisation and Definable Graph Structure Theory. Cambridge University Press.","DOI":"10.1017\/9781139028868"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394739"},{"key":"e_1_3_2_1_15_1","volume-title":"Homomorphism Tensors and Linear Equations. To appear in 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP","author":"Grohe Martin","year":"2022","unstructured":"Martin Grohe , Gaurav Rattan , and Tim Seppelt . 2022. Homomorphism Tensors and Linear Equations. To appear in 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022 ). Martin Grohe, Gaurav Rattan, and Tim Seppelt. 2022. Homomorphism Tensors and Linear Equations. To appear in 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90011-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298542"},{"key":"e_1_3_2_1_20_1","volume-title":"Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)","author":"Libkin Leonid","unstructured":"Leonid Libkin . 2004. Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series) . Springer . Leonid Libkin. 2004. Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280291"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00067"},{"key":"e_1_3_2_1_23_1","volume-title":"Algebraic Theories","author":"Manes G.","unstructured":"Ernest\u00a0 G. Manes . 1976. Algebraic Theories . Springer New York . Ernest\u00a0G. Manes. 1976. Algebraic Theories. Springer New York."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2020.09.010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02771574"},{"key":"e_1_3_2_1_27_1","first-page":"12","article-title":"The reduction of a graph to canonical form and the algebra which appears therein. NTI","volume":"2","author":"Weisfeiler Boris","year":"1968","unstructured":"Boris Weisfeiler and Andrei Leman . 1968 . The reduction of a graph to canonical form and the algebra which appears therein. NTI , Series 2 , 9 (1968), 12 \u2013 16 . Boris Weisfeiler and Andrei Leman. 1968. The reduction of a graph to canonical form and the algebra which appears therein. NTI, Series 2, 9 (1968), 12\u201316.","journal-title":"Series"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Haifa Israel","acronym":"LICS '22","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"]},"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.3533335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":26,"alternative-id":["10.1145\/3531130.3533335","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533335","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"}}]}}