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.
- Pub Date:
- November 2002
- Computer Science - Databases;
- Computer Science - Logic in Computer Science;
- Extended version of paper appeared in Proc. FOIKS02. Submitted by invitation to AMAI journal. Uses packages: llncs.cls, amssymb.sty, parsetree.sty. 31 pages