### Table 3. The formula-based heuristics: a denotes a Boolean variable and g and h

2001

"... In PAGE 12: ... Similarly, H f n28Sn29 is the minimum number of transitions that havetobetaken until f is violated. Table3 depicts the distance measure H f n28Sn29 of the failure formula that we used. The estimator H f n28Sn29 is den0cned analogously.... ..."

Cited by 29

### Table 3. The formula-based heuristic: a denotes a Boolean variable and g and h are

2001

"... In PAGE 11: ... Similarly, H f (S) is the minimum number of transitions that havetobetaken until f is violated. Table3 depicts the distance measure H f (S) of the failure formula that we used. The estimator H f (S) is de ned analogously.... ..."

Cited by 29

### Table 3. The formula-based heuristics: a denotes a Boolean variable and g and h

2001

"... In PAGE 12: ... Similarly, H f (S) is the minimum number of transitions that havetobetaken until f is violated. Table3 depicts the distance measure H f (S) of the failure formula that we used. The estimator H f (S) is de ned analogously.... ..."

Cited by 29

### Table 3. The formula-based heuristics: a denotes a Boolean variable and g and h are logical predicates, t is a transition, q a queue. The symbol represents relational operators (=; 6 =; ; ; ; ).

2001

"... In PAGE 12: ... Similarly, Hf(S) is the minimum number of transitions that have to be taken until f is violated. Table3 depicts the distance measure Hf(S) of the failure formula that we used. The estimator Hf(S) is de ned analogously.... ..."

Cited by 29

### Table 3. The formula-based heuristics: a denotes a Boolean variable and g and h are logical predicates, t is a transition, q a queue. The symbol represents relational operators (=;; 6 =;; ;; ;; ;; ).

2001

"... In PAGE 12: ... Similarly, Hf(S) is the minimum number of transitions that have to be taken until f is violated. Table3 depicts the distance measure Hf(S) of the failure formula that we used. The estimator Hf(S) is de ned analogously.... ..."

Cited by 29

### TABLE 4 Expected Distances Traveled by Using Formulas Based on BE Model, MB Model,

### Table 1. Formulae (based on a simple model of the ARM7) used to predict the number of clock cycles required for the di erent versions of the algorithm.

2000

Cited by 7

### Table 1. Performance over nouns. F: formula; fc: frequency correction; Prec.: overall precision; Rec.: overall recall; Cov.: overall Coverage; P1: Precision over the disam- biguated nouns (i.e., nouns such that adjective noun ); P2: Precision over the nouns not disambiguated by the CD method [2]; F1-F6: formulae based on weight average; F7-F10: formulae based on weight maximum; F11-F15: formulae based on similarity measures.

### Table 2: Wealth based (unit = district) distribution of vouchers

### Table 1. Complexity of problems on the Horn difference 1 n 2 ( 1; 2 and are Horn)

"... In PAGE 2: ... This alternative has also been studied repeatedly, since it offers advantages to formula-based representation in certain cases; see [13,10, 4] for more details. Our results on the complexity of these issues are summarized in Table1 , which gives a complete picture of the tractability/intractability frontier of these problems. The table also shows results on the Horn envelope [11, 12] of the difference, i.... In PAGE 10: ... Our results imply polynomial time algorithms in some cases, but a complete picture remains to be drawn. Another issue is a more accurate account of the complexity of the polynomial cases in Table1 . Under formula-based representation, all these problems are complete for P under logspace reductions; this is an easy con- sequence of the fact that deciding the satisfiability of a Horn CNF is complete for P under logspace reductions.... ..."