First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries. (English) Zbl 07639820
Summary: Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time \((\mathbb{Z},<)\). Our main concern is first-order rewritability of ontology-mediated queries (OMQs) that consist of a 2D ontology and a positive temporal instance query. Our target languages for FO-rewritings are two-sorted FO(\(<\)) – first-order logic with sorts for time instants ordered by the built-in precedence relation \(<\) and for the domain of individuals – its extension FO(\(<, \equiv)\) with the standard congruence predicates \(t \equiv 0\) (mod \(n\)), for any fixed \(n > 1\), and FO(RPR) that admits relational primitive recursion. In terms of circuit complexity, FO(\(<, \equiv)\)- and FO(RPR)-rewritability guarantee answering OMQs in uniform AC\(^0\) and NC\(^1\), respectively.
We proceed in three steps. First, we define a hierarchy of 2D DL-Lite/LTL ontology languages and investigate the FO-rewritability of OMQs with atomic queries by constructing projections onto 1D LTL OMQs and employing recent results on the FO-rewritability of propositional LTL OMQs. As the projections involve deciding consistency of ontologies and data, we also consider the consistency problem for our languages. While the undecidability of consistency for 2D ontology languages with expressive Boolean role inclusions might be expected, we also show that, rather surprisingly, the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts. As a final step, we lift some of the rewritability results for atomic OMQs to OMQs with expressive positive temporal instance queries. The lifting results are based on an in-depth study of the canonical models and only concern Horn ontologies.
We proceed in three steps. First, we define a hierarchy of 2D DL-Lite/LTL ontology languages and investigate the FO-rewritability of OMQs with atomic queries by constructing projections onto 1D LTL OMQs and employing recent results on the FO-rewritability of propositional LTL OMQs. As the projections involve deciding consistency of ontologies and data, we also consider the consistency problem for our languages. While the undecidability of consistency for 2D ontology languages with expressive Boolean role inclusions might be expected, we also show that, rather surprisingly, the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts. As a final step, we lift some of the rewritability results for atomic OMQs to OMQs with expressive positive temporal instance queries. The lifting results are based on an in-depth study of the canonical models and only concern Horn ontologies.
Software:
DatalogMTLReferences:
| [1] | Abiteboul, S., Hull, R., & Vianu, V. (1995).Foundations of Databases. Addison-Wesley. · Zbl 0848.68031 |
| [2] | Ajileye, T., Motik, B., & Horrocks, I. (2021). Streaming partitioning of RDF graphs for datalog reasoning. InProc. of the 18th Int. Conf. on the Semantic Web, ESWC 2021, Vol. 12731 ofLNCS, pp. 3-22. Springer. |
| [3] | Andr´eka, H., N´emeti, I., & van Benthem, J. (1998). Modal languages and bounded fragments of predicate logic.J. Philos. Log.,27(3), 217-274. · Zbl 0919.03013 |
| [4] | Artale, A., Calvanese, D., Kontchakov, R., & Zakharyaschev, M. (2009). The DL-Lite family and relations.J. Artif. Intell. Res. (JAIR),36, 1-69. · Zbl 1192.68657 |
| [5] | Artale, A., Kontchakov, R., Ryzhikov, V., & Zakharyaschev, M. (2013a). The complexity of clausal fragments of LTL. InProc. of the 19th Int. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2013, Vol. 8312 ofLNCS, pp. 35-52. Springer. · Zbl 1433.03046 |
| [6] | Artale, A., Kontchakov, R., Wolter, F., & Zakharyaschev, M. (2013b). Temporal description logic for ontology-based data access. InProc. of the 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI). IJCAI/AAAI. |
| [7] | Artale, A., & Franconi, E. (2005). Temporal description logics. InHandbook of Temporal Reasoning in Artificial Intelligence, Vol. 1 ofFoundations of Artificial Intelligence, pp. 375-388. Elsevier. · Zbl 1099.68106 |
| [8] | Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2017). Temporal ontology-mediated querying: A survey. InProc. of the 24th Int. Symp. on Temporal Representation and Reasoning, TIME17, Vol. 90 ofLIPIcs, pp. 1:1-1:37. Dagstuhl Publishing. · Zbl 1515.68296 |
| [9] | Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2021). First-order rewritability of ontology-mediated queries in linear temporal logic. Artif. Intell.,299, 103536. · Zbl 1520.68182 |
| [10] | Artale, A., Kontchakov, R., Lutz, C., Wolter, F., & Zakharyaschev, M. (2007). Temporalising tractable description logics. InProc. of the 14th Int. Symp. on Temporal Representation and Reasoning, TIME’07, pp. 11-22. IEEE Computer Society. |
| [11] | Artale, A., Kontchakov, R., Ryzhikov, V., & Zakharyaschev, M. (2014). A cookbook for temporal conceptual data modelling with description logics.ACM Trans. Comput. Log.,15(3), 25:1-25:50. · Zbl 1354.68245 |
| [12] | Baader, F., Borgwardt, S., Koopmann, P., Ozaki, A., & Thost, V. (2020a). Metric temporal description logics with interval-rigid names.ACM Trans. Comput. Log.,21(4), 30:1- 30:46. · Zbl 1446.68145 |
| [13] | Baader, F., Borgwardt, S., Koopmann, P., Thost, V., & Turhan, A. (2020b). Semantic technologies for situation awareness.K¨unstliche Intell.,34(4), 543-550. |
| [14] | Baader, F., Borgwardt, S., & Lippmann, M. (2013). Temporalizing ontology-based data access. InProc. of the 24th Int. Conf. on Automated Deduction, CADE-24, Vol. 7898 ofLNCS, pp. 330-344. Springer. · Zbl 1381.68075 |
| [15] | Baader, F., Borgwardt, S., & Lippmann, M. (2015a).Temporal conjunctive queries in expressive description logics with transitive roles. InProc. of the 28th Australasian Joint Conf. on Advances in Artificial Intelligence, AI’15, Vol. 9457 ofLNCS, pp. 21-33. Springer. |
| [16] | Baader, F., Borgwardt, S., & Lippmann, M. (2015b). Temporal query entailment in the description logic SHQ.J. Web Semant.,33, 71-93. |
| [17] | Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., & Patel-Schneider, P. F. (Eds.). (2007).The Description Logic Handbook(2nd edition). Cambridge University Press. · Zbl 1132.68055 |
| [18] | Baader, F., Horrocks, I., Lutz, C., & Sattler, U. (2017).An Introduction to Description Logic. Cambridge University Press. · Zbl 1373.68002 |
| [19] | Baader, F., K¨usters, R., & Wolter, F. (2007). Extensions to description logics. InThe Description Logic Handbook, pp. 219-261. Cambridge University Press. |
| [20] | Baget, J., Lecl‘ere, M., Mugnier, M., & Salvat, E. (2011). On rules with existential variables: Walking the decidability line.Artif. Intell.,175(9-10), 1620-1654. · Zbl 1225.68247 |
| [21] | Barcel´o, P., Berger, G., Lutz, C., & Pieris, A. (2018). First-order rewritability of frontierguarded ontology-mediated queries. InProc. of the 27th Int. Joint Conf. on Artificial Intelligence, IJCAI 2018, pp. 1707-1713. ijcai.org. |
| [22] | Baudinet, M., Chomicki, J., & Wolper, P. (1993). Temporal deductive databases. In Tansel, A. U., Clifford, J., Gadia, S. K., Segev, A., & Snodgrass, R. T. (Eds.),Temporal Databases: Theory, Design, and Implementation, pp. 294-320. Benjamin/Cummings. |
| [23] | Beck, H., Dao-Tran, M., & Eiter, T. (2018). LARS: A logic-based framework for analytic reasoning over streams.Artif. Intell.,261, 16-70. · Zbl 1448.68395 |
| [24] | Berger, R. (1966).The Undecidability of the Domino Problem. American Mathematical Society. · Zbl 0199.30802 |
| [25] | Bienvenu, M., Hansen, P., Lutz, C., & Wolter, F. (2016). First order-rewritability and containment of conjunctive queries in horn description logics. InProc. of the 29th Int. Workshop on Description Logics, DL 2016, Vol. 1577. CEUR-WS. |
| [26] | Bienvenu, M., Kikot, S., Kontchakov, R., Podolskii, V. V., Ryzhikov, V., & Zakharyaschev, M. (2017).The complexity of ontology-based data access with OWL 2 QL and bounded treewidth queries. InProc. of the 36th ACM SIGMOD-SIGACT-SIGAI Symp. on Principles of Database Systems, PODS 2017, pp. 201-216. ACM. |
| [27] | Bienvenu, M., Kikot, S., Kontchakov, R., Podolskii, V. V., & Zakharyaschev, M. (2018). Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity.J. ACM,65(5), 28:1-28:51. · Zbl 1426.68075 |
| [28] | Bienvenu, M., Kikot, S., Kontchakov, R., Ryzhikov, V., & Zakharyaschev, M. (2017). On the parametrised complexity of tree-shaped ontology-mediated queries in OWL 2 QL. InProc. of the 30th Int. Workshop on Description Logics, DL 2017, Vol. 1879. CEUR. |
| [29] | Bienvenu, M., & Ortiz, M. (2015). Ontology-mediated query answering with data-tractable description logics. InWeb Logic Rules: Tutorial Lectures at the 11th Int. Summer School on Reasoning Web, RW 2015, Vol. 9203 ofLNCS, pp. 218-307. Springer. · Zbl 1358.68086 |
| [30] | Bienvenu, M., ten Cate, B., Lutz, C., & Wolter, F. (2014). Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP.ACM Trans. Database Systems,39(4), 33:1-33:44. · Zbl 1474.68082 |
| [31] | B¨orger, E., Gr¨adel, E., & Gurevich, Y. (1997).The Classical Decision Problem. Springer. · Zbl 0865.03004 |
| [32] | Borgwardt, S., Forkel, W., & Kovtunova, A. (2022). Temporal minimal-world query answering over sparse aboxes.Theory Pract. Log. Program.,22(2), 193-228. · Zbl 1530.68250 |
| [33] | Borgwardt, S., Lippmann, M., & Thost, V. (2013). Temporal query answering in the description logic DL-Lite. InProc. of the 9th Int. Symp. on Frontiers of Combining Systems, FroCoS’13, Vol. 8152 ofLNCS, pp. 165-180. Springer. · Zbl 1398.68121 |
| [34] | Borgwardt, S., Lippmann, M., & Thost, V. (2015). Temporalizing rewritable query languages over knowledge bases.J. Web Semant.,33, 50-70. |
| [35] | Borgwardt, S., & Thost, V. (2015a). Temporal query answering in DL-Lite with negation. InProc. of the Global Conf. on Artificial Intelligence, GCAI15, Vol. 36 ofEPiC Series in Computing, pp. 51-65. |
| [36] | Borgwardt, S., & Thost, V. (2015b). Temporal query answering in the description logic EL. InProc. of the 24h Int. Joint Conf. on Artificial Intelligence, IJCAI’15, pp. 2819-2825. AAAI Press. |
| [37] | Bourgaux, C., Koopmann, P., & Turhan, A. (2019). Ontology-mediated query answering over temporal and inconsistent data.Semantic Web,10(3), 475-521. |
| [38] | Brandt, S., Kalayci, E. G., Ryzhikov, V., Xiao, G., & Zakharyaschev, M. (2018). Querying log data with metric temporal logic.J. Artif. Intell. Res.,62, 829-877. · Zbl 1451.68087 |
| [39] | Cal‘ı, A., Gottlob, G., & Pieris, A. (2012a). Towards more expressive ontology languages: The query answering problem.Artif. Intell.,193, 87-128. · Zbl 1270.68293 |
| [40] | Cal‘ı, A., Gottlob, G., & Lukasiewicz, T. (2012b). A general Datalog-based framework for tractable query answering over ontologies.J. Web Semant.,14, 57-83. |
| [41] | Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., & Rosati, R. (2007a). EQL-Lite: Effective first-order query processing in description logics. InProc. of the 20th Int. Joint Conf. on Artificial Intelligence, IJCAI 2007, pp. 274-279. |
| [42] | Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., & Rosati, R. (2007b). Tractable reasoning and efficient query answering in description logics: The DL-Lite family.J. Autom. Reasoning,39(3), 385-429. · Zbl 1132.68725 |
| [43] | Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., & Rosati, R. (2006). Data complexity of query answering in description logics. InProc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2006, pp. 260-270. AAAI Press. |
| [44] | Chomicki, J. (1994). Temporal query languages: A survey. InProc. of the 1st Int. Conf. on Temporal Logic, ICTL’94, Vol. 827 ofLNCS, pp. 506-534. Springer. · Zbl 0949.68524 |
| [45] | Chomicki, J., & Imieli´nski, T. (1988). Temporal deductive databases and infinite objects. In Proc. of the 7th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, PODS’98, pp. 61-73. ACM. |
| [46] | Chomicki, J., Toman, D., & B¨ohlen, M. H. (2001). Querying ATSQL databases with temporal logic.ACM Trans. Database Syst.,26(2), 145-178. · Zbl 1136.68377 |
| [47] | Compton, K. J., & Laflamme, C. (1990). An algebra and a logic for NC1.Inf. Comput., 87(1/2), 240-262. |
| [48] | Dell’Aglio, D., Eiter, T., Heintz, F., & Phuoc, D. L. (2019). Special issue on stream reasoning.Semantic Web,10(3), 453-455. |
| [49] | Demri, S., Goranko, V., & Lange, M. (2016).Temporal Logics in Computer Science. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press. · Zbl 1380.68003 |
| [50] | Furst, M. L., Saxe, J. B., & Sipser, M. (1984). Parity, circuits, and the polynomial-time hierarchy.Mathematical Systems Theory,17(1), 13-27. · Zbl 0534.94008 |
| [51] | Gabbay, D., Hodkinson, I., & Reynolds, M. (1994).Temporal Logic: Mathematical Foundations and Computational Aspects, Vol. 1. Oxford University Press. · Zbl 0921.03023 |
| [52] | Gabbay, D., Kurucz, A., Wolter, F., & Zakharyaschev, M. (2003).Many-Dimensional Modal Logics: Theory and Applications, Vol. 148 ofStudies in Logic. Elsevier. · Zbl 1051.03001 |
| [53] | Gerasimova, O., Kikot, S., Kurucz, A., Podolskii, V. V., & Zakharyaschev, M. (2020). A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom. InProc. of the 17th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2020, pp. 403-413. |
| [54] | Glimm, B., & Ogbuji, C. (2013). SPARQL 1.1 entailment regimes. W3C Recommendation. |
| [55] | Gutierrez, C., Hurtado, C. A., & Vaisman, A. A. (2007). Introducing time into RDF.IEEE Trans. Knowl. Data Eng.,19(2), 207-218. |
| [56] | Guti´errez-Basulto, V., Jung, J. C., & Kontchakov, R. (2016a). TemporalizedELontologies for accessing temporal data: Complexity of atomic queries. InProc. of the 25th Int. Joint Conf. on Artificial Intelligence, IJCAI’16, pp. 1102-1108. IJCAI/AAAI. |
| [57] | Guti´errez-Basulto, V., Jung, J. C., & Ozaki, A. (2016b). On metric temporal description logics. InProc. of the 22nd European Conf. on Artificial Intelligence, ECAI 2016, Vol. 285 ofFAIA, pp. 837-845. IOS Press. · Zbl 1403.68265 |
| [58] | Guti´errez-Basulto, V., Jung, J. C., & Schneider, T. (2014). Lightweight description logics and branching time: A troublesome marriage. InProc. of the 14th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR’14, pp. 278-287. AAAI. |
| [59] | Guti´errez-Basulto, V., Jung, J. C., & Schneider, T. (2015). Lightweight temporal description logics with rigid roles and restricted TBoxes. InProc. of the 24th Int. Joint Conf. on Artificial Intelligence, IJCAI 2015, pp. 3015-3021. IJCAI/AAAI. |
| [60] | Halpern, J. Y., & Vardi, M. Y. (1989). The complexity of reasoning about knowledge and time. I. Lower bounds.J. Comput. Syst. Sci.,38(1), 195-237. · Zbl 0672.03015 |
| [61] | Hampson, C., & Kurucz, A. (2015). Undecidable propositional bimodal logics and onevariable first-order linear temporal logics with counting.ACM Trans. Comput. Log., 16(3), 27:1-27:36. · Zbl 1354.03022 |
| [62] | Hodkinson, I. M., Wolter, F., & Zakharyaschev, M. (2000). Decidable fragment of first-order temporal logics.Ann. Pure Appl. Log.,106(1-3), 85-134. · Zbl 0999.03015 |
| [63] | Immerman, N. (1999).Descriptive Complexity. Springer. · Zbl 0918.68031 |
| [64] | Kamp, H. W. (1968).Tense Logic and the Theory of Linear Order. PhD thesis, Computer Science Department, University of California at Los Angeles, USA. |
| [65] | Kontchakov, R., Rezk, M., Rodriguez-Muro, M., Xiao, G., & Zakharyaschev, M. (2014). Answering SPARQL queries over databases under OWL 2 QL entailment regime. In Proc. of the 13th Int. Semantic Web Conf., ISWC 2014, Part I, Vol. 8796 ofLNCS, pp. 552-567. Springer. |
| [66] | Kontchakov, R., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2020).Boolean role inclusions in DL-Lite with and without time. InProc. of the 17th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2020, pp. 582-591. |
| [67] | Koopmann, P. (2019). Ontology-based query answering for probabilistic temporal data. In Proc. of the 33rd AAAI Conf. on Artificial Intelligence, AAAI 2019, pp. 2903-2910. |
| [68] | Kuper, G. M., Libkin, L., & Paredaens, J. (Eds.). (2000).Constraint Databases. Springer. · Zbl 0935.00022 |
| [69] | Libkin, L. (2004).Elements Of Finite Model Theory. Springer. · Zbl 1060.03002 |
| [70] | Liu, L., & ¨Ozsu, M. T. (Eds.). (2018).Encyclopedia of Database Systems, 2nd Edition. Springer. |
| [71] | Lutz, C., Areces, C., Horrocks, I., & Sattler, U. (2005). Keys, nominals, and concrete domains.J. Artif. Intell. Res. (JAIR),23, 667-726. · Zbl 1080.68683 |
| [72] | Lutz, C., Sattler, U., & Wolter, F. (2001). Modal logic and the two-variable fragment. In Proc. of the 15th Int. Workshop on Computer Science Logic, CSL 2001, and the 10th Annual Conf. of the EACSL, Vol. 2142 ofLNCS, pp. 247-261. Springer. · Zbl 0999.03020 |
| [73] | Lutz, C., Wolter, F., & Zakharyaschev, M. (2008). Temporal description logics: A survey. InProc. of the 15th Int. Symp. on Temporal Representation and Reasoning, TIME’08, pp. 3-14. IEEE Computer Society. |
| [74] | Manna, Z., & Pnueli, A. (1992).The temporal logic of reactive and concurrent systems specification. Springer. |
| [75] | Motik, B. (2012). Representing and querying validity time in RDF and OWL: A logic-based approach.J. Web Semant.,12, 3-21. |
| [76] | Ozcep, O., & M¨¨oller, R. (2014). Ontology based data access on temporal and streaming data. InProc. of the 10th Int. Summer School on Reasoning Web (RW 2014), Vol. 8714 ofLNCS, pp. 279-312. Springer. |
| [77] | Pagliarecci, F., Spalazzi, L., & Taccari, G. (2013). Reasoning with temporal ABoxes: CombiningDL-Litecorewith CTL. InProc. of the 26th Int. Workshop on Description Logics, DL’13, pp. 885-897. CEUR-WS. |
| [78] | Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., & Rosati, R. (2008). Linking data to ontologies.J. Data Semantics,10, 133-173. · Zbl 1132.68061 |
| [79] | Pratt-Hartmann, I. (2009). Data-complexity of the two-variable fragment with counting quantifiers.Inf. Comput.,207(8), 867-888. · Zbl 1183.68254 |
| [80] | Prior, A. (1956).Time and Modality. Oxford University Press. |
| [81] | Revesz, P. Z. (2000).Datalog and constraints.InConstraint Databases, pp. 155-170. Springer. |
| [82] | Ryzhikov, V., Savateev, Y., & Zakharyaschev, M. (2021).Deciding fo-rewritability of ontology-mediated queries in linear temporal logic. InProc. of the 28th Int. Symp. on Temporal Representation and Reasoning, TIME 2021, LIPIcs, pp. 6:1-7:15. Schloss Dagstuhl. · Zbl 07744953 |
| [83] | Ryzhikov, V., Walega, P. A., & Zakharyaschev, M. (2020). Temporal ontology-mediated queries and first-order rewritability: A short course. InTutorial Lectures on Reasoning Web. Declarative Artificial Intelligence - 16th Int. Summer School 2020, Vol. 12258 ofLNCS, pp. 109-148. Springer. · Zbl 1519.68266 |
| [84] | Schaerf, A. (1993). On the complexity of the instance checking problem in concept languages with existential quantification.J. Intelligent Information Systems,2(3), 265-278. |
| [85] | Schild, K. (1993). Combining terminological logics with tense logic. InProc. of the 6th Portuguese Conf. on Progress in Artificial Intelligence, EPIA’93, Vol. 727 ofLNCS, pp. 105-120. Springer. |
| [86] | Schmiedel, A. (1990). Temporal terminological logic. InProc. of the 8th National Conf. on Artificial Intelligence, AAAI’90, pp. 640-645. AAAI Press / The MIT Press. |
| [87] | Sistla, A. P., & Clarke, E. M. (1985). The complexity of propositional linear temporal logics. J. ACM,32(3), 733-749. · Zbl 0632.68034 |
| [88] | Straubing, H. (1994).Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser Verlag. · Zbl 0816.68086 |
| [89] | Tena Cucala, D. J., Walega, P. A., Cuenca Grau, B., & Kostylev, E. V. (2021). Stratified negation in datalog with metric temporal operators. InProc. of the 25th AAAI Conf. on Artificial Intelligence, AAAI 2021, pp. 6488-6495. AAAI Press. |
| [90] | Vardi, M. (1982). The complexity of relational query languages (extended abstract). InProc. of the 14th ACM SIGACT Symp. on Theory of Computing, STOC’82, pp. 137-146. |
| [91] | Vardi, M. Y. (2008). From Church and Prior to PSL. In25 Years of Model Checking History, Achievements, Perspectives, Vol. 5000 ofLNCS, pp. 150-171. Springer. · Zbl 1142.68051 |
| [92] | Walega, P. A., Cuenca Grau, B., Kaminski, M., & Kostylev, E. (2020a). DatalogMTL over the integer timeline. InProc. of the 17th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2020, pp. 768-777. |
| [93] | Walega, P. A., Cuenca Grau, B., Kaminski, M., & Kostylev, E. (2020b). Tractable fragments of datalog with metric temporal operators. InProc. of the 29th Int. Joint Conf. on Artificial Intelligence, IJCAI 2020, pp. 1919-1925. ijcai.org. |
| [94] | Xiao, G., Calvanese, D., Kontchakov, R., Lembo, D., Poggi, A., Rosati, R., & Zakharyaschev, M. (2018). Ontology-based data access: A survey. InProc. of the 27th Int. Joint Conf. on Artificial Intelligence, IJCAI 2018, pp. 5511-5519. ijcai.org. |
| [95] | Xiao, G., Ding, L., Cogrel, B., & Calvanese, D. (2019). Virtual knowledge graphs: An overview of systems and use cases.Data Intell.,1(3), 201-223 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
