### 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 2: Unique Queries Within Workloads

2007

"... In PAGE 14: ...net, a web-enabled database used for network trace analysis by the academic community. As Table2 shows, the num- ber of unique queries was very small relative to the large number of queries. The data in Table 2 suggests that it may be tractable to extend SLM to automate hoard profile creation.... ..."

Cited by 2

### Table 1. Tractability of symmetry breaking and dominance detection

"... In PAGE 35: ... Unfortunately, efficient symmetry breaking by such dominance-detection schemes has its limits, as we have identified some CSP classes where dominance detection is intractable. Table1 summarizes our main results, where P (Thm i) means that breaking all the symmetries mentioned in the corresponding row is feasible with a poly- nomial overhead with respect to both time and space at every node explored for the corresponding (set-) CSP in the column, as proved in Theorem i. Some of these positive tractability results, namely the ones marked P (from Thm i) , are trivially derivable as consequences from Theorem i.... ..."

Cited by 1

### TABLE 1: Fixed-parameter tractability of LCS.

### Table 1: The maximal tractable subalgebras of RCC-5.

"... In PAGE 6: ...XfDRgY i X \ Y = ? XfPOgY i 9a; b; c : a 2 X; a 62 Y; b 2 X; b 2 Y; c 62 X; c 2 Y XfPPgY i X Y XfPPIgY i X Y XfEQgY i X = Y Table1 : The ve basic relations of RCC-5. Y X X Y X Y Y X X Y DR(X; Y ) PO(X; Y ) PP(X; Y ) PPI(X; Y ) EQ(X; Y ) Figure 1: Pictorial example of the relations in RCC-5.... ..."

### Table 2: The maximal tractable subalgebras of RCC-5.

### Table 1: Tractability results for DAML-S subsets

2002

Cited by 198