### Table 5 Consequences Related to Emotion Recognition

"... In PAGE 9: ...i.e. system recognizes a negative emotional state of the user although she is not experiencing this state) obtained by interpreting the physiological signals of the user. Table5 summarizes the results that can be obtained while performing emotion recognition. Table 5 Consequences Related to Emotion Recognition ... ..."

### Table 1. Complexity results for all paraconsistent consequence relations.

2002

"... In PAGE 13: ...iven estimations are strict, i.e., the considered decision problems are hard for the respective complexity classes. The results are summarised in Table1 . There, all entries denote completeness results, except where a membership relation is explicitly stated.... In PAGE 13: ... The following theorem summarises these relations: Theorem 10. The complexity results in Table1 hold both for ordinary as well as for hierarchical extensions of Ti (i = 0, 1, 2) as underlying inference principle. Some of these complexity results have already been shown elsewhere.... ..."

Cited by 5

### Table 1. Complexity results for all paraconsistent consequence relations.

2002

"... In PAGE 11: ...imations are strict, i.e., the considered decision problems are hard for the respective complexity classes. The results are summarised in Table1 . There, all entries denote completeness results, except where a membership relation is explicitly stated.... In PAGE 11: ... The fol- lowing theorem summarises these relations: Theorem 9. The complexity results in Table1 hold both for ordinary as well as for hierarchical extensions of Ti (i = 0, 1, 2) as underlying inference principle. Some of these complexity results have already been shown elsewhere.... ..."

Cited by 5

### Table 1. Complexity results for all paraconsistent consequence relations.

in Preface

"... In PAGE 19: ...iven estimations are strict, i.e., the considered decision problems are hard for the respective complexity classes. The results are summarised in Table1 . There, all entries denote completeness results, except where a membership relation is explicitly stated.... In PAGE 19: ... The following theorem summarises these relations: Theorem 10. The complexity results in Table1 hold both for ordinary as well... ..."

### Table 3: Related work. How previous e orts have de ned idle and the consequences of those de nitions.

1995

"... In PAGE 9: ... Douglis and Ousterhout found that about two-thirds of machines were available on average [Douglis amp; Ousterhout 1991], and Mutka and Livny [Mutka amp; Livny 1991] found similar results. Table3 summarizes these results. We have identi ed a number of issues that have not been addressed by these previous e orts.... In PAGE 11: ...Table3 . While both Nichols apos; and Douglis apos; studies took place in the same year, there is a 40% net di erence in their results.... ..."

Cited by 120

### Table 3: Related work. How previous e orts have de ned idle and the consequences of those de nitions.

1995

"... In PAGE 12: ... Douglis and Ousterhout found that about two-thirds of machines were available on average [Douglis amp; Ousterhout 1991], and Mutka and Livny [Mutka amp; Livny 1991] found similar results. Table3 summarizes these results. We have identi ed a number of issues that have not been addressed by these previous e orts.... In PAGE 12: ...3. This di erence in de nition accounts for the dramatic dissimilarities seen in Table3 . While both Nichols apos; and Douglis apos; studies took place in the same year, there is a 40% net di erence in their results.... ..."

Cited by 120

### Table 1 gives examples of differences (choices and/or consequences) due to the two level abstraction approaches related to the Qz application.

"... In PAGE 7: ... Table1 : Example of differences (choice and/or consequences) due to the two method- ologies of level abstraction 3. 3 The dynamic in the two levels Qz-Cormas was developed before Qz-Rdk.... In PAGE 7: ... It particularly concerns the time for evaluation, by the system, of the diverse socio-economic parameters described previously. Table1 summarises the corresponding differences between Qz-Cormas and Qz-Rdk. We here introduce a more reactive and dynamic behaviour for Qz-Rdk, in order to test an alternative to the pre-programmed approach adopted in the initial Qz-Cormas.... In PAGE 9: ...n Qz-Cormas, in which all status is evaluated at the same time, namely monthly (cf. Table 2, line 2). In addition, the number of agents in the two simulations is different, that is, it is easier to become rich with few populations (cf. Table1 , lines 2 and 3). 4.... In PAGE 9: ...tatic that in Qz-Rdk (cf. Section 3. 1. 1, Section 3. 2. 1, and Table1 , line 5). a136 likewise, the time for evaluating different parameters (birth, death, goal, etc.... ..."

### Table 3: Related work. How previous e#0Borts have de#0Cned idle and the consequences of those

1995

"... In PAGE 12: ... Douglis and Ousterhout found that about two-thirds of machines were available on average #5BDouglis amp; Ousterhout 1991#5D, and Mutka and Livny #5BMutka amp; Livny 1991#5D found similar results. Table3 summarizes these results. Wehave identi#0Ced a number of issues that have not been addressed by these previous e#0Borts.... In PAGE 12: ...3. This di#0Berence in de#0Cnition accounts for the dramatic dissimilarities seen in Table3 . While both Nichols apos; and Douglis apos; studies took place in the same year, there is a 40#25 net di#0Berence in their results.... ..."

Cited by 120

### Table 2: Condition and consequence abilities of QR ingredients.

"... In PAGE 33: ... As these ingredients are incorporated as either conditions or consequences, model fragments have the possible relations hasCondition and hasConsequence. Table2 shows how certain model ingredients may be used as conditions and consequences.... ..."

### Table 1: Summary of properties of the QC consequence relation after composition rules in a proof. This means that proofs cannot be composed to give longer proofs, and so we can only view inference as a one-step process, not an interative process. The rejection of cut (transitivity) has also been examined for relevance logics as a solution to the problem of Lewis apos; paradoxes: ^ : `

2000

Cited by 7