### Table 5 Algorithms for Minimal Change

1997

"... In PAGE 38: ...Belief Revision as Propositional Update38 e that each one deems minimal often corresponds to an intuitively reasonable way of inte grating both the old and new belief information. We provide simple algorithmic interpret ations of each of these minimal change definitions in Table5 and highlight the functional effects of computing minimal change according to one algorithm or another. A straightforward way to quantify the degree of change is to count the number of propositions whose truth values change if one model (e.... In PAGE 38: ... But clearly, its truth status (along with every other po ssible sentence) in the initial belief set was, in hindsight, uncertain. This is what we call i mplicit uncertainty, and all the algorithms in Table5 construct different models of the init ial belief set to accommodate the implicit uncertainty about r just as if it were explicitly u ncertain in the first place. Thus, the computations for minimal change for this problem w ould begin with these models of the initial belief set [pq~r], [pqr], [~p~q~r], and [~p~q~r] .... In PAGE 39: ... By this reasoning, a new belief state that represents a minimal cha nge on the initial state is [p ~q ~r ~s]). This is the gist of the minimal change approach pr oposed by Dalal (1988) and summarized as Algorithm D in Table5 . More formally, Dala l apos;s revision of a belief set by an expansion sentence is a set of minimal models where (a) e ach member of this set satisfies the expansion information, and (b) there is no other mode l of the initial belief set that also satisfies the expansion information and differs from any model of initial belief set by fewer atoms than the set of minimal models.... In PAGE 40: ... A simple algorithm that corresponds to this approach is given as Algorithm W in Table 5. ------------------------- Insert Table5 about here ------------------------- Borgida (1985) proposes an algorithm that is similar to Dalal apos;s, but produces what might be considered a more conservative belief-state change. Essentially, each expansion model is compared to each initial belief-set model: the expansion model that produces a minimal change for a particular initial-belief interpretation is remembered.... In PAGE 40: ... All these expa nsions that are minimal with respect to some model of the initial belief set are then used t o define the new belief set. An algorithm that captures this approach is given as Algorith m B in Table5 . Consider a case where there is more than one interpretation of the initial belief set.... In PAGE 44: ... Within each problem, there is a clear preference for one re vision over the other: subjects chose revisions that most closely matched the form of the e xpansion information. We also tabulated the number of subjects whose response pattern a cross problems matched the particular pattern associated with each revision algorithm des cribed in Table5 . Virtually no subjects matched a particular response pattern for all five problems.... In PAGE 71: ... If this set is empty, then the new belief set is the expansion information. Otherwise, the new belief set is the conjunction of the old KB propositions with the expansion information Table5... In PAGE 72: ...Belief Revision as Propositional Update72 Table5 continued Algorithm B B1. For each model of the initial belief set do B1.... ..."

Cited by 10

### TABLE III NOTATION FOR THE PROBLEM OF MINIMIZING SENSITIVITY TO TOPOLOGY CHANGES WITH BOUNDED DELAY.

2005

Cited by 8

### TABLE II NOTATION FOR THE PROBLEM OF MINIMIZING SENSITIVITY TO TOPOLOGY CHANGES WITH BOUNDED DELAY.

2005

Cited by 8

### Table 1: Masks used to estimate maximal and minimal rates of change in different directions

"... In PAGE 3: ...em (e.g. no horizontal neighbouring motion vector information). The masks are shown in Table1 . For every type, a minimum and a maximum rate of change, + (i) and ; (i) , i = I;;::;;V I, re- spectively, are estimated for the specific direction defined by the employed mask.... ..."

### TABLE III LINES OF CODE IN A MINIMAL APPLICATION AND NUMBER OF CHANGED LINES WHEN ADDING ANOTHER PUBLISHER

2006

Cited by 3

### Table 3: Additional/changed Closed (CD) and Minimal Generators (MD) for DNF

2006

"... In PAGE 13: ... Table3 shows the closed DNF expressions and their minimal generators, in addition to those shown in Tables 1 and 2. Some entries are repeated since, the closed expressions in DNF have changed.... ..."

Cited by 1

### Table 1: If the current state is (u; w; l; b) then after a match the next state can be found in the row and column corresponding to the groups (before the match) containing the match apos;s winner and loser. Our oracle tries to impede the progress of the algorithm by minimizing the change in state. It decides outcomes of matches as follows:

"... In PAGE 5: ... In Table 2 the outcomes prohibited by the oracle have been noted. All n players start in U, n ? 2 must move to B while one player moves to W and If winner If loser is in group is in group U W L B U (u ? 2; w + 1; l + 1; b) not possible (u ? 1; w + 1; l; b) (u ? 1; w + 1; l; b) W (u ? 1; w; l + 1; b) (u; w ? 1; l; b + 1) (u; w; l; b) (u; w; l; b) L not possible not possible (u; w; l ? 1; b + 1) not possible B (u ? 1; w; l + 1; b) not possible (u; w; l; b) (u; w; l; b) Table 2: Table1 modi ed to re ect state changes which the oracle will not allow. one to L.... ..."

### TABLE 1. Genes expressed in E. coli PCPHR and WT EMG2 in M9 (minimal) and YT (rich) media, sorted by fold change in gene expression

Cited by 1

### Table 2: Primitive or minimal code, postulated as precursor to eukaryotic code. In fact on changing AGR \Ter quot; to \Arg quot; the vertebrate mitochondrial code is obtained. Anticodon base modi cations are not shown.

### Table 4. The structure of the Modern Greek weekly newspaper . Analytical information on the author-based corpus can be found in table 5. All the downloaded texts were taken from issues published within 1998 in order to minimize the potential change of the personal style of an author over time. The last column of this table refers to the thematic area of the majority of the writings of each author. Notice that this

2000

Cited by 29