Exploiting parallelism: highly competitive semantic tree theorem prover (Q4823345)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exploiting parallelism: highly competitive semantic tree theorem prover |
scientific article; zbMATH DE number 2110859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting parallelism: highly competitive semantic tree theorem prover |
scientific article; zbMATH DE number 2110859 |
Statements
Exploiting parallelism: highly competitive semantic tree theorem prover (English)
0 references
27 October 2004
0 references
0.7858062982559204
0 references
0.7623887062072754
0 references
0.7580969929695129
0 references
