Temporal description logic for ontology-based data access

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 711-717

  Artale, Alessandro ^a   Kontchakov, Roman ^b   Wolter, Frank ^c   Zakharyaschev, Michael ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL MODELLING; CONJUNCTIVE QUERIES; DESCRIPTION LOGIC; FIRST-ORDER; ONTOLOGY-BASED DATA ACCESS; STANDARD ONTOLOGY LANGUAGE; TEMPORAL DATA;

ARTIFICIAL INTELLIGENCE; FORMAL LANGUAGES; ONTOLOGY;

DATA DESCRIPTION;

EID: 84896063727     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Artale and E. Franconi. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence, Foundations of Artificial Intelligence, pages 375-388. Elsevier, 2005.
2. A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev. Reasoning over extended ER models. In Proc. of ER-2007, volume 4801 of LNCS, pages 277-292. Springer, 2007.
3. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite family and relations. J. of Artifical Intelligence Research, 36:1-69, 2009.
4. A. Artale, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev. Complexity of reasoning over temporal data models. In Proc. of ER-2010, volume 6412 of LNCS, pages 174-187. Springer, 2010.
5. A. Artale, R. Kontchakov, F. Wolter, and M. Zakharyaschev. Temporal Description Logic for Ontology-Based Data Access (Extended Version). CoRR, abs/1304.5185, 2013.
6. F. Baader, S. Ghilardi, and C. Lutz. LTL over description logic axioms. ACM Trans. Comput. Log., 13(3):21, 2012.
7. D. Berardi, D. Calvanese, and G. De Giacomo. Reasoning on UML class diagrams. Artificial Intelligence, 168(1-2):70-118, 2005.
8. A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57-83, 2012.
9. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of KR 2006, pages 260-270, 2006.
10. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385-429, 2007.
11. A. Chortaras, D. Trivela, and G. Stamou. Goal-oriented query rewriting for OWL 2 QL. In Proc. of DL 2011, volume 745 of CEUR-WS, 2011.
12. E. Franconi and D. Toman. Fixpoints in temporal description logics. In Proc. of IJCAI 2011, pages 875-880, 2011.
13. D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-dimensional modal logics: theory and applications. Studies in Logic. Elsevier, 2003.
14. H. Gaifman, H. G. Mairson, Y. Sagiv, and M. Y. Vardi. Undecidable optimization problems for database logic programs. In Proc. of LICS 87, pages 106-115, 1987.
15. G. Gottlob and T. Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In Proc. of DL 2011, volume 745 of CEUR-WS, 2011.
16. G. Gottlob, G. Orsi, and A. Pieris. Ontological queries: Rewriting and optimization. In Proc. of ICDE 2011, pages 2-13. IEEE Computer Society, 2011.
17. M. Grohe and G. Schwandtner. The complexity of datalog on linear orders. Logical Methods in Computer Science, 5(1), 2009.
18. V. Gutiérrez-Basulto and S. Klarman. Towards a unifying approach to representing and querying temporal data in description logics. In Proc. of RR 2012, volume 7497 of LNCS, pages 90-105. Springer, 2012.
19. C. Gutierrez, C. A. Hurtado, and A. A. Vaisman. Introducing time into RDF. IEEE Trans. Knowl. Data Eng., 19(2):207-218, 2007.
20. M. König, M. Leclère, M.-L. Mugnier, and M. Thomazo. A sound and complete backward chaining algorithm for existential rules. In Proc. of RR 2012, volume 7497 of LNCS, pages 122-138. Springer, 2012.
21. R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev. The combined approach to query answering in DL-Lite. In Proc. of KR 2010. AAAI Press, 2010.
22. S. Kreutzer, M. Otto, and N. Schweikardt. Boundedness of monadic FO over acyclic structures. In Proc. of ICALP 2007, pages 571-582, 2007.
23. L. Libkin. Elements Of Finite Model Theory. Springer, 2004.
24. C. Lutz, F.Wolter, and M. Zakharyaschev. Temporal description logics: A survey. In Proc. of TIME 2008, pages 3-14. IEEE Computer Society, 2008.
25. B. Motik. Representing and querying validity time in RDF and OWL: A logic-based approach. J. Web Sem., 12:3-21, 2012.
26. H. Pérez-Urbina, B. Motik, and I. Horrocks. A comparison of query rewriting techniques for DL-Lite. In Proc. of DL 2009, volume 477 of CEURWS, 2009.
27. A. Pugliese, O. Udrea, and V. S. Subrahmanian. Scaling RDF with time. In Proc. of WWW 2008, pages 605-614, 2008.
28. R. Rosati and A. Almatelli. Improving query answering over DL-Lite ontologies. In Proc. of KR 2010. AAAI Press, 2010.
29. A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. J. of Intel. Inf. Systems, 2:265-278, 1993.
30. R. van der Meyden. Predicate boundedness of linear monadic datalog is in PSPACE. Int. J. Found. Comput. Sci., 11(4):591-612, 2000.