{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T03:28:22Z","timestamp":1768793302326,"version":"3.49.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005082","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-11","source":"Crossref","is-referenced-by-count":3,"title":["Definability of summation problems for Abelian groups and semigroups"],"prefix":"10.1109","author":[{"given":"Faried Abu","family":"Zaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Gradel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wied","family":"Pakusa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(4:12)2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.24"},{"key":"ref12","author":"ebbinghaus","year":"2005","journal-title":"Finite Model Theory"},{"key":"ref13","author":"gradel","year":"2007","journal-title":"Finite Model Theory and Its Applications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2675"},{"key":"ref15","first-page":"231","article-title":"Inductive Definability with Counting on Finite Structures","author":"gradel","year":"1992","journal-title":"Computer Science Logic CSL 92 volume 702 of LNCS"},{"key":"ref16","article-title":"Rank logic is dead, long live rank logic!","author":"gradel","year":"2015","journal-title":"Computer Science Logic (CSL'15) Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.11"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371662"},{"key":"ref28","first-page":"43","article-title":"User-Defined Aggregates in Database Query Languages","author":"wang","year":"2000","journal-title":"DBPL 99"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1045861507"},{"key":"ref27","first-page":"72","author":"shelah","year":"2000","journal-title":"Choiceless Polynomial Time Logic Inability to Express"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.049"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(99)00005-6"},{"key":"ref5","article-title":"A Quick Update on the Open Problems in Blass-Gurevich-Shelah's article","author":"blass","year":"2005","journal-title":"On Polynomial Time Computations Over Unordered Structures"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1055686.1055691"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1190150152"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2822890"},{"key":"ref9","first-page":"8","article-title":"The Nature and Power of Fixed-point Logic with Counting","author":"dawar","year":"2015","journal-title":"ACM SIGLOG News"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44522-8_5"},{"key":"ref20","article-title":"L-Recursion and a new Logic for Logarithmic Space","volume":"9","author":"grohe","year":"2012","journal-title":"Logical Methods in Computer Science"},{"key":"ref22","author":"holm","year":"2010","journal-title":"Descriptive Complexity of Linear Algebra"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502100"},{"key":"ref24","author":"libkin","year":"2013","journal-title":"Elements of Finite Model Theory"},{"key":"ref23","author":"laubner","year":"2011","journal-title":"The structure of graphs and new logics for the characterization of polynomial time"},{"key":"ref26","author":"pakusa","year":"2016","journal-title":"Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2275602"}],"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\/08005082.pdf?arnumber=8005082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T23:44:54Z","timestamp":1503531894000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005082","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}