### Table 1: Syntax of SFD constraints.

"... In PAGE 5: ... 5.2 The core language: SFD The kernel of the solver is based on an unique constraint of the form X in r where X is a FD variable and r a syntactic domain de ned by Table1 . The range (syntactic domain) can be constant or can depend on some indexicals: def(X), which is the valued domain of variable X, sigma(X), which is the semiring sum of the semiring values appearing in the valued domain of variable X, min(X), which is minimal index (associated to a non-null semiring value) in the valued of variable X, max(X), which is maximal index (associated to a non-null semiring value) in the valued of variable X, val(X), which is the delayed value of variable X.... ..."

### Table 1. Syntax of SFD constraints.

1998

"... In PAGE 7: ... De nition 23 (range) Let V be a set of variables. A range is a syn- tactic domain de ned by Table1 , where Y 2 V. De nition 24 (constraint) Let V be a set of variables.... ..."

Cited by 37

### Table 4.1: Results of optimization in benchmark domains Domain Sandgren Dim. Constraints best OOGA NumOpt GADO

1998

Cited by 21

### Table 4.2: Results of optimization in benchmark domains (without screening) Domain Sandgren Dim. Constraints best OOGA NumOpt GADO

1998

Cited by 21

### Table 1: Example Problem Constraints

1996

"... In PAGE 6: ... The space of all possible designs in the ACDS representation is given by the set of all catalog-agent domains: i U [cai]. Table1 shows the five constraints4: motor_select, cable_select, cable_length, dollar and fail_rate found in the example. The fail_rate and dollar constraints are static (their... ..."

Cited by 18

### Table 5 Gradient constraint locations

"... In PAGE 22: ... (15) around the perimeter of the plume in the fourth layer from the top of the domain and used a value of d = 10 4 m/s. The relative (x; y) locations of the constraints are found in Table5 and are shown in Figure 3. Previous work has also used a similar gradient-based constraint approach [28, 35, 39, 53].... ..."

### Table 4: An example of constraint solving on the domain Colour Ch.P. C

"... In PAGE 22: ... The choice points are introduced by the de nition of the propagator 6 =0. Table 3 also gives the interval constraints used by Table4 to show the constraint solving process. Three choice points are added by the inference machine and backtracking is executed when an inconsistency or a solution is found by the generic solver.... ..."

### Table 3: Solution of a constraint satisfaction problem by branching, domain reduction, relaxation, and cutting plane generation.

"... In PAGE 7: ... Because the relaxation is distinguished from the model, both are more succinct. A search tree appears in Table3 . At each node constraint propagation is rst applied to the... ..."

### TABLE V DOMAIN MODEL: Pressures, rates of flow, and constraints holding between them.

1984

Cited by 31

### Table 4: An example of constraint solving on the domain Colour Ch.P. C

"... In PAGE 22: ...Triples Simple Interval constraints Constraints with indexicals (c1) (::0; fAg; fd1 Ag) (d1 A) A 2 [white; black] (dB A) A 2 [white; max(B)) (c2) (::0; fBg; fd1 Bg) (d1 B) B 2 [white; black] (dA B) B 2 (min(A); black] (c3) (::0; fCg; fd1 Cg) (d1 C) C 2 [white; black] (dC B) B 2 [white; max(C)) (c4) (6 =0; fA; Bg; fdB A; dA Bg) (d2 A) A 2 [white; black) (dB C) C 2 (min(B); black] (c40) (6 =0; fA; Bg; fd0B A ; d0A B g) (d2 B) B 2 (white; black] (d0B A ) A 2 (min(B); black] (c5) (6 =0; fB; Cg; fdC B; dB Cg) (d2 C) C 2 (white; black] (d0A B ) B 2 [white; max(A)) (c50) (6 =0; fB; Cg; fd0C B ; d0B C g) (d3 A) A 2 (white; black] (d0C B ) B 2 (min(C); black] (c6) (2; fAg; fd2 Ag) (d3 B) B 2 [white; black) (d0B C ) C 2 [white; max(B)) (c7) (2; fBg; fd2 Bg) (d3 C) C 2 [white; black) (c8) (2; fBg; fd3 Bg) (c9) (2; fCg; fd2 Cg) (c10) (2; fCg; fd3 Cg) (c11) (2; fAg; fd3 Ag) interval constraints used by Table4 to show the constraint solving process. Three choice points are added by the inference machine and backtracking is executed when an inconsistency or a solution is found by the generic solver.... ..."