### Table 2: BAT Results with Manually Optimized Ordering

2002

"... In PAGE 9: ... After enough effort, we were able to find a good ordering that allows symbolic simulation to run. Table2 shows the results. In this sequence of experiments, we were able to complete the assertion check without using any constant logic values to simplify the assertion.... In PAGE 9: ... In this sequence of experiments, we were able to complete the assertion check without using any constant logic values to simplify the assertion. By comparing the results in Table 1 and in Table2 , we observe that variable ordering sig- nificantly impacts the performance of symbolic simulation. For the OBDD sizes, we show two types of data: the total number of OBDD nodes at the end of symbolic simulation (to- tal OBDD nodes), and the maximum number of OBDD nodes during the symbolic simulation (max OBDD nodes).... ..."

Cited by 1

### Table 2 Tri state logic definition for logical AND AND

### Table 15: Viewpoints: Logical

"... In PAGE 10: ...able 14: Viewpoints: Deployment ......................................................................................... 28 Table15 : Viewpoints: Logical.... ..."

### Table 1: Logical Sorts

1993

"... In PAGE 10: ... Given these conditions, it follows that C1 occupies a subset of C2, as long as C2 is material. Table1 shows the sorts we use, together with the key letter. Table 2 de nes the non-logical symbols.... ..."

Cited by 21

### Table 2: Logic Symbols

"... In PAGE 13: ...resented in Sec. 4.6). 4.5 Formulas Table2 lists the built-in logic symbols for constructing formulas. Formulas in Pure Prefix Form.... ..."

### Table 20: Logic notation.

2005

"... In PAGE 51: ...212 Table 19: Food and wine accommodation, p.212 Table20 : Logic notation, p.213 Table 21: Businesses by state, p.... ..."

### Table 2: Logic Symbols

2003

"... In PAGE 13: ...resented in Sec. 4.6). 4.5 Formulas Table2 lists the built-in logic symbols for constructing formulas. Formulas in Pure Prefix Form.... ..."

### Table 1: Logical Notations

"... In PAGE 3: ... Properties of a nonterminal node type include node type, a number of children pointers, and a tag which represents the temporal-spatial relations between its children nodes. Table1 shows logical constructors corresponding to tags used in a TS-tree. Table 1: Logical Notations... ..."

### Table 5 Known logics

"... In PAGE 16: ...e., the presentation of MIN(Q) results from the presentation of WIL by adding consecutions from Q Table5 puts some known logics (we assume the reader to know the usual Hilbert style calculi for these logics) into our context. To prove soundness of this table we need to prove that in the presence of Sfax and E we get the... ..."