Abstract | ||
---|---|---|
In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model- theoretic analysis of the possible ways to 'repair' a database. We do so by characterizing the possibilities to 'recover' consistent data from an in- consistent database in terms of those models of the database that exhibit as minimal inconsistent information as reasonably possible. Then we in- troduce an abductive application to restore the consistency of a given database. This application is based on an abductive solver (A-system) that implements an SLDNFA-resolution procedure, and computes a list of data-facts that should be inserted to the database or retracted from it in order to keep the database consistent. The two approaches for coherent data integration are related by soundness and completeness results. |
Year | Venue | Keywords |
---|---|---|
2002 | Paraconsistent Computational Logic | data integrity,abductive reasoning |
Field | DocType | Citations |
Data integration,Computer science,View,Algorithm,Abductive logic programming,Database design,Database schema,Abductive reasoning,Soundness,Database theory,Database | Conference | 6 |
PageRank | References | Authors |
0.49 | 34 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ofer Arieli | 1 | 705 | 51.54 |
Marc Denecker | 2 | 1626 | 106.40 |
Bert Van Nuffelen | 3 | 189 | 12.33 |
Maurice Bruynooghe | 4 | 2767 | 226.05 |