{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:07:55Z","timestamp":1759147675209,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_6","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"67-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Descriptive Complexity Theory for Constraint Databases"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995. 67, 80","DOI":"10.1007\/3-540-28788-4"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(88)90136-3","volume":"56","author":"E. Gr\u00e4del","year":"1988","unstructured":"E. Gr\u00e4del. Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theoretical Computer Science, 56:289\u2013301, 1988. 71, 71, 72","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1997.2675","volume":"140","author":"E. Gr\u00e4del","year":"1998","unstructured":"E. Gr\u00e4del and Y. Gurevich. Metafinite model theory. Information and Computation, 140:26\u201381, 1998. 68","journal-title":"Information and Computation"},{"key":"6_CR4","unstructured":"E. Gr\u00e4del and K. Meer. Descriptive complexity theory over the real numbers. In Mathematics of Numerical Analysis: Real Number Algorithms, volume 32 of AMS Lectures in Applied Mathematics, pages 381\u2013403. 1996. 68"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcss.1997.1524","volume":"55","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences, 55:273\u2013298, 1997. 68, 68, 70, 70","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(96)00194-6","volume":"173","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173:151\u2013181, 1997. 68, 68","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-60178-3_96","volume":"960","author":"S. Grumbach","year":"1995","unstructured":"S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. Lecture Notes in Computer Science, 960:426\u2013446, 1995. 70","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/BFb0055756","volume-title":"Towards a theory of recursive structures","author":"D. Harel","year":"1998","unstructured":"D. Harel. Towards a theory of recursive structures. volume 1450 of Lecture Notes in Computer Science, pages 36\u201353. Springer, 1998. 68"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"W. Hodges. Model Theory. Cambridge University Press, 1993. 78","DOI":"10.1017\/CBO9780511551574"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"N. Immerman. Descriptive complexity. Graduate Texts in Computer Science. Springer, 1998. 67, 80","DOI":"10.1007\/978-1-4612-0539-5_6"},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-57887-0_92","volume-title":"Constraint programming and database query languages","author":"P. Kanellakis","year":"1994","unstructured":"P. Kanellakis and D. Goldin. Constraint programming and database query languages. volume 789 of Lecture Notes in Computer Science, pages 96\u2013120. Springer, 1994. 68"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P. Kanellakis","year":"1995","unstructured":"P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. Journal of Computer and Systems Sciences, 51:26\u201352, 1995. 68, 68, 68, 68, 81","journal-title":"Journal of Computer and Systems Sciences"},{"key":"6_CR13","volume-title":"Descriptive complexity theory for constraint databases","author":"S. Kreutzer","year":"1999","unstructured":"S. Kreutzer. Descriptive complexity theory for constraint databases. Diplomarbeit, RWTH Aachen, 1999. 80"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(93)90222-F","volume":"116","author":"P. Revesz","year":"1993","unstructured":"P. Revesz. A closed form evaluation for datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116:117\u2013149, 1993. 80","journal-title":"Theoretical Computer Science"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF02679468","volume":"30","author":"U. Sch\u00f6ning","year":"1997","unstructured":"U. Sch\u00f6ning. Complexity of Presburger arithmetic with fixed quantifier dimension. Theory of Computing Systems, 30:423\u2013428, 1997. 71, 72","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:10:11Z","timestamp":1586146211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}