Conjunctive regular path queries in lightweight description logics

Authors:
Meghyn Bienvenu;Magdalena Ortiz;Mantas Šimkus
Affiliations:
Laboratoire de Recherche en Informatique, CNRS & Université Paris Sud, France;Institute of Information Systems, Vienna University of Technology, Austria;Institute of Information Systems, Vienna University of Technology, Austria
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 12
Cited 0

GraphLog: a visual formalism for real life recursion

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Answering regular path queries in expressive description logics: an automata-theoretic approach

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Regular path queries in expressive description logics with nominals

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The DL-lite family and relations

Journal of Artificial Intelligence Research
Data complexity in the ƐL family of description logics

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Expressive languages for path queries over graph-structured data

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
nSPARQL: A navigational language for RDF

Web Semantics: Science, Services and Agents on the World Wide Web
Query answering in the horn fragments of the description logics SHOIQ and SROIQ

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive queries and have been extensively studied in the database community. Somewhat surprisingly, there has been little work aimed at using such queries in the context of description logic (DL) knowledge bases, and all existing results target expressive DLs, even though lightweight DLs are considered better-suited for data-intensive applications. This paper aims to bridge this gap by providing algorithms and tight complexity bounds for answering two-way conjunctive regular path queries over DL knowledge bases formulated in lightweight DLs of the DL-Lite and EL families.