2002/07/26 by Marcelo Arenas, Arenas, Marcelo, Leopoldo Bertossi +3
Computer Science · #Bayesian Modeling and Causal Inference #Databases (cs.DB) #F.4.1 #FOS: Computer and information sciences #H.2.3 #I.2.3 #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.DB
paper · pdf · doi:10.48550/arxiv.cs/0207094
34 pages
arxiv created 2002/07/26 · openalex publication_date 2002/07/26 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the constraints. In this paper we apply logic programming based on answer sets to the problem of retrieving consistent information from a possibly inconsistent database. Since consistent information persists from the original database to every of its minimal repairs, the approach is based on a specification of database repairs using disjunctive logic programs with exceptions, whose answer set semantics can be represented and computed by systems that implement stable model semantics. These programs allow us to declare persistence by defaults and repairing changes by exceptions. We concentrate mainly on logic programs for binary integrity constraints, among which we find most of the integrity constraints found in practice.