{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:55Z","timestamp":1730280715886,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785811","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Learning Concepts Definable in First-Order Logic with Counting"],"prefix":"10.1109","author":[{"given":"Steffen","family":"van Bergerem","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Inductive logic programming","volume":"38","author":"muggleton","year":"1992","journal-title":"Inductive Logic Programming"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465220"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2818637"},{"key":"ref14","article-title":"Elements of Finite Model Theory","author":"libkin","year":"2004","journal-title":"Texts in Theoretical Computer Science An EATCS Series"},{"key":"ref15","article-title":"Descriptive Complexity, Canonisation, and Definable Graph Structure Theory","author":"grohe","year":"2017","journal-title":"Lecture Notes in Logic"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502100"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4064\/fm-47-1-57-103"},{"key":"ref18","first-page":"41","article-title":"Lower bounds based on the exponential time hypothesis","volume":"105","author":"lokshtanov","year":"2011","journal-title":"Bulletin of the EATCS"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196970"},{"key":"ref3","article-title":"First-order logic with counting: At least, weak hanf normal forms always exist and can be computed!","volume":"abs 1703 1122","author":"kuske","year":"2017","journal-title":"CoRR"},{"key":"ref6","first-page":"434","article-title":"Learning MSO-definable hypotheses on strings","volume":"76","author":"grohe","year":"2017","journal-title":"International Conference on Algorithmic Learning Theory ALT 2017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/181668.181674"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037231"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005080"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1112-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037089"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785811.pdf?arnumber=8785811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785811","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}