Computer Science – Databases
Scientific paper
2002-07-26
Computer Science
Databases
34 pages
Scientific paper
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.
Arenas Marcelo
Bertossi Leopoldo
Chomicki Jan
No associations
LandOfFree
Answer Sets for Consistent Query Answering in Inconsistent Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Answer Sets for Consistent Query Answering in Inconsistent Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Answer Sets for Consistent Query Answering in Inconsistent Databases will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-157733