Proceedings Abstracts of the Twenty-Fourth International Joint Conference on Artificial Intelligence

Distance-Bounded Consistent Query Answering / 2262
Andreas Pfandler, Emanuel Sallinger

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.