Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
All About Fuzzy Description Logics and Applications Kapitel lesen Erstes Kapitel lesen

2015 | OriginalPaper | Buchkapitel

Ontology-Mediated Query Answering with Data-Tractable Description Logics

verfasst von : Meghyn Bienvenu, Magdalena Ortiz

Erschienen in: Reasoning Web. Web Logic Rules

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recent years have seen an increasing interest in ontology-mediated query answering, in which the semantic knowledge provided by an ontology is exploited when querying data. Adding an ontology has several advantages (e.g. simplifying query formulation, integrating data from different sources, providing more complete answers to queries), but it also makes the query answering task more difficult. In this chapter, we give a brief introduction to ontology-mediated query answering using description logic (DL) ontologies. Our focus will be on DLs for which query answering scales polynomially in the size of the data, as these are best suited for applications requiring large amounts of data. We will describe the challenges that arise when evaluating different natural types of queries in the presence of such ontologies, and we will present algorithmic solutions based upon two key concepts, namely, query rewriting and saturation. We conclude the chapter with an overview of recent results and active areas of ongoing research.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Recent Advances in Datalog
Nächstes Kapitel Answer Set Programming: A Tour from the Basics to Advanced Development Tools and Industrial Applications
Fußnoten
1
The order of the letters is irrelevant, although some orderings are more frequent in the literature than others, e.g., \(\mathcal {SHIQ}\), vs. \(\mathcal {SHQI}\). We also point out that some DLs impose additional restrictions, for example, restricting the interaction of number restrictions and transitive roles in \(\mathcal {SHIQ}\) and \(\mathcal {SHOIQ}\).
 
3
\(\mathcal {SHIQ}\) does not support negative role inclusions. These could be added at no computational cost, and they are expressible in extensions of \(\mathcal {SHIQ}\) for which reasoning has the same complexity, like \(\mathcal {ZIQ}\) [57] and the simple fragment of \(\mathcal {SRIQ}\) [109].
 
4
Note that for simplicity, and to facilitate the comparison with \(\mathcal {I} _D\), the interpretation \(\mathcal {J} \) interprets individuals as themselves. However, we could instead have chosen domain elements distinct from the individual names.
 
5
More precisely, Datalog rules correspond to function-free Horn clauses.
 
6
The certain answer semantics is also used in other contexts, such as incomplete databases [112], data integration [142], and data exchange [6].
 
7
We recall that a decision problem (alternatively known as a recognition problem) is a problem with a yes-or-no answer.
 
8
We typically omit \(|{{\varvec{a}}}|\) since we have \(|{{\varvec{a}}}| \le |q| \cdot |\mathcal {A} |\) (or \(|{{\varvec{a}}}| \le |q| \cdot |\mathcal {D} |\)).
 
9
In this section, it will prove convenient to allow ABox assertions using the atomic concepts \(\top \) and \(\bot \), in addition to concept names. Refer to Sect. 2 for discussion.
 
10
Recall that we treat conjunctions of concepts as sets. Abusing notation, we use \(A \in M\) to mean that A is a conjunct of M.
 
11
If desired, we could use standard equivalence-preserving transformations to turn \(q_{ rew }\) into an equivalent UCQ.
 
12
A predicate is called recursive if it occurs in a cycle in the dependency graph of the Datalog program, whose nodes are the program’s predicates and which contains an edge between two predicates whenever there is a rule that contains one of the predicates in the body and the other in the head.
 
13
As earlier, we treat conjunctions of concepts as sets, ignoring order and repetitions.
 
14
We note that for \({\mathcal {ELH}} \) and DL-Lite\(_{\mathcal {R}}\), the construction is simpler as we only need to store concept names, rather than conjunctions of concept names.
 
15
The query languages considered in [132, 203] also allow unary tests to be combined using conjunctive and disjunction. A similar construct was considered in [31].
 
