{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T18:10:16Z","timestamp":1759342216490},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385735"},{"type":"electronic","value":"9783642385742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38574-2_23","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T07:55:13Z","timestamp":1370332513000},"page":"330-344","source":"Crossref","is-referenced-by-count":18,"title":["Temporalizing Ontology-Based Data Access"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Borgwardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Lippmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02716-1_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"F. Baader","year":"2009","unstructured":"Baader, F., Bauer, A., Baumgartner, P., Cregan, A., Gabaldon, A., Ji, K., Lee, K., Rajaratnam, D., Schwitter, R.: A novel architecture for situation awareness systems. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 77\u201392. Springer, Heidelberg (2009)"},{"key":"23_CR3","unstructured":"Baader, F., Borgwardt, S., Lippmann, M.: On the complexity of temporal query answering. LTCS-Report 13-01, Technische Universit\u00e4t Dresden, Germany (2012), \n                  \n                    http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. ACM Trans. Comput. Log.\u00a013(3) (2012)","DOI":"10.1145\/2287718.2287721"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-03754-2_7","volume-title":"Reasoning Web. Semantic Technologies for Information Systems","author":"D. Calvanese","year":"2009","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rodriguez-Muro, M., Rosati, R.: Ontologies and databases: The DL-Lite approach. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol.\u00a05689, pp. 255\u2013356. Springer, Heidelberg (2009)"},{"key":"23_CR6","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. KR 2006 (2006)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. PODS 1998 (1998)","DOI":"10.1145\/275487.275504"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. STOC 1977 (1977)","DOI":"10.1145\/800105.803397"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-16066-3_5","volume-title":"Computation Theory","author":"R. Danecki","year":"1985","unstructured":"Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 34\u201353. Springer, Heidelberg (1985)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Inform. Comput.\u00a0162(1-2) (2000)","DOI":"10.1006\/inco.1999.2852"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Decker, S., Erdmann, M., Fensel, D., Studer, R.: Ontobroker: Ontology based access to distributed and semi-structured information. In: Proc. DS 1999 (1999)","DOI":"10.1007\/978-0-387-35561-0_20"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Endsley, M.R.: Toward a theory of situation awareness in dynamic systems. Human Factors\u00a037(1) (1995)","DOI":"10.1518\/001872095779049543"},{"key":"23_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-71070-7_16","volume-title":"Automated Reasoning","author":"C. Lutz","year":"2008","unstructured":"Lutz, C.: The complexity of conjunctive query answering in expressive description logics. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 179\u2013193. Springer, Heidelberg (2008)"},{"key":"23_CR14","unstructured":"Massacci, F.: Decision procedures for expressive description logics with intersection, composition, converse of roles and role identity. In: Proc. IJCAI 2001 (2001)"},{"key":"23_CR15","unstructured":"Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. AAAI 2006 (2006)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. FOCS 1977 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Poggi, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Sem. X (2008)","DOI":"10.1007\/978-3-540-77688-8_5"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! J. Artif. Intell. Res.\u00a039(1) (2010)","DOI":"10.1613\/jair.3029"},{"key":"23_CR19","unstructured":"Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. IJCAI 1991 (1991)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M., Smolka, G.: Attributive concept descriptions with complements. Artif. Intell.\u00a048(1) (1991)","DOI":"10.1016\/0004-3702(91)90078-X"},{"key":"23_CR21","unstructured":"Tessaris, S.: Questions and Answers: Reasoning and Querying in Description Logic. Ph.D. thesis, University of Manchester (2001)"},{"key":"23_CR22","unstructured":"Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. Ph.D. thesis, RWTH Aachen (2001)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inform. Comput.\u00a0155(1) (1994)","DOI":"10.1006\/inco.1994.1092"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-24"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38574-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:58:42Z","timestamp":1557770322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38574-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385735","9783642385742"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38574-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}