资源分类
》 资源 》论文》Consequence-based Reasoning for Description Logics with Disjunction, Inverse

Consequence-based Reasoning for Description Logics with Disjunction, Inverse

2019-11-05 | |  65 |   45 |   0
Abstract We present a consequence-based calculus for concept subsumption and classification in the description logic ALCHOIQ, which extends ALC with role hierarchies, inverse roles, number restrictions, and nominals. By using standard transformations, our calculus extends to SROIQ, which covers all of OWL 2 DL except for datatypes. A key feature of our calculus is its pay-as-you-go behaviour: unlike existing algorithms, our calculus is worst-case optimal for all the well-known proper fragments of ALCHOIQ, albeit not for the full logic.

上一篇：Reasoning about Betweenness and RCC8 Constraints in Qualitative Conceptual Spaces

下一篇：On Concept Forgetting in Description Logics with Qualified Number Restrictions

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...