{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:54:40Z","timestamp":1776214480841,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005129","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-12","source":"Crossref","is-referenced-by-count":20,"title":["The pebbling comonad in Finite Model Theory"],"prefix":"10.1109","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengming","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"135","article-title":"The essence of dataflow programming","author":"uustalu","year":"2005","journal-title":"Central European Functional Programming School"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.05.029"},{"key":"ref31","author":"urbat","year":"2016","journal-title":"One Eilenberg theorem to rule them all"},{"key":"ref30","first-page":"1","article-title":"Recognisable languages over monads","author":"bojariczyk","year":"2015","journal-title":"Conference on Developments in Language Theory"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379763"},{"key":"ref36","author":"nesetril","year":"2013","journal-title":"A unified approach to structural limits and limits of graphs with bounded tree-depth"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06025-5_1"},{"key":"ref34","article-title":"Programming contextual computations","author":"orchard","year":"2014","journal-title":"University of Cambridge Computer Laboratory Technical Report no UCAM-CL-TR-854"},{"key":"ref10","article-title":"A taste of category theory for computer scientists","author":"pierce","year":"1988","journal-title":"Tech Rep"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12821-9_1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1965-0177024-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1131342.1131344"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90011-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume":"842","author":"kloks","year":"1994","journal-title":"Treewidth Computations and Approximations ser Lecture Notes in Computer Science"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90282-K"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"ref4","author":"abiteboul","year":"1995","journal-title":"Foundations of Databases The Logical Level"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.049"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298542"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005291931660"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275511"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525902.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59451-5_2"},{"key":"ref1","author":"libkin","year":"2013","journal-title":"Elements of Finite Model Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46135-3_21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/11\/113036"},{"key":"ref21","first-page":"175","article-title":"A game-theoretic approach to constraint satisfaction","author":"kolaitis","year":"2000","journal-title":"AAAlllAAI"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.65.3373"},{"key":"ref23","first-page":"59","article-title":"The problem of hidden variables in quantummechanics","volume":"17","author":"kochen","year":"1967","journal-title":"J Math Mech"},{"key":"ref26","first-page":"440","article-title":"Robust constraint satisfaction and local hidden variables in quantummechanics","volume":"13","author":"abramsky","year":"2013","journal-title":"IJCAI"},{"key":"ref25","first-page":"211","article-title":"Contextuality, cohomology and paradox","volume":"41","author":"abramsky","year":"2015","journal-title":"24th EACSL Annual Conference on Computer Science Logic (CSL 2015) ser Leibniz International Proceedings in Informatics (LIPIcs)"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005129.pdf?arnumber=8005129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T03:39:48Z","timestamp":1569987588000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005129","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}