Skip to main content
SpringerLink
Log in

Analysis of Distributed-Search Contraction-Based Strategies

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1998)

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

Included in the following conference series:

Abstract

We present a model of parallel search in theorem proving for forward-reasoning strategies, with contraction and distributed search. We extend to parallel search the bounded-search-spaces approach to the measurement of infinite search spaces, capturing both the advantages of parallelization, e.g., the subdivision of work, and its disadvantages, e.g., the cost of communication, in terms of search space. These tools are applied to compare the search space of a distributed-search contraction-based strategy with that of the corresponding sequential strategy.

Supported in part by NSF grants CCR-94-08667 and CCR-97-01508.

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

Access this chapter

Log in via an institution
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. S. Anantharaman and M. P. Bonacina. An application of automated equational reasoning to many-valued logic. In M. Okada and S. Kaplan, editors, CTRS-90, volume 516 of LNCS, pages 156–161. Springer Verlag, 1990.

    Google Scholar 

  2. S. Anantharaman and J. Hsiang. Automated proofs of the Moufang identities in alternative rings. J. of Automated Reasoning, 6(1):76–109, 1990.

    Article  MathSciNet  Google Scholar 

  3. L. Bachmair and H. Ganzinger. Non-clausal resolution and superposition with selection and redundancy criteria. In A. Voronkov, editor, LPAR-92, volume 624 of LNAI, pages 273–284. Springer Verlag, 1992.

    Google Scholar 

  4. L. Bachmair and H. Ganzinger. A theory of resolution. Technical Report MPI-I-97-2-005, Max Planck Institut für Informatik, 1997.

    Google Scholar 

  5. M. P. Bonacina. On the reconstruction of proofs in distributed theorem proving: a modified Clause-Diffusion method. J. of Symbolic Computation, 21:507–522, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. P. Bonacina. Experiments with subdivision of search in distributed theorem proving. In M. Hitz and E. Kaltofen, editors, PASCO-97, pages 88–100. ACM Press, 1997.

    Google Scholar 

  7. M. P. Bonacina. Distributed contraction-based strategies: model and analysis. Technical Report 98-02, Dept. of Computer Science, University of Iowa, 1998.

    Google Scholar 

  8. M. P. Bonacina and J. Hsiang. Parallelization of deduction strategies: an analytical study. J. of Automated Reasoning, 13:1–33, 1994.

    Article  MathSciNet  Google Scholar 

  9. M. P. Bonacina and J. Hsiang. Towards a foundation of completion procedures as semidecision procedures. Theoretical Computer Science, 146:199–242, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. P. Bonacina and J. Hsiang. On the modelling of search in theorem proving — Towards a theory of strategy analysis. Information and Computation, forthcoming, 1998.

    Google Scholar 

  11. R. Bündgen, M. Göbel, and W. Küchlin. Strategy-compliant multi-threaded term completion. J. of Symbolic Computation, 21:475–506, 1996.

    Article  MATH  Google Scholar 

  12. J. Denzinger and S. Schulz. Recording and analyzing knowledge-based distributed deduction processes. J. of Symbolic Computation, 21:523–541, 1996.

    Article  MATH  Google Scholar 

  13. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–320. Elsevier, Amsterdam, 1990.

    Google Scholar 

  14. D. Kapur and H. Zhang. An overview of RRL: rewrite rule laboratory. In N. Dershowitz, editor, 3rd RTA, volume 355 of LNCS, pages 513–529. Springer Verlag, 1989.

    Google Scholar 

  15. C. Kirchner, C. Lynch, and C. Scharff. Fine-grained concurrent completion. In H. Ganzinger, editor, 7th RTA, volume 1103 of LNCS, pages 3–17. Springer Verlag, 1996.

    Google Scholar 

  16. A. Leitsch. The Resolution Calculus. Springer, Berlin, 1997.

    MATH  Google Scholar 

  17. W. McCune. Otter 3.0 reference manual and guide. Technical Report 94/6, MCS Div., Argonne Nat. Lab., 1994.

    Google Scholar 

  18. W. McCune. Solution of the Robbins problem. J. of Automated Reasoning, 19(3):263–276, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  19. D. A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay and J. Siekmann, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, pages 273–364. Oxford University Press, New York, 1993.

    Google Scholar 

  20. D. A. Plaisted and Y. Zhu. The Efficiency of Theorem Proving Strategies. Friedr. Vieweg & Sohns, 1997.

    Google Scholar 

  21. C. B. Suttner and J. Schumann. Parallel automated theorem proving. In L. Kanal, V. Kumar, H. Kitano, and C. B. Suttner, editors, Parallel Processing for Artificial Intelligence. Elsevier, Amsterdam, 1994.

    Google Scholar 

  22. A. Urquhart. The complexity of propositional proofs. Bulletin of Symbolic Logic, 1:425–467, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Iowa, Iowa City, IA, 52242-1419, USA

    Maria Paola Bonacina

Authors
  1. Maria Paola Bonacina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, Maryland, 20742, USA

    Jürgen Dix

  2. I.R.I.T. Université Paul Sabatier, 118 route de Narbonne, F-31062, Toulouse Cedex, France

    Luís Fariñas del Cerro

  3. Fachbereich 4: Informatik, Universität Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Ulrich Furbach

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonacina, M.P. (1998). Analysis of Distributed-Search Contraction-Based Strategies. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-49545-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65141-3

  • Online ISBN: 978-3-540-49545-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation