### Table 1. Complexity of Equational Matching Problems Theory Decision Counting Theory Decision Counting

"... In PAGE 18: ... Using the theory of #P-completeness, we identi ed the complexity of #E-Matching problems for several equational theories E. Table1 summarizes our ndings and compares the complexity of counting problems in equational matching with the complexity of the corresponding decision problems. Although in most cases the NP-completeness of the decision problem is accompanied by the #P-completeness of the associated counting problem, it should be emphasized that in general there is no relation between the complexities of these two problems.... ..."

### Table 6: Operational semantics for the -angelic choice (a 2 A) can be easily extended to T 2. 3.3 Soundness and Completeness The aim of this section is to prove that the extended equational theories are sound and complete axiomatization of the several semantics equivalences. In order to do that term rewriting techniques are used. So, consider axioms A3 to A9 in Table 1 and all axioms in Table 5 with the left-to-right orientation as rewrite rules, i.e., if s = t is one of those axioms, the respective rewrite rule will be s ! t . Nevertheless, this term rewriting system is not con uent (modulo A1, A2) since axiom A9 is sometimes needed in the opposite direction. So, 6

"... In PAGE 6: ...2 Structured operational semantics Predicates # and a ?! are extended to the set T 2. Rules in Table6 de ne the operational semantics for the -angelic choice. The whole rule system (Tables 4 and 6) is in path for- mat [BV93].... ..."

### Table 8. Contingency table for complete theory Actual

1997

"... In PAGE 13: ...he rules increase accuracy from 30.4% to 49.5%. Finally, in Table8 , we show the results of testing the tag elimination theory in isolation. As expected, the theory is seriously under-general: only 62% of... ..."

Cited by 46

### Table 2: Rules of inference in the equational theory

"... In PAGE 18: ... Thus, the special case ; j= E = F states that E F (relative to the system of process equations ). The proof system is given in Table2 . Equivalence and congruence rules are R1-5.... ..."

### Table 2: Rules of inference in the equational theory

"... In PAGE 15: ... Thus, the special case ; j= E = F states that E F (relative to the system of process equations ). The proof system is given in Table2 . Equivalence and congruence rules are R1-5.... ..."

### Table 2: Rules of inference in the equational theory

"... In PAGE 18: ... Thus, the special case ; j= E = F states that E simF (relative to the system of process equations ). The proof system is given in Table2 . Equivalence and congruence rules are R1-5.... ..."

### Table 2: The equational theory for strong bisimilarity

1995

Cited by 11

### Table 2: The equational theory for strong bisimilarity

1995

Cited by 11

### Table 2: The equational theory for strong bisimilarity

### Table 3: Axiomatization of (N; 0; 1; +; )

"... In PAGE 35: ... By our completeness theorem for disjunctively closed algebras it follows that the full type hierarchy over this algebra is completely axiomatized by ( ), ( ), and the equational the- ory of this algebra. An axiomatization of this theory is shown in Table3 . The reader may recognize this as the equational theory of a commutative ring with unit.... ..."