Abstract
In this paper we discuss the successful execution of the LIM+ challenge problems as proposed by Bledsoe. This problem set ranges from a 12-step nonequality proof to a complex 41-step paramodulation proof. Our theorem prover is based on RUE resolution, which incorporates the axioms of equality into the definition of resolution. We apply hyperresolution as a restriction strategy and produce RUE hyper-refutations without the use of paramodulation. We present an extensive treatment of the heuristics applied to find proofs, both standalone and interactive.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bledsoe, W. W., Challenge problems in elementary calculus,J. Automated Reasoning 6(3) (1990), 341–59.
Digricoli, V. J. and Harrison, M. C., Equality-based binary resolution,J. ACM 33(2) (1986), 253–89.
Digricoli, V. J. and Kochendorfer, E., LIM+ challenge problems by RUE hyper-resolution, Proc. CADE-11, June 1992, pp. 239–52.
Chang, C. and Lee, R.,Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1989.
Digricoli, V. J., Lu, J. and Subrahmanian, V., And-or graphs applied to RUE resolution,IJCAI-89, pp. 354–58.
Lu, J. J. and Subrahmanian, V. S., Completeness issues IN RUE-NRF deduction: The undecidability of viability,J. Automated Reasoning 10 (1993), 371–88.
Digricoli, V. J., The management of heuristic search in Boolean exp's with RUE resolution,IJCAI-85, pp. 1154–61.
Wos, L. A., Overbeek, R. A. and Henschen, L., Hyperparamodulation — a refinement of paramodulation,Proc. of CADE-5, 1980, pp. 208–219.
Wilson, G. A. and Minker, J., Resolution refinements and search strategies: A comparative study,IEEE Trans. Computers, C-25, No. 8 (Aug. 1976).
Morris, J. B., E-resolution: An extension of resolution to include the equality relation,IJCAI-69, pp. 287–94.
Robinson, J. A., Automatic deduction with hyperresolution,Int. J. Computational Math., (1965), 227–234.
McCharen, J. D., Overbeek, R. A. and Wos, L., Problems and experiments for and with automated theorem proving programs.IEEE Trans. Computers,C-25, No. 8 (Aug. 1976), 773–82.
Author information
Authors and Affiliations
Additional information
This work was supported by the National Science Foundation Grant CCR-9024953.
Rights and permissions
About this article
Cite this article
Digricoli, V.J. The rue theorem-proving system: The complete set of LIM+ challenge problems. J Autom Reasoning 12, 241–264 (1994). https://doi.org/10.1007/BF00881889
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00881889