{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:02:29Z","timestamp":1725494549031},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654520"},{"type":"electronic","value":"9783540492573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49257-7_7","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T02:44:59Z","timestamp":1194662699000},"page":"83-99","source":"Crossref","is-referenced-by-count":2,"title":["Decidability of First-Order Logic Queries over Views"],"prefix":"10.1007","author":[{"given":"James","family":"Bailey","sequence":"first","affiliation":[]},{"given":"Guozhu","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 254\u2013263, Seattle, Washington, 1998.","DOI":"10.1145\/275487.275516"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and undecidability results for the termination problem of active database rules. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 264\u2013273, Seattle, Washington, 1998.","DOI":"10.1145\/275487.275517"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"E. Boerger, E. Graedel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1996.","DOI":"10.1007\/978-3-642-59207-2_1"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 149\u2013158, Seattle, Washington, 1998.","DOI":"10.1145\/275487.275504"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"S. Cosmadakis, H. Gaifman, P. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. Proceedings of the ACM Symposium on the Theory of Computing, pages 477\u2013490 1988.","DOI":"10.1145\/62212.62259"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/78935.78937","volume":"37","author":"S. Cosmadakis","year":"1990","unstructured":"S. Cosmadakis, P. Kanellakis, and M. Vardi. Polynomial time implication problems for unary inclusion dependencies. Journal of the ACM, 37(1):15\u201346, 1990.","journal-title":"Journal of the ACM"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","volume":"25","author":"N. Immerman","year":"1982","unstructured":"N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76\u201398, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"A. Levy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query reachability, and satisfiability in datalog extensions. In Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 109\u2013122, Washington D.C., 1993.","DOI":"10.1145\/153850.153860"},{"key":"7_CR9","unstructured":"A. Levy and M. Rousset. The limits on combining recursive horn rules with description logics. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, Oregon, 1996."},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/322217.322221","volume":"27","author":"Y. Sagiv","year":"1980","unstructured":"Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633\u2013655, 1980.","journal-title":"Journal of the ACM"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"D. Theodoratos. Deductive object oriented schemas. In Proceedings of ER\u201996, 15th International Conference on Conceptual Modeling, pages 58\u201372 1996.","DOI":"10.1007\/BFb0019915"},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-62222-5_34","volume-title":"Proceedings of the Sixth International Conference on Database Theory","author":"J. D. Ullman","year":"1997","unstructured":"J. D. Ullman. Information integration using logical views. In Proceedings of the Sixth International Conference on Database Theory, LNCS 1186, pages 19\u201340, Delphi, Greece, 1997."}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49257-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T17:34:39Z","timestamp":1684085679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49257-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540654520","9783540492573"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49257-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}