p-SETHEO: Strategy Parallelism in Automated Theorem Proving

  • Authors:
  • Andreas Wolf

  • Affiliations:
  • -

  • Venue:
  • TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successful on all problems. A combination of more than one strategy increases the chances of success. Limitations of resources such as time or the number of available processors enforce efficient use of these resources by partitioning them adequately among the involved strategies. One of the problems to be solved in the context of resource scheduling is an optimization problem. We describe this problem and discuss the prototypical theorem prover p-SETHEO.