XPath for DL Ontologies

Applications of description logics (DLs) such as OWL 2 and ontology-based data access (OBDA) require understanding of how to pose database queries over DL knowledge bases. While there have been many studies regarding traditional relational query formalisms such as conjunctive queries and their extensions, little attention has been paid to graph database queries, despite the fact that graph databases have essentially the same structure as DLs. In particular, not much is known about the interplay between DLs and XPath. The last is a powerful formalism for querying semistructured data: it is in the core of most practical query languages for XML trees, and it is also gaining popularity in theory and practice of graph databases. In this paper we make a step towards coupling knowledge bases and graph databases by studying how to answer powerful XPath-style queries over DL-Lite and EL. We start with adapting the definition of XPath to the DL context, and then proceed to study the complexity...

• Type: Journal
• Year: 2015
• Where: AAAI
• Authors: Egor V. Kostylev, Juan L. Reutter, Domagoj Vrgoc
• Keywords: AAAI 2015, Intelligent Agents