### Table 1. Complexity results for satisfiability. The entries trivial denote cases in which a given formula is always satisfiable. Question marks stand for open questions.

"... In PAGE 2: ...emporal operator S and the boolean operator f (Theorem 3.3). The difficulty lies in simulating the quantifier tree of a Quantified Boolean Formula (QBF) in a linear structure. Our results are summarized in Table1 . The first column contains the propositional restrictions in terms of closed sets of Boolean functions (clones) whose terminology is introduced in the following section.... ..."

### Table 1: Minimum perimeters

"... In PAGE 7: ...In x3 of Ghandeharizadeh et al [3], we derived an alternate bound on S: S l2 A1=2m: This bound is equivalent to S (A) (see Yackel and Meyer [7]). Table1 constructed via theorem 4 contains minimum perimeter values for areas up to 56. 3.... ..."

### Table 1: Minimum perimeters

"... In PAGE 7: ...In x3 of Ghandeharizadeh et al [3], we derived an alternate bound on S: S l2 A1=2m: This bound is equivalent to S (A) (see Yackel and Meyer [7]). Table1 constructed via theorem 4 contains minimum perimeter values for areas up to 56. 3.... ..."

### Table 1. Predicates used for (Quantified) Boolean Heap Abstraction

### Table 1. Predicates used for (Quantified) Boolean Heap Abstraction

### Table 1: Estimate of Boolean formula size, determined by number of Boolean operators ( and , or , not )

"... In PAGE 4: ... We estimate the length of the formula as the total count of these operators. For example, Table1 contains the estimates for our three test families, from scope = 1 through scope = 4. The size of the formula quickly becomes very large (and our simple utility is extremely inefficient and thus quickly runs out of memory); therefore, we did not compute our estimates past scope 4.... ..."

### Table 1: Estimate of Boolean formula size, determined by number of Boolean operators ( and , or , not )

"... In PAGE 4: ... We estimate the length of the formula as the total count of these operators. For example, Table1 contains the estimates for our three test families, from scope = 1 through scope = 4. The size of the formula quickly becomes very large (and our simple utility is extremely inefficient and thus quickly runs out of memory); therefore, we did not compute our estimates past scope 4.... ..."

### Table 1 Translation from state to Boolean formulas

2007

"... In PAGE 8: ...mations of Table1 , we give its encoding in terms of Bes in Table 2. Even if Ys,e is a disjunctive variable, it has only one successor: true or false.... ..."

Cited by 3