### Table 4: Performance of the overall best theorem prover on individual classes of the RTE dataset.

2005

"... In PAGE 6: ... We report the raw accuracy and the con dence weighted score (CWS) in Table 3.5 Table4 shows the performance of the theorem prover split by RTE example class (as illustrated... In PAGE 7: ...3%.) Interestingly, the performance varies heavily by class, (see Table4 ), possibly indicating that some classes are inherently more dif cult. The baseline accuracy is close to random guessing, and the difference between our system performance and the baseline performance on the test set is statistically signi - cant (p lt; 0:02).... In PAGE 7: ... Since our logical formu- lae essentially restate the information in the dependency graph, our abductive inference and learning algorithms are not tied to the logical representation; in particular, the inference algorithm can be modi ed to work with these graph-based representations, where it can be interpreted as a graph-matching procedure that prefers globally consis- tent matchings. Table4 shows that certain classes require more effort in linguistic modeling, and improvements in those classes can lead to great overall gains in performance. The current rep- resentation fails to capture some important interactions in its dependencies (e.... ..."

Cited by 14

### Table 4: Performance of the overall best theorem prover on individual classes of the RTE dataset.

2005

"... In PAGE 6: ... We report the raw accuracy and the confidence weighted score (CWS) in Table 3.5 Table4 shows the performance of the theorem prover split by RTE example class (as illustrated... In PAGE 7: ...3%.) Interestingly, the performance varies heavily by class, (see Table4 ), possibly indicating that some classes are inherently more difficult. The baseline accuracy is close to random guessing, and the difference between our system performance and the baseline performance on the test set is statistically signifi- cant (p lt; 0.... In PAGE 7: ... Since our logical formu- lae essentially restate the information in the dependency graph, our abductive inference and learning algorithms are not tied to the logical representation; in particular, the inference algorithm can be modified to work with these graph-based representations, where it can be interpreted as a graph-matching procedure that prefers globally consis- tent matchings. Table4 shows that certain classes require more effort in linguistic modeling, and improvements in those classes can lead to great overall gains in performance. The current rep- resentation fails to capture some important interactions in its dependencies (e.... ..."

Cited by 14

### Table 3: Summary of Propositional Logic Theorem Provers

1996

"... In PAGE 30: ....1.1.5 Summary of Propositional logic theorem proving The following Table3 is a summary of the theorem provers just described. The information is based on readings from [17, 19, 16, 5, 12]... ..."

### Table 4. Experiments with cooperating theorem provers

"... In PAGE 7: ...s in Section 3.2. All in all, we tackled 81 provable problems. Results can be found in Table4 . Results of SPASS, SETHEO using the weighted depth bound (SETHEO wd), and SETHEO using the depth bound (SETHEO d) are displayed in columns 2{4.... In PAGE 7: ...Table 4. Experiments with cooperating theorem provers Table4 reveals the high potential of cooperation. The number of solved problems could be increased, additionally the runtimes could be decreased.... ..."

### Table 3. An exercise using an external theorem prover

2003

Cited by 6

### Table 3. An exercise using an external theorem prover

2003

Cited by 6

### Table 5: Experiments with cooperating theorem provers

1999

Cited by 3

### Table 1: Consistency checking for theorem provers and model builders

1999

"... In PAGE 10: ... Model building o ers a partial solution to this problem: as well as calling the theorem prover with input : , simultaneously call the model builder with input . In practice, this should successfully deal with many of the formulas the theorem prover can apos;t handle, as is shown in Table1 . Here the top row lists possible responses from the theorem prover to : , while the left hand column lists possible responses of the model builder to .... ..."

Cited by 16

### Table I. Problems used for the evaluation Textbooks Theorem Provers

Cited by 4