### Table 2 - Intersection of coincident constraints

"... In PAGE 18: ... All constraints specified under a quot;[namespace:] limit-scope quot; function SHALL be considered as if they were individual constraints under a single AND operator at the policy framework level. Except as specified in the preceding list, the FunctionId attribute in an lt;Apply gt; element SHALL be one of those listed in Table2 of Section 6. 2.... In PAGE 21: ...2 Intersection of constraints The intersection of two coincident constraints is either the empty set, the two constraints, or a single constraint. The result of taking the intersection of two constraints, and the FunctionId and lt;AttributeValue gt; of any single resulting constraint are specified in Table2 in Section 6. If the intersection of the two constraints is the empty set, then the constraints are incompatible.... In PAGE 25: ... If two coincident constraints are compatible according to the Compatibility test column, then their intersection is the constraint specified in the Replacement constraint column of Table 2. Table2 is to be interpreted according to the following key. Columns one, two and four contain shorthand versions of an XACML lt;Apply gt; element.... ..."

### Table I. Properties Preserved by Boolean Composition Union Intersection Difference

### Table 3 presents the local properties of the intersection curve determined by our algorithm and by the algorithm of Ye and Maekawa, as we traced the intersection curve with

"... In PAGE 6: ...051851 0.082801 Table3 : Determination of local properties. require higher-order derivatives, is more efficient than march- ing along a circle.... In PAGE 6: ... We performed our comparisons between the most clos- est traced points. Comparing the values in Table 1 with the values in Table3... ..."

### Table 1: I-Incompatibility and A-Incompatibility

2000

"... In PAGE 3: ... The classification depends in part on the predicative context of the anaphor. We define that an anaphor is I-incompatible (cannot refer to an individual object) or A-incompatible (cannot refer to an abstract object) if it occurs in one of the contexts described in Table1 . If an anaphor is neither I- nor A-incompatible, the classification depends on the success of the resolution algorithm.... ..."

Cited by 24

### Table 2: I-Incompatibility and A-Incompatibility

2000

Cited by 24

### Table 2: I-Incompatibility and A-Incompatibility

2000

Cited by 24

### Table 3: Results for an exact factorization Remark: The counterexample only shows, that if the running intersection property is violated, BEDA might not nd the optimum. It does not show that the running intersection property is necessary. Lauritzen (1996) has shown that the running intersection property is closely related to tree like interaction graphs derived from the sets si. Therefore the class of ADFs which lead to a numerical e cient exact factorization is limited, as the following 2-D Ising spin systems shows. FISING(y) = Xi

1999

"... In PAGE 9: ...0641 Table 2: Numerical results for two approximate factorizations An exact factorization according to the factorization theorem is p(x) = p(x1; x2; x3)p(x4; x5jx1; x2)p(x6jx2; x4): For an exact factorization we have p(x; t + 1) = ps(x; t). The results from Table3 con rm the theory. Note that the valid factorization converges more slowly to the optimum than the approximate factorization ~ p2.... ..."

Cited by 80

### Table 1. Rank 2 properties

"... In PAGE 6: ...onstructors. A property at rank 0 has no intersection constructors. In this paper, we will only be interested in properties at ranks 0, 1, 2. Such properties are amenable to automatic inference and are de ned in Table1 . Furthermore, we assume that the intersection operator, ^, is associative, commutative and idempotent.... ..."

### Table 1: Feature Set for the Coreference System. The feature set contains relational and non-relational features. Non- relational features test some property P of one of the NPs under consideration and take on a value of YES or NO depending on whether P holds. Relational features test whether some property P holds for the NP pair under consideration and indicate whether the NPs are COMPATIBLEor INCOMPATIBLE w.r.t. P; a value of NOT APPLICABLE is used when property P does not apply.

2002

Cited by 14