资源分类
》 资源 》论文》First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

2019-11-22 | |  61 |   53 |   0
Abstract We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from E XP T IME via NE XP T IME to 2E XP T IME, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise.

上一篇：Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases

下一篇：Automated Synthesis of Timed Failure Propagation Graphs

用户评价
全部评价

热门资源

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