### Table 1. Statistics for the number of domain variables and the resources needed for the BDD evaluation of the final propositional formula. The memory and CPU time are reported for the sequence of symbolic simulation, translation of the EUFM formula to a propositional one, and the evaluation of the latter by BDDs. Vp designates the set of p-term domain variables, while Vg the set of g-term domain variables. Src Regs stands for source registers, while Dest Regs for destination registers. The category Other of the final Vg consists of the predicted and actual targets of branch and jump instructions.

2000

"... In PAGE 5: ... All processors were modeled in the style described in [21]. The results are presented in Table1 . The experiments were performed on a 336 MHz Sun4 with 1.... In PAGE 6: ... Second, these designs require more Boolean variables as either part of the initial state of their pipeline latches or as outputs of the UPs, indicating that a certain type of exception has been raised for a particular instruc- tion in flight. Indeed, if we compare the category of Other BDD Variables in Table1 for the -EX models vs. their correspond- ing base model, and for the -MC-EX models vs.... ..."

Cited by 44

### Table 1. Statistics for the number of domain variables and the resources needed for the BDD evaluation of the final propositional formula. The memory and CPU time are reported for the sequence of symbolic simulation, translation of the EUFM formula to a propositional one, and the evaluation of the latter by BDDs. Vp designates the set of p-term domain variables, while Vg the set of g-term domain variables. Src Regs stands for source registers, while Dest Regs for destination registers. The category Other of the final Vg consists of the predicted and actual targets of branch and jump instructions.

"... In PAGE 5: ... All processors were modeled in the style described in [21]. The results are presented in Table1 . The experiments were performed on a 336 MHz Sun4 with 1.... In PAGE 6: ... Second, these designs require more Boolean variables as either part of the initial state of their pipeline latches or as outputs of the UPs, indicating that a certain type of exception has been raised for a particular instruc- tion in flight. Indeed, if we compare the category of Other BDD Variables in Table1 for the -EX models vs. their correspond- ing base model, and for the -MC-EX models vs.... ..."

### Table 11: Functions f; h and probabilistic function composition h f. 3.4 Probabilistic Semantics A condition is a set of sets of literals (or equivalently a propositional formula in disjunctive normal form) whose atoms are of the form g(x; y; cf) with cf being a real number in the interval [0; 1]. The set of all conditions is denoted by C. We restrict ourselves to bag functions of the following types f : X ! B(Y C)

1994

Cited by 2

### Table 1: Complexities in the general propositional case

"... In PAGE 7: ...1 Complexity of General Entailment Relations We consider entailment relations of the form (E; ) j p;m where E, , p and m have been de ned in the previous sections, and where is a single propositional formula. The complexity results for the general propositional case are given in Table1 . For lack of space, we just give sketches of proof.... ..."

### Table 2. Flat Propositional Contrastive Logic: Semantics

"... In PAGE 4: ... The syntax of CL1 is presented in Table 1. I now turn to the semantic de nition of CL1, presented in Table2 . I use `j= apos; to ambiguously denote satisfaction both of a classical propositional formula over one world, and for the satisfaction of a contrastive formula over two worlds, leaving the distinction to context.... ..."

### Table 1: Proof system PALPA with , , formulas in LPAL(PA), a some agent in A and p some propositional atom in P.

2007

### Table 3: Modes of the mode class CC. straints on the system behaviour but rather pu- tative theorems { global properties that should hold in the system under speci cation, e.g. \the light will eventually become green quot;, or \reversing a list twice gives us the original list quot;. The language for specifying these properties in SC(R)3 is an extension of CTL (Computational Tree Logic). CTL is a branching-time temporal logic [6] which allows quanti cation over some or all possible futures. CTL formulae are de- ned recursively: all propositional formulae are 5

1998

Cited by 7

### Table 2: A proof system for propositional logic.

1996

"... In PAGE 8: ...Asusual,wewrite _ for : ! , ^ for :(: _: ), and $ for ( ! ) ^ ( ! ). In Table2 we give a complete proof system for propositional logic. The signal insertion operation cq assigns propositional formulae to the states contained in frames.... In PAGE 8: ...2) and the axioms given in Table 3. Additionally, we can use identities = i $ is provable from the axiom schemas and the inference rule given in Table2 . The axioms in Table 3 express that signal insertion to a frame is tantamount to signal insertion to all its states, taken as frames (axioms (Ins1), (Ins5), (Ins6) and (TIns1)).... ..."

Cited by 7

### Table 1. Formulas and their intended meaning

"... In PAGE 5: ... A proposition reflects a particular state of affairs. Table1 gives the formulas appearing in this paper, together with their intended meanings. The symbol a28 denotes a proposition.... ..."

### Table 1. Formulas and their intended meaning

"... In PAGE 5: ... A proposition reflects a particular state of affairs. Table1 gives the formulas appearing in this paper, together with their intended meanings. The symbol B3 denotes a proposition.... ..."