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
翻译:我们研究本体学调解查询的有限影响问题。我们考虑表达式查询语言、结合定期路径查询的结合(UCRPQs),扩大众所周知的共体查询的结合类别,并定期表达角色。我们研究使用描述逻辑ALC而拟订的肿瘤,并展示了紧凑的2EXPTIME引起UCRPQ的上限。我们决定程序的核心是,一种基于自动化的新技术,它引入了对投入UCRPQ所基于的确定性定型自动图案引起的解释的分层。