scholarly journals Consistent Query Answers on Numerical Databases Under Aggregate Constraints

2005 ◽  
pp. 279-294 ◽  
Author(s):  
Sergio Flesca ◽  
Filippo Furfaro ◽  
Francesco Parisi
Keyword(s):  
Consistent Query Answers

scholarly journals First-order under-approximations of consistent query answers

2017 ◽  
Vol 83 ◽  
pp. 337-355 ◽  
Author(s):  
Floris Geerts ◽  
Fabian Pijcke ◽  
Jef Wijsen
Keyword(s):  
First Order ◽  
Consistent Query Answers

scholarly journals Consistent query answers in the presence of universal constraints

2010 ◽  
Vol 35 (1) ◽  
pp. 1-22 ◽  
Author(s):  
Sławomir Staworko ◽  
Jan Chomicki
Keyword(s):  
Consistent Query Answers

Consistent query answers from virtually integrated XML data

2010 ◽  
Vol 83 (12) ◽  
pp. 2566-2578 ◽  
Author(s):  
Zijing Tan ◽  
Chengfei Liu ◽  
Wei Wang ◽  
Baile Shi
Keyword(s):  
Xml Data ◽  
Consistent Query Answers

scholarly journals Computing Approximate Query Answers over Inconsistent Knowledge Bases

2018 ◽  
Author(s):  
Sergio Greco ◽  
Cristian Molinaro ◽  
Irina Trubitsyna
Keyword(s):  
Knowledge Base ◽  
Knowledge Bases ◽  
Query Answering ◽  
Compact Representation ◽  
Fine Grained ◽  
Polynomial Time Approximation Algorithm ◽  
Consistent Query Answering ◽  
Approximate Query ◽  
Inconsistent Knowledge ◽  
Consistent Query Answers

Consistent query answering is a principled approach for querying inconsistent knowledge bases. It relies on the notion of a "repair", that is, a maximal consistent subset of the facts in the knowledge base. One drawback of this approach is that entire facts are deleted to resolve inconsistency, even if they may still contain useful "reliable" information. To overcome this limitation, we propose a new notion of repair allowing values within facts to be updated for restoring consistency. This more fine-grained repair primitive allows us to preserve more information in the knowledge base. We also introduce the notion of a "universal repair", which is a compact representation of all repairs. Then, we show that consistent query answering in our framework is intractable (coNP-complete). In light of this result, we develop a polynomial time approximation algorithm for computing a sound (but possibly incomplete) set of consistent query answers.

Sign in / Sign up

Export Citation Format

Share Document