Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
Abstract
Generalising the state of the art, an inconsistency-tolerant semantics can be seen as a couple composed of a modifier operator and an inference strategy. In this paper we deepen the analysis of such general setting and focus on two aspects. First, we investigate the rationality properties of such semantics for existential rule knowledge bases. Second, we unfold the broad landscape of complexity results of inconsistency-tolerant semantics under a specific (yet expressive) subclass of existential rules.
Domains
Artificial Intelligence [cs.AI]| Origin | Files produced by the author(s) |
|---|
Loading...