Skip to main content
SpringerLink
Log in

Well-behaved search and the Robbins problem

  • Invited Talk
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1232))

Included in the following conference series:

  • 847 Accesses

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.

References

  1. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 607, pages 462–476. Springer-Verlag, 1992.

    Google Scholar 

  2. W. Bibel, K. Furukawa, and M. Stickel, editors. Dagstuhl Seminar on Deduction (9512), Report 110, Schloss Dagstuhl, D-66687 Warden, Gemany, March 1995. IBFI GmbH.

    Google Scholar 

  3. E. V. Huntington. Boolean algebra. A correction. Trans. AMS, 35:557–558, 1933.

    MathSciNet  Google Scholar 

  4. E. V. Huntington. New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's Principia Mathematica. Trans. AMS, 35:274–304, 1933.

    MathSciNet  Google Scholar 

  5. D. Kapur, D. Musser, and P Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. J. Symbolic Computation, 6:19–36, 1988.

    Google Scholar 

  6. W. McCune. 33 basic test problems: A practical evaluation of some paramodulation strategies. In Robert Veroff, editor, Automated Reasoning: Essays in Honor of Larry Wos, chapter 5. MIT Press, 1997. To appear.

    Google Scholar 

  7. W. McCune. Solution of the Robbins problem. J. Automated Reasoning, 1997. To appear.

    Google Scholar 

  8. R. Niewenhuis and A. Rubio. Theorem proving with ordering and equality constrained clauses. J. Symbolic Computation, 19(4):321–351, 1995.

    Google Scholar 

  9. S. Winker. Robbins algebra: Conditions that make a near-Boolean algebra Boolean. J. Automated Reasoning, 6(4):465–489, 1990.

    Google Scholar 

  10. L. Wos. Automated Reasoning: 33 Basic Research Problems. Prentice-Hall, Englewood Cliffs, NJ, 1988.

    Google Scholar 

  11. L. Wos. The Automation of Reasoning: An Experimenter's Notebook with Otter Tutorial. Academic Press, New York, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Division, Argonne National Laboratory, 60439, Argonne, Illinois, USA

    William McCune

Authors
  1. William McCune
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McCune, W. (1997). Well-behaved search and the Robbins problem. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-62950-5_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation