资源分类
》 资源 》论文》When Are Description Logic Knowledge Bases Indistinguishable?

When Are Description Logic Knowledge Bases Indistinguishable?

2019-11-20 | |  49 |   51 |   0
Abstract Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL.

上一篇：Using Social Media to Enhance Emergency Situation Awareness: Extended Abstract

下一篇：Description Logic Based Dynamic Systems: Modeling, Verification, and Synthesis

用户评价
全部评价

热门资源

  • 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...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...