资源分类
》 资源 》论文》Regular Path Queries in Expressive Description Logics with Nominals

Regular Path Queries in Expressive Description Logics with Nominals

2019-11-15 | |  60 |   53 |   0

Abstract Reasoning over complex queries in the DLs underlying OWL 2 is of importance in several application domains. We provide decidability and (tight) upper bounds for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in such expressive DLs; specififically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualifified number restrictions, and nominals. Our results carry over also to the DLs of the SR family, and thus have a direct impact on OWL 2

上一篇：Euclidean and Mereological Qualitative Spaces: a Study of SCC and DCC

下一篇：A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...