{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:20Z","timestamp":1725484640964},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_10","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"130-144","source":"Crossref","is-referenced-by-count":1,"title":["The Natural Order-Generic Collapse for \u03c9-Representable Databases over the Rational and the Real Ordered Group"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Schweikardt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(98)00025-6","volume":"97","author":"O.V. Belegradek","year":"1999","unstructured":"O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 97:85\u2013125, 1999.","journal-title":"Annals of Pure and Applied Logic"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/273865.273870","volume":"45","author":"M. Benedikt","year":"1998","unstructured":"M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45:1\u201334, 1998.","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"M. Benedikt and L. Libkin. Expressive power: The finite case. In G. Kuper, L. Libkin, and J. Paredaens, editors, Constraint Databases, pages 55\u201387. Springer, 2000.","DOI":"10.1007\/978-3-662-04031-7_3"},{"key":"10_CR4","unstructured":"H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1999."},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-48168-0_6","volume-title":"Proc. CSL 1999","author":"E. Gr\u00e4del","year":"1999","unstructured":"E. Gr\u00e4del and S. Kreutzer. Descriptive complexity theory for constraint databases. In Proc. CSL 1999, volume 1683 of Lecture Notes in Computer Science, pages 67\u201381. Springer, 1999."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/BFb0055756","volume-title":"Proc. MFCS 1998","author":"D. Harel","year":"1998","unstructured":"D. Harel. Towards a theory of recursive structures. In Proc. MFCS 1998, volume 1450 of Lecture Notes in Computer Science, pages 36\u201353. Springer, 1998."},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-49257-7_13","volume-title":"Proc. ICDT 1999","author":"B. Kuijpers","year":"1999","unstructured":"B. Kuijpers and J. Van den Bussche. On capturing first-order topological properties of planar spatial databases. In Proc. ICDT 1999, volume 1540 of Lecture Notes in Computer Science, pages 187\u2013198. Springer, 1999."},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-44693-1_40","volume-title":"Proc. STACS 2001","author":"C. Lautemann","year":"2001","unstructured":"C. Lautemann and N. Schweikardt. An Ehrenfeucht-Fa\u00efss\u00e9 approach to collapse results for first-order queries over embedded databases. In Proc. STACS 2001, volume 2010 of Lecture Notes in Computer Science, pages 455\u2013466. Springer, 2001."},{"issue":"2","key":"10_CR9","first-page":"270","volume":"61","author":"L. Segoufin","year":"2000","unstructured":"L. Segoufin and V. Vianu. Querying spatial databases via topological invariants. JCSS, 61(2):270\u2013301, 2000.","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:30:56Z","timestamp":1550370656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}