Tuple generating dependency

GLAV mappings The common formalism for schema mappings, GLAV (a.k.a. tuple-generating dependencies), is based on expressions of the form... 

In general, the constraints in S are formulas in some logical formalism. In this chapter, we will focus on schema mappings specified by source-to-target tuple-generating dependencies. 

Definition 4. (Second-order tuple generating dependencies [Fagin et al. 2005b]) Let S be a source schema and T a target schema. A second-order tuple-generating dependency (SO tgd) is a formula of the form ... 

The quality of quantum-chemical calculations depends not only on the chosen n-electron model but also critically on the flexibility of the one-electron basis set in terms of which the MOs are expanded. Obviously, it is possible to choose basis sets in many different ways. For highly accurate, systematic studies of molecular systems, it becomes important to have a well-defined procedure for generating a sequence of basis sets of increasing flexibility. A popular hierarchy of basis functions are the correlation-consistent basis sets of Dunning and coworkers [15-17], We shall use two varieties of these sets the cc-pVXZ (correlation-consistent polarized-valence X-tuple-zeta) and cc-pCVXZ (correlation-consistent polarized core-valence X-tuple-zeta) basis sets see Table 1.1. 

Definition 8.39. Let H be an Abelian group of order q and g. a /z-tuple of elements of H. (Later, q will usually be prime and g a tuple of generators.) A -relation is a multiplicative dependency between the components of g, i.e., a tuple y that fulfils the following predicate ... 

---