Temporalizing ontology-based data access

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7898 LNAI, Issue , 2013, Pages 330-344

  Baader, Franz ^a   Borgwardt, Stefan ^a   Lippmann, Marcel ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED WORLD ASSUMPTION; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; DESCRIPTION LOGIC; ONTOLOGY LANGUAGE; ONTOLOGY-BASED DATA ACCESS; PROPOSITIONAL VARIABLES; SITUATION AWARENESS;

DATA DESCRIPTION; FORMAL LOGIC; QUERY LANGUAGES;

ONTOLOGY;

EID: 84879933464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38574-2_23     Document Type: Conference Paper

References (23)

1. Abiteboul, S., Hull, R., Vianu,V.: Foundations of Databases. Addison-Wesley (1995)
2. 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. 5607, pp. 77-92. Springer, Heidelberg (2009)
3. Baader, F., Borgwardt, S., Lippmann, M.: On the complexity of temporal query answering. LTCS-Report 13-01, Technische Universität Dresden, Germany (2012), http://lat.inf.tu-dresden.de/research/reports.html
4. Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. ACM Trans. Comput. Log. 13(3) (2012)
5. 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. 5689, pp. 255-356. Springer, Heidelberg (2009)
6. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. KR 2006 (2006)
7. Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. PODS 1998 (1998)
8. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. STOC 1977 (1977)
9. Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 34-53. Springer, Heidelberg (1985)
10. De Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Inform. Comput. 162(1-2) (2000)
11. Decker, S., Erdmann, M., Fensel, D., Studer, R.: Ontobroker: Ontology based access to distributed and semi-structured information. In: Proc. DS 1999 (1999)
12. Endsley, M.R.: Toward a theory of situation awareness in dynamic systems. Human Factors 37(1) (1995)
13. 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. 5195, pp. 179-193. Springer, Heidelberg (2008)
14. Massacci, F.: Decision procedures for expressive description logics with intersection, composition, converse of roles and role identity. In: Proc. IJCAI 2001 (2001)
15. Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. AAAI 2006 (2006)
16. Pnueli, A.: The temporal logic of programs. In: Proc. FOCS 1977 (1977)
17. Poggi, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Sem. X (2008)
18. Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! J. Artif. Intell. Res. 39(1) (2010)
19. Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. IJCAI 1991 (1991)
20. Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with complements. Artif. Intell. 48(1) (1991)
21. Tessaris, S.: Questions and Answers: Reasoning and Querying in Description Logic. Ph.D. thesis, University of Manchester (2001)
22. Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. Ph.D. thesis, RWTH Aachen (2001)
23. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inform. Comput. 155(1) (1994)