We propose an extension of conditional functional dependencies (CFDs), denoted by CFD c s, to express cardinality constraints, domain-specific conventions, and patterns of semantically related constants in a uniform constraint formalism. We show that despite the increased expressive power, the satisfiability and implication problems for CFD c s remain NP-complete and coNP-complete, respectively, the same as their counterparts for CFDs. We also identify tractable special cases.
In REF an extension of conditional FDs is proposed to uniformly express cardinality constraints, domain-specific conventions, and patterns of semantically-related attribute values.
Incorporating Cardinality Constraints and Synonym Rules into Conditional Functional Dependencies
Inf. Process. Lett.
Inf. Process. Lett.
Mathematics Computer Science