{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:28:23Z","timestamp":1729657703611,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005115","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion"],"prefix":"10.1109","author":[{"given":"Jan","family":"van den Heuvel","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Pilipczuk","sequence":"additional","affiliation":[]},{"given":"Daniel A.","family":"Quiroz","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Rabinovich","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Siebertz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.03.024"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2012.12.004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/B:ORDE.0000026489.93166.cb"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90161-0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195282550"},{"journal-title":"Parameterized Complexity Theory ser Texts in Theoretical Computer Science An EATCS Series","year":"2006","author":"flum","key":"ref35"},{"key":"ref34","first-page":"1","article-title":"Logic and the challenge of computer science","volume":"12","author":"gurevich","year":"1988","journal-title":"Trends in Theoretical Computer Science ser Principles Comput Sci Ser Computer Sci Press"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S0960129500070079","article-title":"Linear time computable problems and first-order descriptions","volume":"6","author":"seese","year":"1996","journal-title":"Math Structures Comput Sci"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.31"},{"key":"ref14","first-page":"36","article-title":"Testing first-order properties for subclasses of sparse graphs","volume":"60","author":"dvo?\u00e1k","year":"2013","journal-title":"J ACM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591851"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/558\/11051"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(4:11)2015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.63"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935314"},{"key":"ref28","first-page":"162","article-title":"Graph minors XVII. Taming a vortex","volume":"77","author":"roberton","year":"1999","journal-title":"J Combin Theory Ser B"},{"key":"ref4","first-page":"85:1","article-title":"The generalised colouring numbers on classes of bounded expansion","volume":"58","author":"kreutzer","year":"2016","journal-title":"MFCS 2016 ser LIPIcs"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44522-8_22"},{"key":"ref3","first-page":"18:1","article-title":"Successor-invariant first-order logic on graphs with excluded topological subgraphs","volume":"62","author":"eickmeyer","year":"2016","journal-title":"CSL 2016 ser LIPIcs"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"ref5","first-page":"137","article-title":"The complexity of relational query languages","author":"vardi","year":"1982","journal-title":"STOC 1982"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.39"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.19"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.30"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.38"},{"journal-title":"Logische Klassifizierung Regulärer Baumsprachen","year":"1994","author":"potthoff","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1231082307"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/2695073"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210054"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1185803625"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.32"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934517"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2017,6,20]]},"location":"Reykjavik, Iceland","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\/08005115.pdf?arnumber=8005115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T03:39:03Z","timestamp":1569987543000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005115","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}