### Table 3: LLRM - Logical Link Reorientation Scheme

2002

Cited by 15

### 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 6. Comparison with several voting schemes.

1998

Cited by 58

### Table 1. Several Private Information Retrieval Schemes

2001

Cited by 6

### Table 1. Soil-Vegetation-Atmosphere Transfer Schemes That, at Present, Do Not Model Vegetation as a Dynamic Componenta

Cited by 4

### Table 12. The logic

1999

"... In PAGE 12: ... 7.1 Syntax The syntax of formulae is presented in Table12... ..."

Cited by 1

### Table 2. Scheme constructs in the di erent models at logical level

### 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... ..."