Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk)

Authors Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev



PDF
Thumbnail PDF

File

LIPIcs.TIME.2017.1.pdf
  • Filesize: 0.85 MB
  • 37 pages

Document Identifiers

Author Details

Alessandro Artale
Roman Kontchakov
Alisa Kovtunova
Vladislav Ryzhikov
Frank Wolter
Michael Zakharyaschev

Cite As Get BibTex

Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev. Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk). In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 1:1-1:37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.TIME.2017.1

Abstract

We discuss the use of various temporal knowledge representation formalisms for ontology-mediated query answering over temporal data. In particular, we analyse ontology and query languages based on the linear temporal logic LTL, the multi-dimensional Halpern-Shoham interval temporal logic HS_n, as well as the metric temporal logic MTL. Our main focus is on the data complexity of answering temporal ontology-mediated queries and their rewritability into standard first-order and datalog queries.

Subject Classification

Keywords
  • Description Logic
  • Temporal Logic
  • Ontology Mediated Query Answering
  • Data Complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Luca Aceto, Dario Della Monica, Valentin Goranko, Anna Ingólfsdóttir, Angelo Montanari, and Guido Sciavicco. A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases. Acta Inf., 53(3):207-246, 2016. URL: http://dx.doi.org/10.1007/s00236-015-0231-4.
  2. James F. Allen. Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832-843, 1983. URL: http://dx.doi.org/10.1145/182.358434.
  3. Rajeev Alur, Tomás Feder, and Thomas A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43(1):116-146, 1996. URL: http://dx.doi.org/10.1145/227595.227602.
  4. Rajeev Alur and Thomas A. Henzinger. Real-time logics: Complexity and expressiveness. Inf. Comput., 104(1):35-77, 1993. URL: http://dx.doi.org/10.1006/inco.1993.1025.
  5. Natalia Antonioli, Francesco Castanò, Spartaco Coletta, Stefano Grossi, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Emanuela Virardi, and Patrizia Castracane. Ontology-based data management for the Italian public debt. In Proc. of the 8th Int. Conf. on Formal Ontology in Information Systems, FOIS 2014, pages 372-385. IOS Press, 2014. URL: http://dx.doi.org/10.3233/978-1-61499-438-1-372.
  6. Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR), 36:1-69, 2009. URL: http://dx.doi.org/10.1613/jair.2820.
  7. Alessandro Artale and Enrico Franconi. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence, volume 1 of Foundations of Artificial Intelligence, pages 375-388. Elsevier, 2005. URL: http://dx.doi.org/10.1016/S1574-6526(05)80014-8.
  8. Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev. First-order rewritability of temporal ontology-mediated queries. In Proc. of the 24th Int. Joint Conf. on Artificial Intelligence, IJCAI'15, pages 2706-2712. IJCAI/AAAI, 2015. Google Scholar
  9. Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. The complexity of clausal fragments of LTL. In Proc. of the 19th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'13, volume 8312 of LNCS, pages 35-52. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-45221-5_3.
  10. Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. A cookbook for temporal conceptual data modelling with description logics. ACM Trans. Comput. Log., 15(3):25:1-25:50, 2014. URL: http://dx.doi.org/10.1145/2629565.
  11. Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. Tractable interval temporal propositional and description logics. In Proc. of the 29th Conf. on Artificial Intelligence, AAAI'15, pages 1417-1423. AAAI Press, 2015. Google Scholar
  12. Alessandro Artale, Roman Kontchakov, Frank Wolter, and Michael Zakharyaschev. Temporal description logic for ontology-based data access. In Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence, IJCAI'13, pages 711-717. IJCAI/AAAI, 2013. Google Scholar
  13. Franz Baader. Ontology-based monitoring of dynamic systems. In Proc. of the 14th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR'14, pages 678-681. AAAI Press, 2014. Google Scholar
  14. Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, and Veronika Thost. Metric temporal description logics with interval-rigid names (extended abstract). In Proc. of the 30th Int. Workshop on Description Logics, DL'17. CEUR-WS, 2017. Google Scholar
  15. Franz Baader, Stefan Borgwardt, and Marcel Lippmann. Temporalizing ontology-based data access. In Proc. of the 24th Int. Conf. on Automated Deduction, CADE-24, volume 7898 of LNCS, pages 330-344. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-38574-2_23.
  16. Franz Baader, Stefan Borgwardt, and Marcel Lippmann. Temporal conjunctive queries in expressive description logics with transitive roles. In Proc. of the 28th Australasian Joint Conf. on Advances in Artificial Intelligence, AI'15, volume 9457 of LNCS, pages 21-33. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-319-26350-2_3.
  17. Franz Baader, Stefan Borgwardt, and Marcel Lippmann. Temporal query entailment in the description logic SHQ. J. Web Semantics, 33:71-93, 2015. URL: http://dx.doi.org/10.1016/j.websem.2014.11.008.
  18. Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI-05, pages 364-369. IJCAI/AAAI, 2005. Google Scholar
  19. Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003. Google Scholar
  20. Franz Baader, Silvio Ghilardi, and Carsten Lutz. LTL over description logic axioms. In Proc. of the 11th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2008, pages 684-694. AAAI Press, 2008. Google Scholar
  21. Franz Baader, Ralf Küsters, and Frank Wolter. Extensions to description logics. In The Description Logic Handbook, pages 219-261. Cambridge University Press, 2003. Google Scholar
  22. Samantha Bail, Sandra Alkiviadous, Bijan Parsia, David Workman, Mark Van Harmelen, Rafael S. Goncalves, and Cristina Garilao. Fishmark: A linked data application benchmark. In Proc. of SSWS+HPCSW 2012, pages 1-15. CEUR-WS, 2012. Google Scholar
  23. Philippe Balbiani, Jean-François Condotta, and Luis Fariñas del Cerro. Tractability results in the block algebra. J. Log. Comput., 12(5):885-909, 2002. URL: http://dx.doi.org/10.1093/logcom/12.5.885.
  24. Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP. ACM Trans. on Database Systems, 39(4):33:1-33:44, 2014. URL: http://dx.doi.org/10.1145/2661643.
  25. Stefan Borgwardt, Marcel Lippmann, and Veronika Thost. Temporal query answering in the description logic DL-Lite. In Proc. of the 9th Int. Symposium on Frontiers of Combining Systems, FroCoS'13, volume 8152 of LNCS, pages 165-180. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-40885-4_11.
  26. Stefan Borgwardt, Marcel Lippmann, and Veronika Thost. Temporalizing rewritable query languages over knowledge bases. J. Web Semantics, 33:50-70, 2015. URL: http://dx.doi.org/10.1016/j.websem.2014.11.007.
  27. Stefan Borgwardt and Veronika Thost. Temporal query answering in DL-Lite with negation. In Proc. of the Global Conf. on Artificial Intelligence, GCAI15, volume 36 of EPiC Series in Computing, pages 51-65, 2015. Google Scholar
  28. Stefan Borgwardt and Veronika Thost. Temporal query answering in the description logic EL. In Proc. of the 24h Int. Joint Conf. on Artificial Intelligence, IJCAI'15, pages 2819-2825. AAAI Press, 2015. Google Scholar
  29. Sebastian Brandt, Elem Güzel Kalayci, Roman Kontchakov, Vladislav Ryzhikov, Guohui Xiao, and Michael Zakharyaschev. Ontology-based data access with a horn fragment of metric temporal logic. In Proc. of the 31st AAAI Conf. on Artificial Intelligence, AAAI'17, pages 1070-1076. AAAI Press, 2017. Google Scholar
  30. Sebastian Brandt, Elem Güzel Kalayci, Vladislav Ryzhikov, Guohui Xiao, and Michael Zakharyaschev. Querying log data with metric temporal logic. CoRR, abs/1703.08982, 2017. Google Scholar
  31. Torben Braüner and Silvio Ghilardi. First-order modal logic. In Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning, pages 549-620. Elsevier, 2007. Google Scholar
  32. Davide Bresolin, Agi Kurucz, Emilio Muñoz-Velasco, Vladislav Ryzhikov, Guido Sciavicco, and Michael Zakharyaschev. Horn fragments of the Halpern-Shoham interval temporal logic. ACM Trans. Comput. Log., 18(3), 2017. Google Scholar
  33. Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, and Guido Sciavicco. The dark side of interval temporal logic: marking the undecidability border. Ann. Math. Artif. Intell. (AMAI), 71(1-3):41-83, 2014. URL: http://dx.doi.org/10.1007/s10472-013-9376-4.
  34. Davide Bresolin, Dario Della Monica, Angelo Montanari, and Guido Sciavicco. The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT. Ann. Math. Artif. Intell. (AMAI), 71(1-3):11-39, 2014. URL: http://dx.doi.org/10.1007/s10472-013-9337-y.
  35. Richard J. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6(1-6):66-92, 1960. URL: http://dx.doi.org/10.1002/malq.19600060105.
  36. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Mariano Rodriguez-Muro, Riccardo Rosati, Marco Ruzzi, and Domenico Fabio Savo. The MASTRO system for ontology-based data access. Semantic Web, 2(1):43-53, 2011. URL: http://dx.doi.org/10.3233/SW-2011-0029.
  37. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3):385-429, 2007. URL: http://dx.doi.org/10.1007/s10817-007-9078-x.
  38. Diego Calvanese, Pietro Liuzzo, Alessandro Mosca, José Remesal, Martin Rezk, and Guillem Rull. Ontology-based data integration in EPNet: Production and distribution of food during the Roman Empire. Eng. Appl. of AI, 51:212-229, 2016. URL: http://dx.doi.org/10.1016/j.engappai.2016.01.005.
  39. Jan Chomicki. Polynomial time query processing in temporal deductive databases. In Proc. of the 9th ACM Symposium on Principles of Database Systems, PODS'90, pages 379-391. ACM Press, 1990. URL: http://dx.doi.org/10.1145/298514.298589.
  40. Jan Chomicki and Tomasz Imielinski. Temporal deductive databases and infinite objects. In Proc. of the 7th ACM Symposium on Principles of Database Systems, PODS'88, pages 61-73. ACM, 1988. URL: http://dx.doi.org/10.1145/308386.308416.
  41. Stéphane Demri, Valentin Goranko, and Martin Lange. Temporal Logics in Computer Science. Cambridge University Press, 2016. Google Scholar
  42. Michael Fisher, Clare Dixon, and Martin Peim. Clausal temporal resolution. ACM Trans. Comput. Log., 2(1):12-56, 2001. URL: http://dx.doi.org/10.1145/371282.371311.
  43. Merrick L. Furst, James B. Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, 1984. URL: http://dx.doi.org/10.1007/BF01744431.
  44. Dov M. Gabbay, Ian Hodkinson, and Mark Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, volume 1. Oxford University Press, 1994. Google Scholar
  45. Dov M. Gabbay, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Elsevier North Holland, 2003. Google Scholar
  46. Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. Temporal Logic: Mathematical Foundations and Computational Aspects, volume 2. Oxford University Press, 2000. Google Scholar
  47. Martin Giese, Ahmet Soylu, Guillermo Vega-Gorgojo, Arild Waaler, Peter Haase, Ernesto Jiménez-Ruiz, Davide Lanti, Martín Rezk, Guohui Xiao, Özgür L. Özçep, and Riccardo Rosati. Optique: Zooming in on big data. IEEE Computer, 48(3):60-67, 2015. URL: http://dx.doi.org/10.1109/MC.2015.82.
  48. Claudio Gutierrez, Carlos A. Hurtado, and Alejandro A. Vaisman. Introducing time into RDF. IEEE Trans. Knowl. Data Eng., 19(2):207-218, 2007. URL: http://dx.doi.org/10.1109/TKDE.2007.34.
  49. Víctor Gutiérrez-Basulto, Jean Christoph Jung, and Roman Kontchakov. Temporalized EL ontologies for accessing temporal data: Complexity of atomic queries. In Proc. of the 25th Int. Joint Conf. on Artificial Intelligence, IJCAI'16, pages 1102-1108. IJCAI/AAAI, 2016. Google Scholar
  50. Víctor Gutiérrez-Basulto, Jean Christoph Jung, and Ana Ozaki. On metric temporal description logics. In Proc. of the 22nd European Conf. on Artificial Intelligence, ECAI 2016, volume 285 of FAIA, pages 837-845. IOS Press, 2016. URL: http://dx.doi.org/10.3233/978-1-61499-672-9-837.
  51. Víctor Gutiérrez-Basulto, Jean Christoph Jung, and Thomas Schneider. Lightweight description logics and branching time: A troublesome marriage. In Proc. of the 14th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR'14, pages 278-287. AAAI Press, 2014. Google Scholar
  52. Víctor Gutiérrez-Basulto, Jean Christoph Jung, and Thomas Schneider. Lightweight temporal description logics with rigid roles and restricted TBoxes. In Proc. of the 24th Int. Joint Conf. on Artificial Intelligence, IJCAI 2015, pages 3015-3021. IJCAI/AAAI, 2015. Google Scholar
  53. Joseph Y. Halpern and Yoav Shoham. A propositional modal logic of time intervals. J. ACM, 38(4):935-962, 1991. URL: http://dx.doi.org/10.1145/115234.115351.
  54. Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. On the computational complexity of decidable fragments of first-order linear temporal logics. In Proc. of the 10th Int. Symposium on Temporal Representation and Reasoning and the 4th Int. Conf. on Temporal Logic, TIME-ICTL 2003, pages 91-98. IEEE Computer Society, 2003. URL: http://dx.doi.org/10.1109/TIME.2003.1214884.
  55. Ullrich Hustadt, Boris Motik, and Ulrike Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI-05, pages 466-471. IJCAI/AAAI, 2005. Google Scholar
  56. Neil Immerman. Descriptive complexity. Springer, 1999. URL: http://dx.doi.org/10.1007/978-1-4612-0539-5.
  57. Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael Zakharyaschev. The combined approach to query answering in DL-Lite. In Proc. of the 12th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2010, pages 247-257. AAAI Press, 2010. Google Scholar
  58. Roman Kontchakov, Laura Pandolfo, Luca Pulina, Vladislav Ryzhikov, and Michael Zakharyaschev. Temporal and spatial OBDA with many-dimensional Halpern-Shoham logic. In Proc. of the 25th Int. Joint Conf. on Artificial Intelligence, IJCAI'16, pages 1160-1166. IJCAI/AAAI, 2016. Google Scholar
  59. Alisa Kovtunova. Ontology-Mediated Query Answering with Lightweight Temporal Description Logics. PhD thesis, KRDB research centre, Faculty of Computer Science, Free University of Bozen-Bolzano, 2017. Google Scholar
  60. Krishna G. Kulkarni and Jan-Eike Michels. Temporal features in SQL:2011. SIGMOD Record, 41(3):34-43, 2012. Google Scholar
  61. Leonid Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004. URL: http://dx.doi.org/10.1007/978-3-662-07003-1.
  62. Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Temporal description logics: A survey. In Proc. of the 15th Int. Symposium on Temporal Representation and Reasoning, TIME'08, pages 3-14. IEEE Computer Society, 2008. URL: http://dx.doi.org/10.1109/TIME.2008.14.
  63. Jerzy Marcinkowski and Jakub Michaliszyn. The undecidability of the logic of subintervals. Fundam. Inform., 131(2):217-240, 2014. URL: http://dx.doi.org/10.3233/FI-2014-1011.
  64. Boris Motik. Representing and querying validity time in RDF and OWL: A logic-based approach. J. Web Semantics, 12:3-21, 2012. URL: http://dx.doi.org/10.1016/j.websem.2011.11.004.
  65. Isabel Navarrete, Antonio Morales, Guido Sciavicco, and M. Antonia Cárdenas Viedma. Spatial reasoning with rectangular cardinal relations - the convex tractable subalgebra. Ann. Math. Artif. Intell. (AMAI), 67(1):31-70, 2013. URL: http://dx.doi.org/10.1007/s10472-012-9327-5.
  66. Joël Ouaknine and James Worrell. On the decidability of metric temporal logic. In Proc. of the 20th Annual IEEE Symposium on Logic in Computer Science, LICS'05, pages 188-197. IEEE Computer Society, 2005. URL: http://dx.doi.org/10.1109/LICS.2005.33.
  67. Joël Ouaknine and James Worrell. Some recent results in metric temporal logic. In Proc. of the 6th Int. Conf. on Formal Modeling and Analysis of Timed Systems, FORMATS'08, pages 1-13, 2008. URL: http://dx.doi.org/10.1007/978-3-540-85778-5_1.
  68. Özgür L. Özçep, Ian Horrocks, Ralf Möller, Thomas Hubauer, Christian Neuenstadt, Mikhail Roshchin, Dmitriy Zheleznyakov, and Evgeny Kharlamov. Deliverable D5.1: A semantics for temporal and stream-based query answering in an OBDA context. Technical report, Deliverable FP7-318338, EU, October 2013. Google Scholar
  69. Özgür L. Özçep and Ralf Möller. Ontology based data access on temporal and streaming data. In Proc. of the 10th Int. Summer School on Reasoning on the Web in the Big Data Era (Reasoning Web'14), volume 8714 of LNCS, pages 279-312. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-319-10587-1_7.
  70. Özgür L. Özçep, Ralf Möller, and Christian Neuenstadt. A stream-temporal query language for ontology based data access. In Proc. of the 37th Annual German Conf. on AI, KI'14, pages 183-194. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-319-11206-0_18.
  71. Francesco Pagliarecci, Luca Spalazzi, and Gilberto Taccari. Reasoning with temporal aboxes: Combining DL-Lite_core with CTL. In Proc. of the 26th Int. Workshop on Description Logics, DL'13, pages 885-897. CEUR-WS, 2013. Google Scholar
  72. Amir Pnueli. The temporal logic of programs. In Proc. of the 18th Annual Symposium on Foundations of Computer Science, FOCS'77, pages 46-57. IEEE Computer Society, 1977. URL: http://dx.doi.org/10.1109/SFCS.1977.32.
  73. Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Riccardo Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008. URL: http://dx.doi.org/10.1007/978-3-540-77688-8_5.
  74. Andrea Pugliese, Octavian Udrea, and V. S. Subrahmanian. Scaling RDF with time. In Proc. of the 17th Int. Conf. on World Wide Web, WWW'08, pages 605-614. ACM, 2008. URL: http://dx.doi.org/10.1145/1367497.1367579.
  75. Alexander Rabinovich. A proof of Kamp’s theorem. Logical Methods in Computer Science, 10(1), 2014. URL: http://dx.doi.org/10.2168/LMCS-10(1:14)2014.
  76. Katerina El Raheb, Theofilos Mailis, Vladislav Ryzhikov, Nicolas Papapetrou, and Yannis E. Ioannidis. Balonse: Temporal aspects of dance movement and its ontological representation. In Proc. of the 14th Int. Conf., ESWC 2017, Part II, pages 49-64, 2017. URL: http://dx.doi.org/10.1007/978-3-319-58451-5_4.
  77. Mariano Rodriguez-Muro, Roman Kontchakov, and Michael Zakharyaschev. Ontology-based data access: Ontop of databases. In Proc. of the 12th Int. Semantic Web Conf., ISWC'13, Part I, volume 8218 of LNCS, pages 558-573. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-41335-3_35.
  78. Riccardo Rosati. On conjunctive query answering in EL. In Proc. of the Int. Workshop on Description Logics, DL'07, volume 250. CEUR-WS, 2007. Google Scholar
  79. Andrea Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. J. Intelligent Information Systems, 2(3):265-278, 1993. URL: http://dx.doi.org/doi:10.1007/BF00962071.
  80. Klaus Schild. Combining terminological logics with tense logic. In Proc. of the 6th Portuguese Conf. on Progress in Artificial Intelligence, EPIA'93, volume 727 of Lecture Notes in Computer Science, pages 105-120. Springer, 1993. URL: http://dx.doi.org/10.1007/3-540-57287-2_41.
  81. Albrecht Schmiedel. Temporal terminological logic. In Proc. of the 8th National Conf. on Artificial Intelligence, AAAI'90, pages 640-645. AAAI Press / The MIT Press, 1990. Google Scholar
  82. Juan F. Sequeda and Daniel P. Miranker. A pay-as-you-go methodology for ontology-based data access. IEEE Internet Computing, 21(2):92-96, 2017. URL: http://dx.doi.org/10.1109/MIC.2017.46.
  83. Ahmet Soylu, Martin Giese, Rudolf Schlatte, Ernesto Jiménez-Ruiz, Evgeny Kharlamov, Özgür L. Özçep, Christian Neuenstadt, and Sebastian Brandt. Querying industrial stream-temporal data: An ontology-based visual approach. J. Ambient Intelligence &Smart Environments, 9(1):77-95, 2017. URL: http://dx.doi.org/10.3233/AIS-160415.
  84. David Toman. On incompleteness of multi-dimensional first-order temporal logics. In Proc. of the 10th Int. Symposium on Temporal Representation and Reasoning and the 4th Int. Conf. on Temporal Logic, TIME-ICTL 2003, pages 99-106. IEEE Computer Society, 2003. URL: http://dx.doi.org/10.1109/TIME.2003.1214885.
  85. Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Proc. of the 14th Annual ACM Symposium on Theory of Computing, STOC'82, pages 137-146. ACM, 1982. URL: http://dx.doi.org/10.1145/800070.802186.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail