资源分类
》 资源 》论文》Complexity of Approximate Query Answering under Inconsistency in Datalog±

Complexity of Approximate Query Answering under Inconsistency in Datalog±

2019-11-05 | |  65 |   65 |   0
Abstract Several semantics have been proposed to query inconsistent ontological knowledge bases, including the intersection of repairs and the intersection of closed repairs as two approximate inconsistencytolerant semantics. In this paper, we analyze the complexity of conjunctive query answering under these two semantics for a wide range of Datalog± languages. We consider both the standard setting, where errors may only be in the database, and the generalized setting, where also the rules of a Datalog± knowledge base may be erroneous.

上一篇：Multi-agent Epistemic Planning with Common Knowledge Qiang Liu and Yongmei Liu

下一篇：Incrementally Grounding Expressions for Spatial Relations between Objects Tiago Mota1 and Mohan Sridharan2

用户评价
全部评价

热门资源

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