Skip to main content
SpringerLink
Log in

The problem of explaining the disparate performance of hyperresolution and paramodulation

  • Basic Research Problem
  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This article is the sixth of a series of articles discussing various open research problems in automated reasoning. Here we focus on the effectiveness of hyperresolution versus that of paramodulation. The problem proposed for research asks one to find the properties that explain why paramodulation is so much more effective than hyperresolution is for solving various problems from algebra. Fore evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. McCharen, J., Overbeek, R., and Wos, L., ‘Complexity and related enhancements for automated theorem-proving programs’, Computers and Mathematics with Applications 2, 1–16 (1976).

    Google Scholar 

  2. Robinson, G., and Wos, L., ‘Paramodulation and theorem-proving in first-order theories with equality’, pp. 135–150 in Machine Intelligence 4, ed. B. Meltzer and D. Michie, Edinburgh University Press, Edinburgh (1969).

    Google Scholar 

  3. Robinson, J., ‘Automatic deduction with hyper-resolution’, International Journal of Computer Mathematics 1, pp. 227–234 (1965).

    Google Scholar 

  4. Smith, B., ‘Reference manual for the environental theorem prover, an incarnation of AURA’, Argonne National Laboratory report ANL-88-2.

  5. Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).

    Google Scholar 

  6. Wos, L., and Robinson, G., ‘Paramodulation and set of support’, pp. 276–310 in Proc. IRIA Sympodium on Automatic Demonstration, Lecture Notes in Mathematics, Vol. 125, Springer-Verlag, New York (1970).

    Google Scholar 

  7. Wos, L., and Robinson, G., ‘Maximal models and refutation completeness: semidecision procedures in automatic theorem proving’, pp. 609–639 in Word Problems: Decision Problems and the Burnside Problem in Group Theory, ed. W. Boone, F. Cannonito, and R. Lyndon, North-Holland, New York (1973).

    Google Scholar 

  8. Wos, L., Robinson, G., Carson, D., and Shalla, L.. ‘The concept of demodulation in theorem proving’, J. ACM 14, 698–709 (1967).

    Google Scholar 

  9. Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs, New Jersey (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Argonne National Laboratory, 9700 South Cass Ave., 60439-4844, Argonne, IL, USA

    Larry Wos

Authors
  1. Larry Wos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wos, L. The problem of explaining the disparate performance of hyperresolution and paramodulation. J Autom Reasoning 4, 215–217 (1988). https://doi.org/10.1007/BF00244395

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00244395

Key words

Search

Navigation