Temporal Dependencies Generalized for Spatial and Other Dimensions
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint acquisition you can chase but you cannot find
APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
Boolean Constraints for XML Modeling
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics
Information Processing Letters
Border algorithms for computing hasse diagrams of arbitrary lattices
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
According to the definition of satisfaction of Boolean dependencies, Theorem 15 is not true for Boolean dependencies with negation. (A positive Boolean dependency is built using the Boolean connectives ⋏, ⋎, and ↛; a general Boolean dependency (with negation) may use also the Boolean connective ¬.) Actually, the definition of satisfaction is not meaningful for Boolean dependencies with negation, since many are never satisfied. We show how the definition of satisfaction should be changed in order to make Boolean dependencies with negation meaningful and correct the error.We associate with each relation r a set &agr;(r) of truth assignments, as follows. For each pair of distinct tuples of r, the set &agr;(r) contains the truth assignment that maps an attribute A to true if the two tuples are equal on A, and to false if the two tuples have different values for A. A Boolean dependency &sgr; is satisfied by a relation r if &sgr; (i.e., the corresponding Boolean formula) satisfies every truth assignment of &agr;(r).The original definition given in the paper is equivalent to having &agr;(r) also include the truth assignment that is generated by pairs in which both tuples are really the same tuple of r, that is, to having &agr;(r) also always include the truth assignment &tgr; mapping all attributes to true. Under that definition, however, many Boolean dependencies with negation are never satisfied and, hence, are meaningless. More precisely, according to the original definition, a Boolean dependency is satisfied by