### TABLE 1: CONSTRAINTS FOR CERTAIN PROCESSES

Cited by 1

### Table 3: incremental implementation of a cardinality constraint

1995

Cited by 43

### Table 2. Mapping template constraints to cardinality restrictions

### Table 1. Adhesion and Cardinality Constraints in XML Schema

### Table 1. Maximum cardinality constraints of aggregate relationships from two relations

"... In PAGE 6: ...Maximum cardinality constraints Table1 describe maximum cardinality constraints of the aggregate relationships from two relations. Only the case (2) is taken into account in [5] as we said in the introduction.... ..."

### Table 3: Cardinality relationships and their correspond- ing semantic constraints.

2002

"... In PAGE 4: ... Each element appears exactly once in the graph, while attributes and operators appear as many times as they appear in the DTD. CPI then an- notates various cardinality relationships (summarized in Table3 ) among nodes to each edge of the DTD graph. Note that the cardinality relationship types in the graph consider not only element vs.... ..."

Cited by 3

### Table 2: Quantitative comparison. Normal form Cardinality constraints

"... In PAGE 28: ... This is confirmed by Figure 7 and 13, respectively, where the ratios between the size of the output and input file (in bytes) are shown. Also, looking at Table2 , we see that the majority of test cases has a smaller image under the structural transformations than under the language-preserving one. However, this is less significant for the cardinality constraints series than for the normal form series.... In PAGE 28: ...9 We thus get a similar behavior in Figure 8 and 14, respectively, as regards compilation time, as we obtained for the size of the image (cf. also Table2 ). Things become more interesting when comparing the respective run times (for computing all answer sets of a given program); these are given in Figure 9 and 15, respectively.... ..."

### Table 2. Maximum cardinality constraints of aggregate relationships from three relations

"... In PAGE 6: ...3[c1#,c2...,(a1,b1)] N-1 (a1,b1) non unique in E3 1-N c1 non unique in A1 Two aggregate relationships 1-1 (a1,b1) unique in E3 1-1 c1 unique in A1 1-1 (a1,b1) unique in E3 Single aggregate relationship (3) 1-1 (a1,b1,c1) are simultaneously in E3 et A1 Table2 describe maximum cardinality constraints of the aggregate relationships from three relations. Due to space limitations we do not consider here the possible inverse references, but our process includes these cases.... ..."