S. de Amo, W. A. Carnielli, and J. Marcos, "A logical framework for integrating inconsistent information in multiple databases," to appear.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Also, no computational mechanisms for answering first order (or aggregation) queries are proposed, nor are computational complexity issues addressed. In section 4, we described how the approach of Kifer and Lozinskii [68] can be adapted to the task of computing consistent query answers. In [36], a logical framework based on a three valued logic is used to distinguish between consistent and inconsistent (controversial) information. A database instance is a finite set of tuples, each tuple associated with the value 1 (safe) 0 (false, does not need to be stored) or 2 (controversial) ....

....I is defined as follows. The distance between I and J is the sum over all tuples u of I(u) J(u) where I(u) and J(u) are the values associated with u in I and J , respectively. Then, J # I K if the distance between I and J is less than or equal to the distance between I and K. Furthermore, in [36], an algorithm for computing repairs is introduced. This algorithm is based on the tableau proof system for the three valued logic used in the framework. A related approach of Arieli et al. 10] introduces executable specifications of repairs using abductive logic programming [65] In both ....

S. de Amo, W. A. Carnielli, and J. Marcos. A Logical Framework for Integrating Inconsistent Information in Multiple Databases. In 2nd International Symposium on Foundations of Information and Knowledge Systems, pp. 67--84, 2002.

....two approaches to handle this problem: Paraconsistent formalisms, in which the amalgamated data may remain inconsistent, but the set of conclusions implied by it is not explosive, i.e. not every fact follows from an inconsistent database. Paraconsistent procedures for integrating data (e.g. [14, 41]) are often based on a paraconsistent reasoning process, such as LFI [13] annotated logics [30, 40] or other non classical proof systems [5, 37] Coherent (consistency base) methods, in which the amalgamated data is revised in order to restore consistency (see, e.g. 6, 8, 11, 25, 31] In ....

....Insert Retract= Some of them may be trivial and or useless. For instance, the inconsistency in (D; IC) fp; q; rg; f:pg) may be removed by deleting every element in D, but this is certainly not the optimal way of restoring consistency in this case. Set inclusion is also considered in [3, 11, 14, 25]; cardinality is considered, e.g. in [31] Note that if DB is consistent, and the preference criterion is a partial order that is monotonic in the total size of the repairs components (as in Def. 6) then R(DB; fDBg, so there is nothing to repair, as expected. It is usual to refer to the ....

[Article contains additional citation context not shown here]

S.de Amo, W.Carnielli, J.Marcos. A logical framework for integrating inconsistent information in multiple databases. Proc. FoIKS'02 , LNCS 2284, pp.67-84, 2002.

....Also, no computational mechanisms for answering first order (or aggregation) queries are proposed, neither are computational complexity issues addressed. In section 4, we described how the approach of Kifer and Lozinskii [67] can be adapted to the task of computing consistent query answers. In [35] a logical framework based on a three valued logic is used to distinguish between consistent and inconsistent (controversial) information. A database instance is a finite set of tuples, each tuple associated with the value 1 (safe) 0 (false, does not need to be stored) or (controversial) ....

....I is defined as follows. The distance between I and J is the sum over all tuples u of I(u) J(u) where I(u) and J(u) are the values associated to u in I and J , respectively. Then, J I K if the distance between I and J is less than or equal to the distance between I and K. Furthermore, in [35] an algorithm for computing repairs is introduced. This algorithm is based on the tableau proof system for the three valued logic used in the framework. A related approach of Arieli et al. 10] introduces executable specifications of repairs using abductive logic programming [64] In both ....

S. de Amo, W. A. Carnielli, and J. Marcos. A Logical Framework for Integrating Inconsistent Information in Multiple Databases. In International Symposium on Foundations of Information and Knowledge Systems, pages 67--84, 2002.

No context found.

S. de Amo, W. A. Carnielli, and J. Marcos, "A logical framework for integrating inconsistent information in multiple databases," to appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC