S.Greco, E.Zumpano. Querying inconsistent databases. Proc. LPAR'2000 , LNAI 1955, pp.308-325, Springer, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... 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 many cases the underlying formalism of these approaches are closely related to the theory of belief revision [1, 23] In the context of database systems the idea is to construct consistent databases that are as close as possible to the original database. These repaired instances of the ....

....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.Greco, E.Zumpano. Querying inconsistent databases. Proc. LPAR'2000 , LNAI 1955, pp.308-325, Springer, 2000.

....so query processing consists of constructing a proof in an appropriate modal logic. Integrity constraints are considered at the same level of reliability than data, and in consequence, they could be considered doubtful . No complexity analysis is provided. 7. 4 Logic programming Greco et al. [56,58] independently developed a logic programming based approach to inconsistency handling in databases, alternative to those presented in sections 4.1 and 4.2. In that approach, disjunctive logic programs with stable model semantics are used to specify the sets of changes that lead to database repairs ....

....to rules whose heads involve essentially all possible disjunctions of database literals that occur together in a constraint. Thus a single constraint can produce exponentially many clauses. The approach of [4,6] can be generalized to non binary constraints along the same lines. In contrast to [4,6,56,58], the approach of [15] does not lead to an exponential blowup. The approach of [56] is concentrated mainly on producing the sets of changes, rather than the repaired databases explicitly. In particular, there are no persistence rules in the generated program. In consequence, the program cannot be ....

[Article contains additional citation context not shown here]

S. Greco and E. Zumpano. Querying Inconsistent Databases. In International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, pages 308--325. Springer-Verlag, LNCS 1955, 2000.

....that what is obtained would properly re ect the combination of the distributed data on one hand , and would still be coherent (in terms of consistency) on the other hand. Coherent integration and proper representation of amalgamated data is extensively studied in the literature (see, e.g. [1, 3, 7, 13, 14, 20 23, 26, 29]) Common approaches for dealing with this task are based on techniques of belief revision [20] methods of resolving contradictions by quantitative considerations (such as majority vote [21] or qualitative ones (e.g. de ning priorities on di erent sources of information or preferring certain ....

.... by quantitative considerations (such as majority vote [21] or qualitative ones (e.g. de ning priorities on di erent sources of information or preferring certain data over another [2, 4, 5] Other approaches are based on rewriting rules for representing the information in a speci c form [14], or use multiple valued semantics (e.g. annotated logic programs [28, 29] and bilattice based formalisms [12, 22] together with non classical refutation procedures [11, 19, 28] that allow to decode within the language itself some meta information such as con dence factors, amount of belief ....

[Article contains additional citation context not shown here]

S.Greco, E.Zumpano. Querying inconsistent databases. Proc. LPAR'2000 , M.Parigot and A.Voronokov, editors, LNAI 1955, 308-325, Springer, 2000.

....the deductive system, so query processing consists of constructing a proof in an appropriate modal logic. Integrity constraints are considered at the same level of reliability than data, and in consequence, they could be considered doubtful . 7. 4 Logic programming Greco et al. 44] see also [42, 43]) independently developed a logic programmingbased approach to inconsistency handling in databases, alternative to those presented in sections 4.1 and 4.2. In Greco s approach, disjunctive logic programs with stable model semantics are used to specify the sets of changes that lead to database ....

Greco, S. and Zumpano, E. Querying Inconsistent Databases. In Proc. 7th International Conference on Logic for Programming and Automated Reasoning (LPAR'2000.

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