234 search results - page 5 / 47 » The Complexity of Global Cardinality Constraints |
CIKM
1997
Springer
15 years 2 months ago
1997
Springer
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...
IADIS
2003
14 years 11 months ago
2003
The cardinality constraint is one of the most important constraints that can be established in a conceptual model. Nevertheless, not all CASE tools for developing database support...
ISMVL
2009
IEEE
15 years 4 months ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
LCC
1994
15 years 1 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
105
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...