Anni-Yasmin Turhan

Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics

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 algorith…