A General Modifier-based Framework for Inconsistency-Tolerant Query Answering
classification
💻 cs.AI
keywords
frameworkinconsistency-tolerantsemanticsansweringgeneralinferencequerycardinality
read the original abstract
We propose a general framework for inconsistency-tolerant query answering within existential rule setting. This framework unifies the main semantics proposed by the state of art and introduces new ones based on cardinality and majority principles. It relies on two key notions: modifiers and inference strategies. An inconsistency-tolerant semantics is seen as a composite modifier plus an inference strategy. We compare the obtained semantics from a productivity point of view.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.