Itisa standard practice to de ne the truth conditionsfora rst-orderform ula with a quanti erin term sofassignm entsto individualvariables. For exam ple,letM be a m odeland s a function (assignm ent)which assignsto variableselem entsin thedom ain ofM .Then a formula 9x (x)istruein M undersi thereisan assignm entswhich di ersfrom satm ostin thevalue itassignsto x,such that (x)istrue on M unders. ...

In this paper we address the problem of how to extend the deenition of functional dependencies (FDs) in incomplete relations to XML documents. An incomplete relation is said to strongly satisfy a FD if every completion of the relation, obtained by replacing all null values by data values, satisses the FD in the ordinary sense. We propose a syntactic deenition of strong FD satisfaction in a XML ...

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is de ned as the Horn envelope of a set of models. We provide polynomial algorithms for the recognition of whether a given functional dependency holds in a given Horn theory, as well as polynomial algorithms for the generation of some representative sets of functional...

Functional Dependencies (FDs) are commonly used in data cleaning to identify dirty and inconsistent data values. However, many errors require user input for specific domain knowledge. For example, let us consider the drugs, Advil and Crocin. FDs will consider these two drugs different because they are not syntactically equal. However, Advil and Crocin are synonyms as they are two different drug...

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express stronger relationships between attribute values than the ordinary FDs. In our setting, the dependencies not only express that certain values are determined by othe...