资源分类
》 资源 》论文》The Complexity of Subsumption in Fuzzy EL

The Complexity of Subsumption in Fuzzy EL

2019-11-19 | |  42 |   42 |   0
Abstract Fuzzy Description Logics (DLs) are used to represent and reason about vague and imprecise knowledge that is inherent to many application domains. It was recently shown that the complexity of reasoning in finitely valued fuzzy DLs is often not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many biomedical ontologies, under the ?ukasiewicz semantics. The complexity of reasoning increases from PT IME to E XP T IME, even if only one additional truth value is introduced. The same lower bound holds also for infinitely valued ?ukasiewicz extensions of EL.

上一篇：On the Entailment Problem for a Logic of Typicality

下一篇：Temporal Query Answering in the Description Logic EL

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

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

  • A Mathematical Mo...

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