Strategy Parallelism in Automated Theorem Proving

Abstract

Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successfifl on "all problems. A combination of more thmx one strategy increases the chances of success. Limitations of resources m~ time or processors enforce efficient use of these resources by partitioning the resources adequately among thc involved strategies. This leads to an optimization problem. Vv’e describe this problem for general search problems ~md discuss in more detail ,-m application in automated theorem proving.