A General Modifier-based Framework for Inconsistency-Tolerant Query Answering

2016/02/18 by Jean Francois Baget, Baget, Jean Francois, Salem Benferhat +13
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #cs.AI

paper · pdf · doi:10.48550/arxiv.1602.05828

arxiv created 2016/02/18 · arxiv updated 2016/02/19

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.

Related

• Query Answering with Inconsistent Existential Rules under Stable Model Semantics
• Consistent Query Answering for Existential Rules with Closed Predicates
• Answering Queries with Negation over Existential Rules
• Goal-Driven Query Answering for Existential Rules with Equality
• Approximate Query Answering in Inconsistent Databases