Answer sets for consistent query answering in inconsistent databases

Simple item page
dc.contributor.authorArenas, M
dc.contributor.authorBertossi, L
dc.contributor.authorChomicki, J
dc.date.accessioned2025-01-21T01:09:15Z
dc.date.available2025-01-21T01:09:15Z
dc.date.issued2003
dc.description.abstractA 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 default of data from the original instance to the repairs; and changes to restore consistency, by exceptions. We concentrate mainly on logic programs for binary integrity constraints, among which we find most of the integrity constraints found in practice.
dc.fuente.origenWOS
dc.identifier.doi10.1017/S1471068403001832
dc.identifier.eissn1475-3081
dc.identifier.issn1471-0684
dc.identifier.urihttps://doi.org/10.1017/S1471068403001832
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/96562
dc.identifier.wosidWOS:000184567800002
dc.language.isoen
dc.pagina.final424
dc.pagina.inicio393
dc.revistaTheory and practice of logic programming
dc.rightsacceso restringido
dc.subjectdatabases
dc.subjectanswer set programming
dc.subjectintegrity constraints
dc.subjectconsistency
dc.titleAnswer sets for consistent query answering in inconsistent databases
dc.typeartículo
dc.volumen3
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas