### Table 1 summarizes the cost of seki re-search on all 45 positions. The total execu- tion time for phase two search is 14.5% of phase one, and the total number of nodes expanded in phase two is 17.7% of phase one. The cost is relatively small compared to the version that does not detect seki.

2005

"... In PAGE 11: ... Table1 . Overhead of seki re-search.... ..."

Cited by 1

### Table 2. Semeai outcomes when no eyes are possible. BOL = Black outside liberties; WOL = White outside liberties; W = Black wins, White loses; S = Seki; L = Black loses, White wins; WL = fWjLg;WS=fWjSg;SL=fSjLg.

1996

"... In PAGE 23: ... Black must also have at least one outside liberty remaining when he lls the next-to-last shared liberty, else White will capture him. Table2 summarizes this in formulas and in a grid. We can see that the result space is partitioned into three large cool areas (W, S, and L), with thin hot boundaries (WS, WL, and SL) between them.... ..."

Cited by 9

### Table 2. Semeai outcomes when no eyes are possible. BOL = Black outside liberties; WOL = White outside liberties; W = Black wins, White loses; S = Seki; L = Black loses, White wins; WL = {W|L}; WS = {W|S}; SL = {S|L}.

"... In PAGE 23: ... Black must also have at least one outside liberty remaining when he fills the next-to-last shared liberty, else White will capture him. Table2 summarizes this in formulas and in a grid. We can see that the result space is partitioned into three large cool areas (W, S, and L), with thin hot boundaries (WS, WL, and SL) between them.... ..."

### Table 2. Semeai outcomes when no eyes are possible. BOL = Black outside liberties; WOL = White outside liberties; W = Black wins, White loses; S = Seki; L = Black loses, White wins; WL = fWjLg; WS = fWjSg; SL = fSjLg.

"... In PAGE 23: ... Black must also have at least one outside liberty remaining when he lls the next-to-last shared liberty, else White will capture him. Table2 summarizes this in formulas and in a grid. We can see that the result space is partitioned into three large cool areas (W, S, and L), with thin hot boundaries (WS, WL, and SL) between them.... ..."

### Table 1: Some Deductive Database Systems Unlike XSB, most of the systems in table 1 use an extension of the magic set approach. Seki in [16] proves that, for programs without negation, a \top-down quot; resolution method, QSQR, is 2Currently SPARC, MIPS, Intel 80X86, Motorola 680X0, and IBM RS6000 chips have been tested; for operating systems, SUNOS, SOLARIS, IRIX, ULTRIX, LINUX, 386BSD, AMIGA-DOS, HP-UX, System V r.3-4, SCO Unix, and Mach have been tested.

1994

"... In PAGE 3: ... Performance results are reported in section 5. 2 Related Work Table1 summarizes aspects of some deductive database systems developed recently. The table was... In PAGE 4: ... If the active set of a recursive query does not t into main memory, its e cient evaluation is an open problem both for SLG and for magic evaluation. Table1 , does not classify the various systems on the basis of their treatments of sets or aggre- gation. LDL and CORAL allow sets as objects of the universe, while the HiLog systems, Glue-Nail and XSB, use terms as the names of sets, and use negation to construct predicates for set equality, subset checks, and other operations.... ..."

Cited by 191

### Table 4. Semeai outcomes when black has one eye and white has none.

1996

"... In PAGE 25: ... As in all two-group semeai with unequal number of eyes, seki is not possible; one group or the other must die. For the case where Black has one eye and White has none, the results are shown in Table4 . The case where White has one eye and Black has none is symmetric.... ..."

Cited by 9

### Table 4. Semeai outcomes when black has one eye and white has none.

"... In PAGE 25: ... As in all two-group semeai with unequal number of eyes, seki is not possible; one group or the other must die. For the case where Black has one eye and White has none, the results are shown in Table4 . The case where White has one eye and Black has none is symmetric.... ..."

### Table 4. Semeai outcomes when black has one eye and white has none.

"... In PAGE 25: ... As in all two-group semeai with unequal number of eyes, seki is not possible; one group or the other must die. For the case where Black has one eye and White has none, the results are shown in Table4 . The case where White has one eye and Black has none is symmetric.... ..."

### Table 5. Possible results as a function of the number of eyes, under no assump- tions (left) and under the assumption of enough shared liberties (right). Stars mark cases that depend on the assumption.

1996

"... In PAGE 26: ... In order to simplify the analysis in what follows, we will usually assume that the number of shared liberties is su ciently large that the outside liberty count can be ignored, so that whichever side makes the most eyes wins the battle or, if the eyes made are equal and less than two, both sides live in seki. Table5 shows the possible results of a semeai as a function of the number of Black and White eyes, in the fully general case and after the simplifying assumption has been made. After this simpli cation, the result depends only on the di erence between the... ..."

Cited by 9

### Table 5. Possible results as a function of the number of eyes, under no assump- tions (left) and under the assumption of enough shared liberties (right). Stars mark cases that depend on the assumption.

"... In PAGE 26: ... In order to simplify the analysis in what follows, we will usually assume that the number of shared liberties is sufficiently large that the outside liberty count can be ignored, so that whichever side makes the most eyes wins the battle or, if the eyes made are equal and less than two, both sides live in seki. Table5 shows the possible results of a semeai as a function of the number of Black and White eyes, in the fully general case and after the simplifying assumption has been made. After this simplification, the result depends only on the difference between the number of Black eyes and White eyes.... ..."