p-SETHEO: Strategy Parallelism in Automated Theorem Proving | SpringerLink
Skip to main content
Springer Nature Link
Log in

p-SETHEO: Strategy Parallelism in Automated Theorem Proving

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1397))

  • 338 Accesses

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.

This work is supported by the Deutsche Forschungsgemeinschaft within the Sonder-forschungsbereich 342, subproject A5.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Avenhaus et al. Discount: A system for distributed equational deduction. RTA-6, 1995.

    Google Scholar 

  2. M. P. Bonacina, J. Hsiang. Distributed deduction by clause diffusion: The Aquarius prover. LNAI 722, Springer, 1993.

    Google Scholar 

  3. B. I. Dahn et al. Integration of Automated and Interactive Theorem Proving in ILF. CADE-14, 1997.

    Google Scholar 

  4. A. Geist et al. PVM: Parallel Virtual Machine. MIT Press, 1994.

    Google Scholar 

  5. M. Moser et al. Setheo and E-Setheo. The CADE-13 Systems. JAR, 18(2), 1997.

    Google Scholar 

  6. D. B. Sturgill, A. M. Segre. A Novel Asynchronous Parallelism Scheme for First-Order Logic. CADE-12, 1994.

    Google Scholar 

  7. G. Sutcliffe et al. The TPTP Problem Library. CADE-12, 1994.

    Google Scholar 

  8. Ch. Suttner, J. Schumann. Parallel Automated Theorem Proving. PPAI, Elsevier, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, D-80290, Munich

    Andreas Wolf

Authors
  1. Andreas Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy, Tilburg University, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands

    Harrie de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolf, A. (1998). p-SETHEO: Strategy Parallelism in Automated Theorem Proving. In: de Swart, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science(), vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69778-0_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-69778-0_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64406-4

  • Online ISBN: 978-3-540-69778-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation