资源分类
》 资源 》论文》Distance-Bounded Consistent Query Answering

Distance-Bounded Consistent Query Answering

2019-11-19 | |  62 |   55 |   0
Abstract The ability to perform reasoning on inconsistent data is a central problem both for AI and database research. One approach to deal with this situation is consistent query answering, where queries are answered over all possible repairs of the database. In general, the repair may be very distant from the original database. In this work we present a new approach where this distance is bounded and analyze its computational complexity. Our results show that in many (but not all) cases the complexity drops.

上一篇：Scalable Graph Hashing with Feature Transformation

下一篇：Personalized Sentiment Classification Based on Latent Individuality of Microblog Users

用户评价
全部评价

热门资源

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

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...