### Table 5: Operational semantics for the basic operators (a 2 A [ f g) The re exive transitive closure of

"... In PAGE 4: ...Structured operational semantics Table5 de nes the operational semantics of BPA quot; terms following the structured style of Plotkin [Plo81], that is, predicates of a term are stated in function of the predicates of its sub-terms. In this case, two kind of predicates are considered.... ..."

### Table 1. Change Operations Operation Applicable on

2007

"... In PAGE 8: ...2). Table1 shows the change operations (atomic and complex) considered in this paper and where each one is applied. Table 1.... ..."

Cited by 1

### Table 1.2: State complexity of some basic operations

2003

Cited by 2

### Table 7. The design state after the application of the first move operator

1995

"... In PAGE 19: ...DELETION: delete the empty time step 5. Table7 ~ Table10 show the resulted schedule and instruction set for the design state after the first, fifth, seventh and eleventh move operators are applied, respectively. After the twelfth move operator is applied, the design state in Table6 can be obtained.... ..."

Cited by 22

### Table 8. The design state after the application of the fifth move operator

1995

Cited by 22

### Table 9. The design state after the application of the seventh move operator

1995

Cited by 22

### Table 1. Tableau expansion and closure rules for theorem proving

2002

"... In PAGE 10: ... Finally, we will disregard equality for the moment, but the algorithm can be extended to deal with equality as well (we will return to this issue at the end of this section). Table1 summarizes the tableau calculus for rst order logic without equality... In PAGE 11: ...ll branches. We term this operation the Add Instance rule, shown in Table 2. Table 2. The Add Instance rule for question answering Add Instance P~y :P~y where ?P~x is the question, and ~ y are fresh variables Note that, whereas the rules in Table1 are only applied to a single branch at a time, the Add Instance rule is always applied to the entire tableau. This di erence is not essential|completeness is not lost if we restrict the application of the Add Instance rule to single branches|but it increases e ciency and it renders the generated answers more concise.... ..."

Cited by 2

### Table 2: Computational complexity of the algorithms

"... In PAGE 3: ... For the particular state-space representation used, when the real motion corroborate the assumptions made regarding, only translational motion with very smooth changes, the 8x8-block based motion estimation using Kalman filter is even better than the one resulting from the full search algorithm, as one can see from the average PSNR values and the curves in Figure 1. The computational complexity of each of the above stated algorithms is given in Table2 . The complexity is evaluated in terms of number of operations per block (NOPB).... In PAGE 3: ... The Kalman filter is usually of high complexity. But for our particular application, that uses an intentionally simple state-space model for the motion, it is observed from Table2 that the Kalman filter implementation for refining the motion estimates resulting from the TSA, does not significantly increase the computational complexity. Indeed, due to the basic formulation of the motion, the Kalman filter equations can be largely simplified and thus reduced to their scalar form.... ..."

### Table 1: Closures and collapses on exponential arity operators

1994

Cited by 1