Conjunctive Regular Path Queries in Lightweight Description Logics
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 761-766.
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.
@inproceedings{ijcai2013p119,
title = {Conjunctive Regular Path Queries in Lightweight Description Logics},
author = {Bienvenu, Meghyn and Ortiz, Magdalena and Simkus, Mantas},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {761--766},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/119},
}
TY - CPAPER TI - Conjunctive Regular Path Queries in Lightweight Description Logics AU - Bienvenu, Meghyn AU - Ortiz, Magdalena AU - Simkus, Mantas T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 761 EP - 766 UR - https://ijcai.org/proceedings/2013/119 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
