资源分类
》 资源 》论文》Non-Objection Inference for Inconsistency-Tolerant Query Answering

Non-Objection Inference for Inconsistency-Tolerant Query Answering

2019-11-25 | |  47 |   49 |   0
Abstract Repair based techniques are a standard way of dealing with inconsistency in the context of ontology based data access. We propose a novel non-objection inference relation (along with its variants) where a query is considered as valid if it follows from at least one repair and it is consistent with all the repairs. These inferences are strictly more productive than universal inference while preserving the consistency of its set of conclusions. We study the productivity and properties of the new inferences. We also give experimental results of the proposed non-objection inference.

上一篇：Inferring Motif-Based Diffusion Models for Social Networks

下一篇：Multi-Source Iterative Adaptation for Cross-Domain Classification

用户评价
全部评价

热门资源

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