论文标题
在ALC本体论上的UCRPQ有限
Finite Entailment of UCRPQs over ALC Ontologies
论文作者
论文摘要
我们研究了本体论介导的查询有限的问题。我们考虑表达性的查询语言，即常规路径查询的工会（UCRPQ），扩展了众所周知的连接查询阶层，并具有正则表达式。我们查看使用描述逻辑ALC制定的本体，并显示一个紧密的2Expime上限，以实现UCRPQ。在我们的决策过程的核心中，有一种基于自动机的新技术引入了由输入UCRPQ的确定性有限自动机引起的解释分层
We investigate the problem of finite entailment of ontology-mediated queries. We consider the expressive query language, unions of conjunctive regular path queries (UCRPQs), extending the well-known class of union of conjunctive queries, with regular expressions over roles. We look at ontologies formulated using the description logic ALC, and show a tight 2EXPTIME upper bound for entailment of UCRPQs. At the core of our decision procedure, there is a novel automata-based technique introducing a stratification of interpretations induced by the deterministic finite automaton underlying the input UCRPQ
