Skip to Main content Skip to Navigation
New interface
Journal articles

Prioritized Repairing and Consistent Query Answering in Relational Databases

Abstract : A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.
Document type :
Journal articles
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Slawomir Staworko Connect in order to contact the contributor
Submitted on : Thursday, April 5, 2012 - 10:42:12 PM
Last modification on : Friday, November 18, 2022 - 9:27:54 AM
Long-term archiving on: : Tuesday, December 13, 2016 - 6:49:06 PM


Files produced by the author(s)




Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski. Prioritized Repairing and Consistent Query Answering in Relational Databases. Annals of Mathematics and Artificial Intelligence, 2012, Special SUM'08 issue, ⟨10.1007/s10472-012-9288-8⟩. ⟨hal-00643104⟩



Record views


Files downloads