### Table 3: Timing results for the twenty-one Marcus Engineering trials. The rst row shows the expected cost (in seconds, rounded to the nearest whole second) of applying the strategy, as predicted by SLS. The second row shows the actual cost. Trial

### Table 4: NP-hard subclasses of V.

"... In PAGE 9: ... The relations included in each of these algebras can be found in Table 3. Further, let VNP denote the set of subalgebras listed in Table4 . We have... In PAGE 18: ... Proof: V17 s = DV(V17 f ). 2 2 NP-Hardness Results This section provides NP-hardness proofs for the subclasses of V presented in Table4 . The reductions are mostly made from di erent subalgebras of Allen apos;s interval algebra.... ..."

### Table 1: Tractable classes

2000

"... In PAGE 3: ... 2 Tractability Results We continue by defining four classes of disjunctive relations TA; : : : ; TD and show that their corresponding satisfiabil- ity problems are tractable. The classes are defined as fol- lows: TA = ?A _ A, TB = ?B _ B, TC = ?C _ C and TD = D and the exact definitions of the sets of relations can be found in Table1 . The classes TA and TB are exten- sions of the algebras A14 and A10 as defined by Broxvall and Jonsson (1999).... ..."

Cited by 3

### Table 1: Tractable classes

"... In PAGE 3: ... 2 Tractability Results We continue by defining four classes of disjunctive relations T A ;:::;T D and show that their corresponding satisfiabil- ity problems are tractable. The classes are defined as fol- lows: T A = , A #02 _#01 #03 A , T B = , B #02 _#01 #03 B , T C = , C #02 _#01 #03 C and T D =#01 #03 D and the exact definitions of the sets of relations can be found in Table1 . The classes T A and T B are exten- sions of the algebras A 14 and A 10 as defined by Broxvall and Jonsson (1999).... ..."

### Table ?? summarizes possible transformation of nodes in the initial model depending on those of the speci c structure. It can be observed that there are fteen possible cases. In reality, there are twenty one, but we decided not to consider the cases con- cerning agg-td and agg-lr till the end of the learning process. The rst three

1995

Cited by 6

### Table 1: Tractable classes of the point algebra for partially ordered time [5].

"... In PAGE 19: ... xky i neither x y nor y x The point algebra for partially ordered time has been throughly investigated earlier and a total classi cation with respect to tractability has been given in Broxvall and Jonsson [4]. In Broxvall and Jonsson [5] the sets of relations in Table1 are de ned and it is proven that ?A _ A, ?B _ B, ?C _ C and D are the unique maximal tractable disjunctive classes of relations for partially ordered time. The proofs of tractability for those sets relied on a series of handmade independence proofs.... ..."

### Table 1. Tractable classes of the point algebra for partially ordered time.

2000

Cited by 2

### Table 3: Cell Means for Three Lab Conditions, Number Correct of Twenty-One, Free- Response Test analysis was type of laboratory session, No Lab, Active or Passive. Cell means indicated that those students in the active condition had the highest scores on the free-response test. These results appear in Table 3. Analysis of Variance for the three possible lab conditions indicated that laboratory condition was signi cant (F = 2.83, d.f. 2,59, p lt; 0.07). Pairwise t-test were performed to determine where the di erence in condition actually lay. The signi cant di erence (p= 0.05) was discovered between the active and the no laboratory condition.

1994

Cited by 73

### Table 1: The tractable subclasses of PAdc. t28 t20 t17 t14

2005

Cited by 1