Skip to main content

Strategy Parallel Use of Model Elimination with Lemmata

System Abstract

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

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

Abstract

Automated Deduction offers no unique strategy which is uniformly successful on all problems. Hence a parallel combination of strategies increases the chances of success. Our approach is made even more efficient by the exchange of suitable intermediate results. We present in this paper the model of a cooperative parallel model elimination prover which combines different lemma selection strategies in a strategy parallel prover environment. We assess the results of first experiments and give an outline of the future work.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Astrachan and D. Loveland. The Use of Lemmas in the Model Elimination Procedure. JAR, 19(1):117–141, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Conry, et al. DARES: A Distributed Automated Reasoning System. In AAAI-8, pages 78–85, 1990.

    Google Scholar 

  3. J. Draeger. Modularisierte Suche in Theorembeweisern. PhD thesis, Munich University of Technology, 1998.

    Google Scholar 

  4. J. Draeger. Acquisition of Useful Lemma Knowledge in Automated Reasoning. In AIMSA-98, LNAI 1480, pages 230–239, 1998.

    Google Scholar 

  5. D. Loveland. Mechanical Theorem-Proving by Model Elimination. JACM, 15(2), 1968.

    Google Scholar 

  6. M. Moser, et al. SETHEO and E-SETHEO. The CADE-13 Systems. JAR, 18(2):237–246, 1997.

    Article  Google Scholar 

  7. J. Schumann. DELTA-A Bottom-Up Preprocessor for Top-Down Theorem Provers. In CADE-12, LNAI 814, pages 774–777, 1994.

    Google Scholar 

  8. C. Suttner and J. Schumann. Parallel Automated Theorem Proving. In PPAI, pages 209–257, 1994.

    Google Scholar 

  9. A. Wolf and R. Letz. Strategy Parallelism in Automated Theorem Proving. IJPRAI, 13(2): to appear, 1998. AAAI Press.

    Google Scholar 

  10. A. Wolf. p-SETHEO: Strategy Parallelism in Automated Theorem Proving. In Tableaux’98, LNAI 1397, pages 320–324, 1998.

    Google Scholar 

  11. A. Wolf. Strategy Selection for Automated Theorem Proving. In AIMSA-98, LNAI 1480, pages 452–465, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolf, A., Draeger, J. (1999). Strategy Parallel Use of Model Elimination with Lemmata. In: Murray, N.V. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1999. Lecture Notes in Computer Science(), vol 1617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48754-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-48754-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66086-6

  • Online ISBN: 978-3-540-48754-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics