Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are ”rationalized” with respect to the integrity constraints during the merging process. We define in formal terms several independence conditions for...

A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering (CQA) is the problem of computing from D the answers to a query that are consistent wrt IC . Consistent answers are invariant under all the repairs ofD, i.e. the consistent instances that minimally depart from D. Three classes of repair have been considered in the literature: those that mini...

Recent Internet developments seem to make a point for passing corrupt data from the link to the network layer and above instead of ensuring data integrity with a checksum and ARQ. We give an overview of these efforts (the UDP Lite and DCCP protocols) and explain which circumstances would justify delivery of erroneous data; clearly, the missing piece in the puzzle is efficient and meaningful int...

A learning framework that combines the two frameworks of explanatory and descriptive In ­ ductive Logic Programming (ILP) is presented. The induced hypotheses in this framework are pairs of the form (T, IC) where T is a defi­ nite clausal theory and IC is a set of integrity constraints. The two components allow us to combine complementary information from the same data by applying both explanat...

Schema validation and view updating are database engineering problems which seem to differ significantly. Hence, for solving them, significantly different approaches are taken, usually. However, one of the contributions of this paper is: We show that any sound method for view updating can effectively be used also for validating schema specifications. We consider typical schema validation tasks ...

This paper presents a general method for combining uncertain and paradoxical source of evidences for a wide class of fusion problems. From the foundations of the Dezert-Smarandache Theory (DSmT) we show how the DSm rule of combination can be adapted to take into account all possible integrity constraints (if any) of the problem under consideration due to the true nature of elements/concepts inv...

Probabilistic logic models are used ever more often to deal with the uncertain relations typical of the real world. However, these models usually require expensive inference procedures. Very recently the problem of identifying tractable languages has come to the fore. In this paper we consider the models used by the learning from interpretations ILP setting, namely sets of integrity constraints...

This work uses temporal logic as a calculus for expressing integrity constraints that specify admissibility of dynamic database behaviour. Formulas are interpreted in state sequences representing dynamic behaviour. Our approach incorporates temporal quantification by 11 always 11 , 11 sometime 11 , and quantifiers bounded by intervals in state sequences. Moreover, dynamically changing domains o...