资源分类
》 资源 》论文》Finite Model Reasoning in Hybrid Classes of Existential Rules

Finite Model Reasoning in Hybrid Classes of Existential Rules

2019-11-05 | |  53 |   34 |   0
Abstract Two paradigmatic restrictions that have been studied for ensuring the decidability of query answering under existential rules are guardedness and stickiness. With the aim of consolidating these restrictions, a flexible condition, called tameness, has been proposed a few years ago, which relies on hybrid reasoning, i.e., a combination of forward and backward procedures. The complexity of query answering under this hybrid class of existential rules is by now well-understood. However, the complexity of finite query answering, i.e., query answering under finite models, has remained an open problem. Closing this problem is the main goal of this work.

上一篇：Possibilistic ASP Base Revision by Certain Input

下一篇：Computing Approximate Query Answers over Inconsistent Knowledge Bases

用户评价
全部评价

热门资源

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