### Table 3: Rules for message handling.

"... In PAGE 4: ... It has rules of processing these messages to decide where the destination of a message is and what the required next action is. Table3 shows the rules for message handling. The messages RecogRes and DlgRes in this table represent the results of speech recognizer and dialogue management, respectively.... ..."

### Table 1: Complexity of model checking for default logic

1999

"... In PAGE 4: ... The above property and Theorem 6 also imply p 2- completeness of model checking for prerequisite-free dis- junctive default theories. In Table1 we summarize the complexity results de- scribed in this section. Each column of the table corre- sponds to a di erent condition on the conclusion part of default rules.... In PAGE 6: ... From the computational viewpoint, it turns out that Liberatore and Schaerf apos;s notion of model checking is harder than the one presented in this paper. In fact, comparing Table1 with the results reported in [Liber- atore and Schaerf, 1998], it can be seen that our for- mulation of model checking is computationally easier in almost all the cases examined, with the exception of nor- mal and supernormal default theories, for which the com- plexity of the two versions of model checking is the same. 6 Conclusions In this paper we have studied the complexity of model checking in several nonmonotonic logics.... ..."

Cited by 1

### Table 5. Modal Logics and SST-rules Logics -SST-rules Logics -SST-rules Logics -SST-rules

1994

Cited by 52

### Table 1: Modal Logics and SST-rules Logic -SST-rules Logic -SST-rules Logic -SST-rules

1995

Cited by 2

### Table 2.1 shows how uncertain facts and uncertain simple rules can be handled with propositional logic. The uncertainty that fact a11 a14

2000

Cited by 8

### Table 6. Rules for a logical data

"... In PAGE 18: ...Table 6. Rules for a logical data Table6 shows rules for a logical data with known domain and simple choice : a5 row 1 : if the user must input a logical data whose domain is known and if the values are antagonist and if the orientation is vertical, then the suggested AIO is a vertical switch (fig. 16a); a5 row 3 : if the user must input a logical data whose domain is known and if the values are antagonist and if the orientation is circular, then the suggested AIO is a dial (fig.... ..."

### Table 3. Rule Set for Fuzzy Logic Controller

2003

"... In PAGE 8: ...able 2: Example of Driver I/O .........................................................................................30 Table3 : Rule Set for Fuzzy Logic Controller.... In PAGE 50: ... Once the input is fuzzified and all the output fuzzy sets are defined as appropriate linguistic terms, the fuzzy inference engine looks for a match between the input and the outputs. The agent has 17 fuzzy rules in total: seven rules for the front sensors, two for the rear sensors, and four for each of the left and right sensors as shown in Table3 . Left columns in the table correspond the antecedents of the fuzzy rules.... ..."

### Table 8: Precedence rules for arithmetic and set operators

1990

"... In PAGE 9: ... The default precedence for logical connectives is negation rst, then conjunction, and nally disjunction. Precedence of arithmetic and set operators is summarized in Table8 . Low numbers indicate high precedence.... ..."

Cited by 2

### Table 1: Rules for deductions in equational logic

1994

"... In PAGE 4: ...y means of many-sorted equational logic. We assume that is inhabited, i.e. that there are closed terms of every sort S 2 S, otherwise unsound deductions would be possible (a closed term is a term without variables). The axioms and rules of inference of the equational theory determined by ( ; E) are listed in Table1 . Substitutions are de ned as usual.... In PAGE 27: ... This can be easily veri ed by inspecting the eq function for natural numbers. The total set of equations that has to be considered is ENat = fNat1; : : : ; Nat8g [ fMod1; : : : ; Mod4g [ fQueue22; Queue23g [ f Table1 3; Table14g [ fBag14; Bag15g [ fSet21; Set22g: Note that for such a proof we need consistent speci cations for the sorts Bool, Queue, Table, Bag, and Set. To actually prove that 0 = Sn cannot be derived from ENat, term rewriting techniques can be used.... ..."

Cited by 3