资源分类
》 资源 》论文》Data Complexity of Query Answering in Description Logics (Extended Abstract)?

Data Complexity of Query Answering in Description Logics (Extended Abstract)?

2019-11-20 | |  61 |   37 |   0
Abstract We study the data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FOrewritability and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the DL used to express the knowledge base. What emerges from our complexity analysis is that the Description Logics of the DL-Lite family are essentially the maximal logics allowing for conjunctive query answering through standard database technology.

上一篇：Influencing Individually: Fusing Personalization and Persuasion Extended Abstract

下一篇：Common Sense Reasoning for Detection, Prevention, and Mitigation of Cyberbullying (Extended Abstract)

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Learning to learn...

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

  • A Mathematical Mo...

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