### Table 2. Proof System

2004

"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."

Cited by 34

### Table 2. Proof System

2004

"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."

Cited by 34

### Table 2. Proof System

2004

"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."

Cited by 34

### Table 2. Proof System

2004

Cited by 34

### Table 2. Proof System

2004

Cited by 34

### Table 3 and Table 4 integrate these optimizations into the basic enumerate technique we presented in Table 1 and Table 2.

2004

"... In PAGE 5: ... Table3 : An algorithm for exploring the equivalence class of a tree T for maximal subgraph mining Algorithm Maximal Subgraph Mining(G; ) begin 1. R fTjT is a frequent tree in Gg 2.... ..."

Cited by 21

### Table 9: The proof system

"... In PAGE 23: ... The proof system is defined in Table 10. Rules R1-R5 are essentially the same as in Table9 , where we have the rules for the finitary logics. The only difference is the hypothesis H.... ..."