Literatur
1.
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co., Reading (1995)MATH
2.
Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: QuOnto: querying ontologies. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 1670–1671 (2005)
3.
Ahmetaj, S., Fischl, W., Pichler, R., Šimkus, M., Skritek, S.: Towards reconciling SPARQL and certain answers. In: Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, 18–22 May 2015, pp. 23–33 (2015)
4.
Angles, R., Gutierrez, C.: The expressive power of SPARQL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114–129. Springer, Heidelberg (2008) CrossRef
5.
Antonioli, N., Castanò, F., Coletta, S., Grossi, S., Lembo, D., Lenzerini, M., Poggi, A., Virardi, E., Castracane, P.: Ontology-based data management for the Italian Public Debt. In: Proceedings of 8th International Conference Formal Ontology in Information Systems (FOIS 2014). Frontiers in Artificial Intelligence and Applications, vol. 267, pp. 372–385. IOS Press (2014)
6.
Arenas, M., Barceló, P., Libkin, L., Murlak, F.: Foundations of Data Exchange. Cambridge University Press, Cambridge (2014) MATH
7.
Arenas, M., Gottlob, G., Pieris, A.: Expressive languages for querying the semantic web. In: Proceedings of the 33rd ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2014), pp. 14–26. ACM, New York (2014)
8.
Arenas, M., Grau, B.C., Kharlamov, E., Marciuška, S., Zheleznyakov, D.: Faceted search over ontology-enhanced RDF data. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM), pp. 939–948 (2014)
9.
Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, Cambridge (2009) CrossRefMATH
10.
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36, 1–69 (2009)MathSciNetMATH
11.
Artale, A., Franconi, E.: A temporal description logic for reasoning about actions and plans. J. Artif. Intel. Res. 9, 463–506 (1998)MathSciNetMATH
12.
Artale, A., Franconi, E.: Temporal description logics. In: Fisher, M., Gabbay, D., Vila, L. (eds.) Handbook of Time and Temporal Reasoning in Artificial Intelligence. MIT Press, Cambridge (2001)
13.
Artale, A., Franconi, E.: Temporal description logics. In: Fisher, M., Gabbay, D., Vila, L. (eds.) Handbook of Temporal Reasoning in Artificial Intelligence. Foundations of Artificial Intelligence, pp. 375–388. Elsevier, Amsterdam (2005)
14.
Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: First-order rewritability of ontology-mediated temporal queries. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
15.
Artale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: A cookbook for temporal conceptual data modelling with description logics. ACM Trans. Comput. Logic 15(3), 25:1–25:50 (2014)MathSciNetCrossRefMATH
16.
Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)
17.
Baader, F., Bienvenu, M., Lutz, C., Wolter, F.: Query and predicate emptiness in description logics. In: Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010) (2010)
18.
19.
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal EL\) envelope. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005) (2005)
20.
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal EL\) envelope further. In: Proceedings of the 5th International Workshop on OWL: Experiences and Directions (OWLED 2008) (2008)
21.
Barceló, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37(4), 31 (2012)CrossRef
22.
Barceló, P., Pérez, J., Reutter, J.L.: Relative expressiveness of nested regular expressions. In: Proceedings of AMW 2012. CEUR Workshop Proceedings, vol. 866, pp. 180–195 (2012)
23.
Barceló Baeza, P.: Querying graph databases. In: Proceedings of the 32nd ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2013), pp. 175–188 (2013)
24.
Bertossi, L.E.: Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan and Claypool Publishers, San Rafael (2011)
25.
Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI 2012) (2012)
26.
Bienvenu, M., Bourgaux, C., Goasdoué, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014) (2014)
27.
Bienvenu, M., Calvanese, D., Ortiz, M., Šimkus, M.: Nested regular path queries in description logics. In: Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2014) (2014)
28.
Bienvenu, M., ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4), 33:1–33:44 (2014)MathSciNetCrossRef
29.
Bienvenu, M., Kikot, S., Podolskii, V.V.: Tree-like queries in OWL 2 QL: succinctness and complexity results. In: Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015). IEEE (2015)
30.
Bienvenu, M., Lutz, C., Wolter, F.: First-order rewritability of atomic queries in horn description logics. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI/AAAI (2013)
31.
Bienvenu, M., Ortiz, M., Šimkus, M.: Answering expressive path queries over lightweight DL knowledge bases. In: Proceedings of the 25th International Workshop on Description Logic (DL 2012) (2012)
32.
Bienvenu, M., Ortiz, M., Šimkus, M.: Conjunctive regular path queries in lightweight description logics. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)
33.
Bienvenu, M., Ortiz, M., Šimkus, M.: Navigational queries based on frontier-guarded datalog: preliminary results. In: Proceedings of the Ninth Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015) (2015)
34.
Bienvenu, M., Ortiz, M., Šimkus, M., Xiao, G.: Tractable queries for lightweight description logics. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). AAAI Press (2013)
35.
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)
36.
Bienvenu, M., Rosati, R.: Query-based comparison of OBDA specifications. In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
37.
Borgida, A., Calvanese, D., Rodriguez-Muro, M.: Explanation in the DL-Lite family of description logics. In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part II. LNCS, vol. 5332, pp. 1440–1457. Springer, Heidelberg (2008) CrossRef
38.
Borgida, A., Franconi, E., Horrocks, I.: Explaining ALC subsumption. In: Proceedings of ECAI (2000)
39.
40.
Borgwardt, S., Thost, V.: Temporal query answering in the description logic \(\cal EL\). In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
41.
Botoeva, E., Kontchakov, R., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: Query inseparability for description logic knowledge bases. In: Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2014) (2014)
42.
Bourgaux, C., Bienvenu, M., Goasdoué, F.: Explaining query answers under inconsistency-tolerant semantics over description logic knowledge bases (extended abstract). In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
43.
Bourhis, P., Krötzsch, M., Rudolph, S.: How to best nest regular path queries. In: Proceedings of the 27th International Workshop on Description Logic (DL 2014), vol. 1193, pp. 404–415. CEUR-WS.org (2014)
44.
45.
Bursztyn, D., Goasdoué, F., Manolescu, I.: Efficient query answering in DL-Lite through FOL reformulation. In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
46.
Bursztyn, D., Goasdoué, F., Manolescu, I.: Optimizing reformulation-based query answering in RDF. In: Proceedings of the 18th International Conference on Extending Database Technology (EDBT), pp. 265–276 (2015)
47.
Cadoli, M., Donini, F.M., Schaerf, M.: Closed world reasoning in hybrid systems. In: Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems (ISMIS 1990), pp. 474–481. North-Holland Publ. Co. (1990)
48.
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)
49.
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rodriguez-Muro, M., Rosati, R., Ruzzi, M., Savo, D.F.: The MASTRO system for ontology-based data access. Seman. Web 2(1), 43–53 (2011)
50.
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: tractable description logics for ontologies. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 602–607 (2005)
51.
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: EQL-Lite: effective first-order query processing in description logics. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 274–279 (2007)
52.
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39(3), 385–429 (2007)MathSciNetCrossRefMATH
53.
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proceedings of the 17th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 1998), pp. 149–158 (1998)
54.
Calvanese, D., De Giacomo, G., Lenzerini, M.: Conjunctive query containment and answering under description logics constraints. ACM Trans. Comput. Logic 9(3), 22.1–22.31 (2008)MathSciNetCrossRef
55.
Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proceedings of the 7th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2000), pp. 176–185 (2000)
56.
Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: an automata-theoretic approach. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 391–396 (2007)
57.
Calvanese, D., Eiter, T., Ortiz, M.: Regular path queries in expressive description logics with nominals. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 714–720 (2009)
58.
Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics via alternating tree-automata. Inf. Comput. 237, 12–55 (2014)MathSciNetCrossRefMATH
59.
Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proceedings of the 10th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260–270. AAAI Press (2006)
60.
Calvanese, D., Kharlamov, E., Nutt, W., Thorne, C.: Aggregate queries over ontologies. In: Proceedings of the 2nd International Workshop on Ontologies and Information Systems for the Semantic Web, ONISW 2008, Napa Valley, California, USA, 30 October 2008, pp. 97–104 (2008)
61.
Calvanese, D., Ortiz, M., Šimkus, M.: Containment of regular path queries under description logic constraints. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011) (2011)
62.
Calvanese, D., Ortiz, M., Šimkus, M., Stefanoni, G.: Reasoning about explanations for negative query answers in DL-Lite. J. Artif. Intell. Res. (JAIR) 48, 635–669 (2013)MathSciNetMATH
63.
Carral, D., Feier, C., Cuenca Grau, B., Hitzler, P., Horrocks, I.: \(EL\)-ifying ontologies. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS, vol. 8562, pp. 464–479. Springer, Heidelberg (2014)
64.
Carral, D., Feier, C., Grau, B.C., Hitzler, P., Horrocks, I.: Pushing the boundaries of tractable ontology reasoning. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrandečić, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part II. LNCS, vol. 8797, pp. 148–163. Springer, Heidelberg (2014)
65.
Carral, D., Feier, C., Romero, A.A., Grau, B.C., Hitzler, P., Horrocks, I.: Is your ontology as hard as you think? Rewriting ontologies into simpler DLs. In: Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, 17–20 July 2014. CEUR Workshop Proceedings, vol. 1193, pp. 128–140. CEUR-WS.org (2014)
66.
Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Berlin (Germany) (1990)CrossRef
67.
Chortaras, A., Trivela, D., Stamou, G.: Optimized query rewriting for OWL 2 QL. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 192–206. Springer, Heidelberg (2011) CrossRef
68.
Chortaras, A., Trivela, D., Stamou, G.B.: Goal-oriented query rewriting for OWL 2 QL. In: Proceedings of the 24th International Workshop on Description Logics (DL) (2011)
69.
Clark, J., DeRose, S.: XML path language (XPath) version 1.0. W3C recommendation, World Wide Web consortium (1999)
70.
Colucci, S., Noia, T.D., Sciascio, E.D., Donini, F.M., Ragone, A.: Second-order description logics: semantics, motivation, and a calculus. In: Proceedings of the 23rd International Workshop on Description Logic (DL 2010). CEUR Workshop Proceedings, vol. 573. CEUR-WS.org (2010)
71.
De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 205–212 (1994)
72.
De Giacomo, G., Lenzerini, M., Rosati, R.: Higher-order description logics for domain metamodeling. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI 2011) (2011)
73.
Du, J., Qi, G., Shen, Y.D.: Weight-based consistent query answering over inconsistent \(\cal SHIQ\) knowledge bases. Knowl. Inf. Syst. 34(2), 335–371 (2013)CrossRef
74.
Du, J., Wang, K., Shen, Y.: A tractable approach to ABox abduction over description logic ontologies. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014) (2014)
75.
Du, J., Wang, K., Shen, Y.: Towards tractable and practical ABox abduction over inconsistent description logic ontologies. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) (2015)
76.
Ebbinghaus, H.D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)MATH
77.
Ehrenfeucht, A., Zeiger, P.: Complexity measures for regular expressions. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing (STOC 1974) (1974)
78.
Eiter, T., Gottlob, G., Ortiz, M., Šimkus, M.: Query Answering in the Description Logic Horn-\(\cal SHIQ\). In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 166–179. Springer, Heidelberg (2008) CrossRef
79.
Eiter, T., Lutz, C., Ortiz, M., Šimkus, M.: Query answering in description logics: the knots approach. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 26–36. Springer, Heidelberg (2009) CrossRef
80.
Eiter, T., Lutz, C., Ortiz, M., Šimkus, M.: Query answering in description logics with transitive roles. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 759–764 (2009)
81.
Eiter, T., Ortiz, M., Simkus, M., Tran, T., Xiao, G.: Query rewriting for Horn-SHIQ plus rules. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI 2012). AAAI Press (2012)
82.
Eiter, T., Ortiz, M., Šimkus, M.: Conjunctive query answering in the description logic SH using knots. J. Comput. Syst. Sci. 78(1), 47–85 (2012)MathSciNetCrossRefMATH
83.
Feier, C., Carral, D., Stefanoni, G., Grau, B.C., Horrocks, I.: The combined approach to query answering beyond the OWL 2 profiles. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
84.
Florescu, D., Levy, A., Suciu, D.: Query containment for conjunctive queries with regular expressions. In: Proceedings of the 17th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 1998), pp. 139–148 (1998)
85.
Franconi, E., Guagliardo, P., Trevisan, M., Tessaris, S.: Quelo: an ontology-driven query interface. In: Proceedings of the 24th International Workshop on Description Logics (DL) (2011)
86.
Franconi, E., Ibáñez-García, Y.A., Seylan, I.: Query answering with DBoxes is hard. Electr. Notes Theor. Comput. Sci. 278, 71–84 (2011)MathSciNetCrossRefMATH
87.
Gabbay, D., Kurusz, A., Wolter, F., Zakharyaschev, M.: Many-dimensional Modal Logics: Theory and Applications. Elsevier Science Publishers, Amsterdam (2003) MATH
88.
Glimm, B.: Using SPARQL with RDFS and OWL entailment. In: Polleres, A., d’Amato, C., Arenas, M., Handschuh, S., Kroner, P., Ossowski, S., Patel-Schneider, P. (eds.) Reasoning Web 2011. LNCS, vol. 6848, pp. 137–201. Springer, Heidelberg (2011)
89.
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \(\cal SHIQ\). J. Artif. Intell. Res. 31, 151–198 (2008)MathSciNetMATH
90.
Glimm, B., Horrocks, I., Sattler, U.: Unions of conjunctive queries in SHOQ. In: Proceedings of the 11th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2008), pp. 252–262. AAAI Press/MIT Press (2008)
91.
Glimm, B., Kazakov, Y., Lutz, C.: Status QIO: an update. In: Proceedings of the 22nd International Workshop on Description Logic (DL 2009). CEUR Workshop Proceedings, vol. 745 (2011)
92.
Glimm, B., Rudolph, S., Völker, J.: Integrated metamodeling and diagnosis in OWL 2. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 257–272. Springer, Heidelberg (2010) CrossRef
93.
Gottlob, G., Kikot, S., Kontchakov, R., Podolskii, V., Schwentick, T., Zakharyaschev, M.: The price of query rewriting in ontology-based data access. Artif. Intell. 213, 42–59 (2014)MathSciNetCrossRefMATH
94.
Gottlob, G., Manna, M., Pieris, A.: Polynomial combined rewritings for existential rules. In: Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2014) (2014)
95.
Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: rewriting and optimization. In: IEEE 27th International Conference on Data Engineering 2011 (ICDE), April 2011, pp. 2–13 (2011)
96.
Gottlob, G., Orsi, G., Pieris, A., Šimkus, M.: Datalog and its extensions for semantic web databases. In: Eiter, T., Krennwallner, T. (eds.) Reasoning Web 2012. LNCS, vol. 7487, pp. 54–77. Springer, Heidelberg (2012)
97.
Gottlob, G., Rudolph, S., Šimkus, M.: Expressiveness of guarded existential rule languages. In: Proceedings of the 33rd ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2014), pp. 27–38. ACM, New York (2014)
98.
Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 745. CEUR-WS.org (2011)
99.
Grahne, G., Thomo, A.: Query containment and rewriting using views for regular path queries under constraints. In: Proceedings of the 22nd ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2003), pp. 111–122 (2003)
100.
Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: Modular reuse of ontologies: theory and practice. J. Artif. Intell. Res. (JAIR) 31, 273–318 (2008)MathSciNetMATH
101.
Gutiérrez-Basulto, V., Ibañez-García, Y., Kontchakov, R., Kostylev, E.V.: Conjunctive queries with negation over DL-Lite: a closer look. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 109–122. Springer, Heidelberg (2013) CrossRef
102.
Gutiérrez-Basulto, V., Jung, J.C., Schneider, T.: Lightweight description logics and branching time: a troublesome marriage. In: Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2014) (2014)
103.
Gutierrez-Basulto, V., Jung, J.C., Schneider, T.: Lightweight temporal description logics with rigid roles and restricted TBoxes. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
104.
Gutiérrez-Basulto, V., Klarman, S.: Towards a unifying approach to representing and querying temporal data in description logics. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 90–105. Springer, Heidelberg (2012) CrossRef
105.
106.
107.
Horridge, M., Bail, S., Parsia, B., Sattler, U.: The cognitive complexity of OWL justifications. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 241–256. Springer, Heidelberg (2011) CrossRef
108.
Horridge, M., Parsia, B., Sattler, U.: Extracting justifications from BioPortal ontologies. In: Cudré-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012, Part II. LNCS, vol. 7650, pp. 287–299. Springer, Heidelberg (2012) CrossRef
109.
Horrocks, I., Kutz, O., Sattler, U.: The irresistible \(\cal SRIQ\). In: Proceedings of the 1st International Workshop on OWL: Experiences and Directions (OWLED 2005) (2005)
110.
Horrocks, I., Tessaris, S.: A conjunctive query language for description logic ABoxes. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 399–404 (2000)
111.
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 466–471 (2005)
112.
113.
114.
Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.A.: Debugging unsatisfiable classes in OWL ontologies. J. Web Seman. 3(4), 268–293 (2005)CrossRef
115.
Kaminski, M., Grau, B.C.: Computing Horn rewritings of description logics ontologies. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015). http://​arxiv.​org/​abs/​1504.​05150
116.
Kaminski, M., Nenov, Y., Cuenca Grau, B.: Computing datalog rewritings for disjunctive datalog programs and description logic ontologies. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 76–91. Springer, Heidelberg (2014)
117.
Kazakov, Y.: Consequence-driven reasoning for horn SHIQ ontologies. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 2040–2045 (2009)
118.
Kikot, S., Kontchakov, R., Zakharyaschev, M.: On (In)Tractability of OBDA with OWL 2 QL. In: Proceedings of the 24th International Workshop on Description Logic (DL 2011). CEUR Workshop Proceedings, vol. 745. CEUR-WS.org (2011)
119.
Kikot, S., Kontchakov, R., Zakharyaschev, M.: Conjunctive query answering with OWL 2 QL. In: Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2012), pp. 275–285. AAAI Press (2012)
120.
Kikot, S., Kontchakov, R., Podolskii, V., Zakharyaschev, M.: Exponential lower bounds and separation for query rewriting. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 263–274. Springer, Heidelberg (2012) CrossRef
121.
Kikot, S., Kontchakov, R., Podolskii, V.V., Zakharyaschev, M.: On the succinctness of query rewriting over OWL 2 QL ontologies with shallow chases. In: Proceedings of the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2014). ACM Press (2014)
122.
Klenke, T.: Über die Entscheidbarkeit von Konjunktiv Anfragen mit Ungleichheit in der Beschreibungslogik \(\cal EL\). Master’s thesis, Universität Bremen (2010)
123.
Konev, B., Kontchakov, R., Ludwig, M., Schneider, T., Wolter, F., Zakharyaschev, M.: Conjunctive query inseparability of OWL 2 QL TBoxes. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) (2011)
124.
König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: A sound and complete backward chaining algorithm for existential rules. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 122–138. Springer, Heidelberg (2012) CrossRef
125.
König, M., Leclère, M., Mugnier, M.L.: Query rewriting for existential rules with compiled preorder. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
126.
Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to ontology-based data access. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 2656–2661. IJCAI/AAAI (2011)
127.
Kontchakov, R., Pulina, L., Sattler, U., Schneider, T., Selmer, P., Wolter, F., Zakharyaschev, M.: Minimal module extraction from DL-Lite ontologies using QBF solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 836–841 (2009)
128.
Kontchakov, R., Rodríguez-Muro, M., Zakharyaschev, M.: Ontology-based data access with databases: a short course. In: Rudolph, S., Gottlob, G., Horrocks, I., van Harmelen, F. (eds.) Reasoning Weg 2013. LNCS, vol. 8067, pp. 194–229. Springer, Heidelberg (2013)
129.
Kontchakov, R., Wolter, F., Zakharyaschev, M.: Logic-based ontology comparison and module extraction, with an application to DL-Lite. Artif. Intell. 174(15), 1093–1141 (2010)MathSciNetCrossRefMATH
130.
Kostylev, E.V., Cuenca Grau, B.: On the semantics of SPARQL queries with optional matching under entailment regimes. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrandečić, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part II. LNCS, vol. 8797, pp. 374–389. Springer, Heidelberg (2014)
131.
Kostylev, E.V., Reutter, J.L.: Answering counting aggregate queries over ontologies of the DL-Lite family. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI 2013) (2013)
132.
Kostylev, E.V., Reutter, J.L., Vrgoc, D.: XPath for DL ontologies. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) (2015)
133.
Krisnadhi, A., Lutz, C.: Data complexity in the \(\cal {EL}\) family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333–347. Springer, Heidelberg (2007) CrossRef
134.
Krötzsch, M., Rudolph, S.: Conjunctive queries for \(\cal EL\) with composition of roles. In: Proceedings of the 20th International Workshop on Description Logic (DL 2007) (2007)
135.
Krötzsch, M., Rudolph, S., Hitzler, P.: Conjunctive queries for a tractable fragment of OWL 1.1. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 310–323. Springer, Heidelberg (2007) CrossRef
136.
Krötzsch, M., Rudolph, S., Hitzler, P.: Complexities of Horn description logics. ACM Trans. Comput. Logic 14(1), 2:1–2:36 (2013)MathSciNetCrossRefMATH
137.
Krotzsch, M., Simancik, F., Horrocks, I.: Description logics. IEEE Intell. Syst. 29(1), 12–19 (2014)CrossRef
138.
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010) CrossRef
139.
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Query rewriting for inconsistent DL-Lite ontologies. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 155–169. Springer, Heidelberg (2011) CrossRef
140.
Lembo, D., Mora, J., Rosati, R., Savo, D.F., Thorstensen, E.: Towards mapping analysis in ontology-based data access. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 108–123. Springer, Heidelberg (2014)
141.
Lembo, D., Mora, J., Rosati, R., Savo, D.F., Thorstensen, E.: Mapping analysis in ontology-based data access: algorithms and complexity. In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
142.
Lenzerini, M.: Data integration: a theoretical perspective. In: Proceedings of the 21st ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2002), pp. 233–246 (2002)
143.
Lenzerini, M., Lepore, L., Poggi, A.: Making metaquerying practical for Hi(DL-Lite\(_{R}\)) knowledge bases. In: Meersman, R., Panetto, H., Dillon, T., Missikoff, M., Liu, L., Pastor, O., Cuzzocrea, A., Sellis, T. (eds.) OTM 2014. LNCS, vol. 8841, pp. 580–596. Springer, Heidelberg (2014)
144.
145.
146.
Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\cal EL\) using a relational database system. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 2070–2075. AAAI Press (2009)
147.
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) CrossRef
148.
Lutz, C.: Two upper bounds for conjunctive query answering in SHIQ. In: Proceedings of the 22nd International Workshop on Description Logic (DL 2008). CEUR Workshop Proceedings, vol. 353. CEUR-WS.org (2008)
149.
Lutz, C., Seylan, I., Toman, D., Wolter, F.: The combined approach to OBDA: taming role hierarchies using filters. In: Alani, H., Kagal, L., Fokoue, A., Groth, P., Biemann, C., Parreira, J.X., Aroyo, L., Noy, N., Welty, C., Janowicz, K. (eds.) ISWC 2013, Part I. LNCS, vol. 8218, pp. 314–330. Springer, Heidelberg (2013) CrossRef
150.
Lutz, C., Seylan, I., Wolter, F.: Ontology-based data access with closed predicates is inherently intractable (sometimes). In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI/AAAI (2013)
151.
Lutz, C., Seylan, I., Wolter, F.: Ontology-mediated queries with closed predicates. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
152.
Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\cal EL\) using a relational database system. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 2070–2075 (2009)
153.
Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic \(\cal EL\). J. Symb. Comput. 45(2), 194–228 (2010)MathSciNetCrossRefMATH
154.
Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: a survey. In: Proceedings 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3–14. IEEE Computer Society (2008)
155.
McGuinness, D.L., Borgida, A.: Explaining subsumption in description logics. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995) (1995)
156.
Mora, J., Corcho, Ó.: Engineering optimisations in query rewriting for OBDA. In: Proceedings of the 9th International Conference on Semantic Systems (I-SEMANTICS), pp. 41–48 (2013)
157.
Motik, B.: On the properties of metamodeling in OWL. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 548–562. Springer, Heidelberg (2005) CrossRef
158.
Motik, B.: Reasoning in description logics using resolution and deductive databases. Ph.D. thesis, Univesität Karlsruhe (TH), Karlsruhe, Germany, January 2006
159.
160.
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 549–563. Springer, Heidelberg (2004) CrossRef
161.
Mugnier, M.-L., Thomazo, M.: An introduction to ontology-based query answering with existential rules. In: Koubarakis, M., Stamou, G., Stoilos, G., Horrocks, I., Kolaitis, P., Lausen, G., Weikum, G. (eds.) Reasoning Web. LNCS, vol. 8714, pp. 245–278. Springer, Heidelberg (2014)
162.
Ngo, N., Ortiz, M., Šimkus, M.: The combined complexity of reasoning with closed predicates in description logics. In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
163.
Ortiz, M.: Ontology based query answering: the story so far. In: Proceedings of the Seventh Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2013) (2013)
164.
Ortiz, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via Tableaux. J. Autom. Reason. 41(1), 61–98 (2008)MathSciNetCrossRefMATH
165.
Ortiz, M., Rudolph, S., Šimkus, M.: Query answering is undecidable in DLs with regular expressions, inverses, nominals, and counting. Technical report, INFSYS RR-1843-10-03, Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria, April 2010
166.
Ortiz, M., Rudolph, S., Šimkus, M.: Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1039–1044. IJCAI/AAAI (2011)
167.
Ortiz, M., Šimkus, M., Eiter, T.: Worst-case optimal conjunctive query answering for an expressive description logic without inverses. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 504–510. AAAI Press (2008)
168.
Ortiz, M., Šimkus, M.: Reasoning and query answering in description logics. In: Eiter, T., Krennwallner, T. (eds.) Reasoning Web 2012. LNCS, vol. 7487, pp. 1–53. Springer, Heidelberg (2012)
169.
Ortiz, M., Šimkus, M.: Revisiting the hardness of query answering in expressive description logics. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 216–223. Springer, Heidelberg (2014)
170.
171.
Pan, J.Z., Horrocks, I.: OWL FA: a metamodeling extension of OWL DL. In: Proceedings of the 15th International Conference on World Wide Web, WWW 2006, pp. 1065–1066. ACM, New York (2006)
172.
Papadimitriou, C.H.: Computational Complexity. Addison Wesley Publ. Co., Boston (1994)MATH
173.
Peñaloza, R., Sertkaya, B.: Complexity of axiom pinpointing in the DL-Lite family of description logics. In: Proceedings of ECAI (2010)
174.
Pérez, J., Arenas, M., Gutierrez, C.: nSPARQL: a navigational language for RDF. J. Web Seman. 8(4), 255–270 (2010)CrossRef
175.
Pérez-Urbina, H., Horrocks, I., Motik, B.: Efficient query answering for OWL 2. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 489–504. Springer, Heidelberg (2009) CrossRef
176.
Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. J. Appl. Logic 8(2), 186–209 (2010)MathSciNetCrossRefMATH
177.
Pinto, F.D., Lembo, D., Lenzerini, M., Mancini, R., Poggi, A., Rosati, R., Ruzzi, M., Savo, D.F.: Optimizing query rewriting in ontology-based data access. In: Proceedings of the 16th International Conference on Extending Database Technology (EDBT), pp. 561–572 (2013)
178.
Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Seman. 10, 133–173 (2008)MATH
179.
180.
Reutter, J., Romero, M., Vardi, M.Y.: Regular queries on graph databases. In: Proceedings of ICDT 2015 (2015)
181.
Rodríguez-Muro, M., Kontchakov, R., Zakharyaschev, M.: Ontology-based data access: Ontop of databases. In: Alani, H., Kagal, L., Fokoue, A., Groth, P., Biemann, C., Parreira, J.X., Aroyo, L., Noy, N., Welty, C., Janowicz, K. (eds.) ISWC 2013, Part I. LNCS, vol. 8218, pp. 558–573. Springer, Heidelberg (2013) CrossRef
182.
Rodriguez-Muro, M., Calvanese, D.: High performance query answering over DL-Lite ontologies. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2012). AAAI Press, Menlo Park, CA (2012)
183.
Rosati, R.: Prexto: query rewriting under extensional constraints in DL-Lite. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 360–374. Springer, Heidelberg (2012) CrossRef
184.
Rosati, R.: DL+log: tight integration of description logics and disjunctive datalog. In: Proceedings of the 10th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 68–98 (2006)
185.
Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 164–178. Springer, Heidelberg (2006) CrossRef
186.
Rosati, R.: On conjunctive query answering in \(\cal EL\). In: Proceedings of the 20th International Workshop on Description Logic (DL 2007) (2007)
187.
Rosati, R.: On the complexity of dealing with inconsistency in description logic ontologies. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011) (2011)
188.
Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010) (2010)
189.
Rosati, R., Ruzzi, M., Graziosi, M., Masotti, G.: Evaluation of techniques for inconsistency handling in OWL 2 QL ontologies. In: Cudré-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012, Part II. LNCS, vol. 7650, pp. 337–349. Springer, Heidelberg (2012) CrossRef
190.
Rudolph, S.: Foundations of description logics. In: Polleres, A., d’Amato, C., Arenas, M., Handschuh, S., Kroner, P., Ossowski, S., Patel-Schneider, P. (eds.) Reasoning Web 2011. LNCS, vol. 6848, pp. 76–136. Springer, Heidelberg (2011)
191.
Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!. J. Artif. Intell. Res. 39, 429–481 (2010)MathSciNetMATH
192.
Rudolph, S., Krötzsch, M.: Flag & check: data access with monadically defined queries. In: Proceedings of the 32nd ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2013), pp. 151–162. ACM (2013)
193.
Schaerf, A.: Reasoning with individuals in concept languages. In: Torasso, P. (ed.) AI*IA 1993. LNCS, vol. 728, pp. 108–119. Springer, Heidelberg (1993) CrossRef
194.
Schild, K.: Combining terminological logics with tense logic. In: Damas, L.M.M., Filgueiras, M. (eds.) EPIA 1993. LNCS, vol. 727, pp. 105–120. Springer, Heidelberg (1993) CrossRef
195.
Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003) (2003)
196.
Sebastiani, R., Vescovi, M.: Axiom pinpointing in lightweight description logics via Horn-SAT encoding and conflict analysis. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 84–99. Springer, Heidelberg (2009) CrossRef
197.
Seylan, I., Franconi, E., de Bruijn, J.: Effective query rewriting with ontologies over DBoxes. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 923–925 (2009)
198.
Shmueli, O.: Decidability and expressiveness aspects of logic queries. In: Proceedings of the 6th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 1987), pp. 237–249 (1987)
199.
Sioutos, N., de Coronado, S., Haber, M., Hartel, F., Shaiu, W., Wright, L.: NCI thesaurus: a semantic model integrating cancer-related clinical and molecular information. J. Biomed. Inf. 40(1), 30–43 (2006)CrossRef
200.
Soylu, A., Kharlamov, E., Zheleznyakov, D., Jiménez-Ruiz, E., Giese, M., Horrocks, I.: OptiqueVQS: visual query formulation for OBDA. In: Informal Proceedings of the 27th International Workshop on Description Logics (DL), pp. 725–728 (2014)
201.
Stefanoni, G., Motik, B.: Answering conjunctive queries over EL knowledge bases with transitive and reflexive roles. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 1611–1617. AAAI Press (2015)
202.
Stefanoni, G., Motik, B., Horrocks, I.: Introducing nominals to the combined query answering approaches for EL. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007). AAAI Press (2013)
203.
Stefanoni, G., Motik, B., Krötzsch, M., Rudolph, S.: The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases. J. Artif. Intell. Res. (JAIR) 51, 645–705 (2014)MathSciNetMATH
204.
Stuckenschmidt, H., Parent, C., Spaccapietra, S. (eds.): Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization. Lecture Notes in Computer Science, vol. 5445. Springer, Heidelberg (2009)MATH
205.
Ashburner, M., Ball, C.A., Blake, J.A., Botstein, D., Butler, H., Cherry, J.M., Davis, A.P., Dolinski, K., Dwight, S.S., Eppig, J.T., Harris, M.A., Hill, D.P., Issel-Tarver, L., Kasarskis, A., Lewis, S., Matese, J.C., Richardson, J.E., Ringwald, M., Rubin, G.M., Sherlock, G.: Gene ontology: tool for the unification of biology. Nat. Genet. 25, 25–29 (2000)CrossRef
206.
Thomazo, M.: Compact rewritings for existential rules. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)
207.
Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.: Optimising resolution-based rewriting algorithms for OWL ontologies. J. Web Seman. (2015, to appear)
208.
Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.: Query rewriting in Horn-\(\cal SHIQ\) (extended abstract). In: Proceedings of the 29th International Workshop on Description Logic (DL 2015) (2015)
209.
Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the 14th ACM SIGACT Symposium on Theory of Computing (STOC 1982), pp. 137–146 (1982)
210.
Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proceedings of the 14th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 1995), pp. 266–276 (1995)
211.
Venetis, T., Stoilos, G., Stamou, G.B.: Query extensions and incremental query rewriting for OWL 2 QL ontologies. J. Data Seman. 3(1), 1–23 (2014)CrossRef
212.
Zhou, Y., Nenov, Y., Cuenca Grau, B., Horrocks, I.: Pay-as-you-go OWL query answering using a triple store. In: Proceedings of the 28th Conference on Artificial Intelligence (AAAI 2014), pp. 1142–1148 (2014)
Metadaten
Titel
Ontology-Mediated Query Answering with Data-Tractable Description Logics
verfasst von
Meghyn Bienvenu
Magdalena Ortiz
Copyright-Jahr
2015
Buch
Reasoning Web. Web Logic Rules

Print ISBN: 978-3-319-21767-3

Electronic ISBN: 978-3-319-21768-0

Copyright-Jahr: 2015

DOI
https://doi.org/10.1007/978-3-319-21768-0_9