Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Abstract
Classical regular path queries (RPQs) can be too restrictive for some applications and answering such queries under approximate semantics to relax the query is desirable. While for answering regular path queries over graph databases under approximate semantics algorithms are available, such algorithms are scarce for the ontology-mediated setting. In this paper we extend an approach for answering RPQs over graph databases that uses weighted transducers to approximate paths from the query in two ways. The first extension is to answering approximate conjunctive two-way regular path queries (C2RPQs) over graph databases and the second is to answering C2RPQs over ELH and DL-LiteR ontologies. We provide results on the computational complexity of the underlying reasoning problems and devise approximate query answering algorithms.
Details
Original language | English |
---|---|
Title of host publication | 35th AAAI Conference on Artificial Intelligence, AAAI 2021 |
Publisher | AAAI Press |
Pages | 6340-6348 |
Number of pages | 9 |
ISBN (print) | 978-171383597-4 |
Publication status | Published - 2021 |
Peer-reviewed | Yes |
Conference
Title | Thirty-Fifth AAAI Conference on Artificial Intelligence |
---|---|
Abbreviated title | AAAI-21 |
Duration | 2 - 9 February 2021 |
Degree of recognition | International event |
City | Virtual |
External IDs
Scopus | 85130026037 |
---|