### Table 2: Complexity of inference and Space Efficiency of Theorem Representations

1996

Cited by 26

### Table 2: Complexity of inference and Space Efficiency of Theorem Representations

1996

Cited by 6

### Table 1. Complexity of inference, model checking and computation.

1997

"... In PAGE 12: ... For long sequences (m n) this can be useful. 4 Proof Sketches In this section, we give proof sketches for some of the results of Table1 and Table 2. Theorem 9.... ..."

Cited by 17

### Table 1. Complexity of inference, model checking and computation.

1997

"... In PAGE 12: ... For long sequences (m greatermuch n) this can be useful. 4 Proof Sketches In this section, we give proof sketches for some of the results of Table1 and Table 2. Theorem 14.... ..."

Cited by 17

### Table 1 Summary of computational complexities of conventional composition and transitive closure algorithms

"... In PAGE 12: ... In the worst case O(n2) storage space is required, as in the conventional approach. Table1 summarizes the above conclusions on computational complexity of conventional composition and transitive closure algorithms, using complete and sparse representations. One can easily see that the proposed representa- tion model is ideal for the case of sparse relations, as they have been deflned in section 2.... ..."

### Table 2: Complexity results for propositional DDBs (with integrity clauses) Semantics Inference of literal Inference of formula 9 model

1993

Cited by 31

### Table 1: Complexity of model checking and Space Efficiency of Model Representations

1996

Cited by 26

### Table 1: Complexity of model checking and Space Efficiency of Model Representations

1996

Cited by 6

### TABLE 2. Categorized items from the first part of the model perception questionnaire.

### Table 1: Symbols defined in the topological part of the graphical representation scheme.

1996

"... In PAGE 1: ... The complete evaporator would be a composite device containing two elementary devices and one elementary connection. The graphical symbols for elementary and composite components are given in Table1 . In order to connect the topology components into a complete network, we intro- duce various links or lines.... ..."

Cited by 4