资源分类
》 资源 》论文》Query Conservative Extensions in Horn Description Logics with Inverse Roles

Query Conservative Extensions in Horn Description Logics with Inverse Roles

2019-10-29 | |  39 |   34 |   0
Abstract We investigate the decidability and computational complexity of query conservative extensions in Horn description logics (DLs) with inverse roles. This is more challenging than without inverse roles because characterizations in terms of unbounded homomorphisms between universal models fail, blocking the standard approach to establishing decidability. We resort to a combination of automata and mosaic techniques, proving that the problem is 2EXPTIME-complete in Horn-ALCHIF (and also in Horn-ALC and in ELI). We obtain the same upper bound for deductive conservative extensions, for which we also prove a CONEXPTIME lower bound

上一篇：Query Answering in Ontologies under Preference Rankings

下一篇：Stochastic Constraint Programming with And-Or Branch-and-Bound

用户评价
全部评价

热门资源

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