### Table II: Each sentence S1 entails sentence S2 because their noun phrases, verbs, adjectives, adverbs, or prepositions are in the entailment relation. The UNO natural language processing system correctly computes such entailments.

### Table 1B: Entailments of the Standard Model for the Production of Electronic Publishing Resources

"... In PAGE 10: ... 10 Table1 C: Entailments of the Standard Model in Electronic Publishing Literature Entailment Description Example in the E- publishing Literature SOCIAL BEHAVIOR Legitimacy and Control Controls are not as restrictive as in traditional journals; peer review is not as crucial at some levels. Participation will be more open and democratic.... ..."

### Table 1. Size relations entailed by the basic RCC-8 relations

"... In PAGE 3: ... For in- stance, (Y fTPPgZ) entails S(Y ) lt; S(Z), while (Y fPOgZ) en- tails S(Y )?S(Z). Table1 gives the entailed size relation s for each... ..."

### Table 3: Complexity of Deciding Entailment Given the Default Rankings

2000

"... In PAGE 7: ... For DE- entailment, exploiting the fact that the sum of all default ranks is minimal at DE, this can be done in polynomial time using parallel NP queries (see [17]). Table3 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

Cited by 7

### Table 5: Complexity of deciding entailment given the default rankings

2000

"... In PAGE 15: ... We remark that a similar BYC8C6C8 CZ algorithm is also feasible for DEB7, if the strengths ARB4CSB5 of defaults are bounded by a polynomial in the number of defaults. Table5 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

Cited by 19

### Table 5: Complexity of deciding entailment given the default rankings

"... In PAGE 18: ...15 Table5 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

### Table 2. Complexity of instance checking and conjunctive query entailment

"... In PAGE 13: ... A matching lower bound can be taken from [8] (which relies on the presence of general TBoxes and already applies to the instance problem), and thus we obtain P- completeness. 5 Summary and Outlook The results of our investigation are summarized in Table2 . In all cases the lower bounds apply to instance checking and the upper bounds to conjunctive query entailment.... ..."

Cited by 1

### Table 2: Accuracy of false entailment features for Run1

"... In PAGE 5: ...50 Table 1: Summary of accuracies across different data sets for MENT with weighted features (Run1) and using hard syntactic heuristics (Run2). 7 Discussion In order to better understand the drop in accuracy for MENT between the dev-test and the RTE2-test, we analyzed the accuracy of the features for de- termining false entailment across these different data sets in Table2 . Separately, we analyze the frequency with which these features apply in Table 3.... ..."

### Table 3: Complexity of deciding entailment given the default rankings

"... In PAGE 13: ... We remark that a similar BYC8C6C8 CZ algorithm is also feasible for DEB7, provided that the strengths ARB4CSB5 of defaults are not too big (in particular, if each ARB4CSB5 is bounded by a polynomial in the number of defaults). Table3 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

### Table 2: Examples of DE-, lexicographically, and conditionally entailed tight intervals.

2000

Cited by 26