2002/11/29 by Leopoldo Bertossi, Bertossi, Leopoldo, Camilla Schwind +1
Computer Science · Decision Sciences · #Advanced Database Systems and Queries #Data Quality and Management #Databases (cs.DB) #F4 #FOS: Computer and information sciences #H2 #I2 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #cs.DB #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0211042
Extended version of paper appeared in Proc. FOIKS02. Submitted by invitation to AMAI journal. Uses packages: llncs.cls, amssymb.sty, parsetree.sty. 31 pages
arxiv created 2002/11/29 · openalex publication_date 2002/11/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article, we characterize in terms of analytic tableaux the repairs of inconsistent relational databases, that is databases that do not satisfy a given set of integrity constraints. For this purpose we provide closing and opening criteria for branches in tableaux that are built for database instances and their integrity constraints. We use the tableaux based characterization as a basis for consistent query answering, that is for retrieving from the database answers to queries that are consistent wrt the integrity constraints.