Distance-Bounded Consistent Query Answering

Pfandler, Andreas; Sallinger, Emanuel

Distance-Bounded Consistent Query Answering

Download BibTeX Cite

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 2262-2268.

Abstract

The ability to perform reasoning on inconsistent data is a central problem both for AI and database research. One approach to deal with this situation is consistent query answering, where queries are answered over all possible repairs of the database. In general, the repair may be very distant from the original database. In this work we present a new approach where this distance is bounded and analyze its computational complexity. Our results show that in many (but not all) cases the complexity drops.

Andreas Pfandler, and Emanuel Sallinger. 2015. Distance-Bounded Consistent Query Answering. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 2262–2268. https://ijcai.org/proceedings/2015/320

@inproceedings{ijcai2015p320,
  title     = {Distance-Bounded Consistent Query Answering},
  author    = {Pfandler, Andreas and Sallinger, Emanuel},
  booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
               Artificial Intelligence, {IJCAI-15}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Qiang Yang and Michael Wooldridge},
  pages     = {2262--2268},
  year      = {2015},
  month     = {7},
  note      = {Main Track},
  url       = {https://ijcai.org/proceedings/2015/320},
}

TY  - CPAPER
TI  - Distance-Bounded Consistent Query Answering
AU  - Pfandler, Andreas
AU  - Sallinger, Emanuel
T2  - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2015
SP  - 2262
EP  - 2268
UR  - https://ijcai.org/proceedings/2015/320
ER  -