{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:10:04Z","timestamp":1737184204066,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_32","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"470-484","source":"Crossref","is-referenced-by-count":0,"title":["Operational Semantics for Fixed-Point Logics on Constraint Databases"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kreutzer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"O. Belegradek, A. Stolboushkin, and M. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 1998. To appear.","DOI":"10.1016\/S0168-0072(98)00025-6"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"A. Dawar and Y. Gurevich. Fixed-point logics. Bulletin of Symbolic Logic. to appear.","DOI":"10.2178\/bsl\/1182353853"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.","DOI":"10.1007\/3-540-28788-4"},{"key":"32_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/BFb0017459","volume-title":"Principles and Practice of Constraint Programming","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and G. M. Kuper. Tractable recursion over geometric data. In Principles and Practice of Constraint Programming, number 1330 in LNCS, pages 450\u2013462. Springer, 1997."},{"key":"32_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-48168-0_6","volume-title":"Computer Science Logic","author":"E. Gr\u00e4del","year":"1999","unstructured":"E. Gr\u00e4del and S. Kreutzer. Descriptive complexity theory for constraint databases. In Computer Science Logic, number 1683 in LNCS, pages 67\u201382. Springer, 1999."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"F. Geerts and B. Kuijpers. Linear approximation of planar spatial databases using transitive-closure logic. In Proceedings of the 19th ACM Symp. on Principles of Database Systems (PODS), 2000, pages 126\u2013135. ACM Press, 2000.","DOI":"10.1145\/335168.335215"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299\u2013313, 1990.","DOI":"10.1145\/298514.298582"},{"key":"32_CR8","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. (An extended abstract appeared in the Proceedings of PODS\u201990).","journal-title":"Journal of Computer and Systems Sciences"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 2000.","DOI":"10.1007\/978-3-662-04031-7"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","volume":"90","author":"P. Kolaitis","year":"1991","unstructured":"P. Kolaitis. The expressive power of stratified logic programs. INFORMATION AND COMPUTATION, 90:50\u201366, 1991.","journal-title":"INFORMATION AND COMPUTATION"},{"key":"32_CR11","unstructured":"S. Kreutzer. Descriptive complexity theory for constraint databases, 1999. Diplomarbeit an der RWTH Aachen."},{"key":"32_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-44503-X_17","volume-title":"Proceedings of the 8th International Conference on Database Theory (ICDT)","author":"S. Kreutzer","year":"2001","unstructured":"S. Kreutzer. Query languages for constraint databases: First-order logic, fixed-points, and convex hulls. In Proceedings of the 8th International Conference on Database Theory (ICDT), number 1973 in Lecture Notes in Computer Science, pages 248\u2013262. Springer, 2001."},{"key":"32_CR13","unstructured":"L. Vandeurzen. Logic-Based Query Languages for the Linear Constraint Database Model. PhD thesis, Limburgs Universitair Centrum, 1999."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:21:46Z","timestamp":1737087706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}