Abstract
A list of challenge problems for automatic provers is presented, based on the theorem in calculus that the sum of two continuous functions is itself continuous.
Similar content being viewed by others
References
Bledsoe, W. W. and Hines, L., ‘Variable elimination and chaining in a resolution-based prover for inequalities’, Proc 5th Conf. on Automated Deduction, Les Arcs, France (Bibel, W. and Kowalski, R. R., Eds), Springer-Verlag, pp. 281–292 (1980).
Bledsoe, W. W., Kunen, K. and Shostak, R., ‘Completeness results for inequality provers’, A.I.J. 27, 255–288 (1985).
Hines, Larry, ‘Completeness for a prover for dense linear orders’, University of Texas CS Dept Report ATP 86, March 1989. Accepted for publication in J. Automated Reasoning.
Hines, Larry and Bledsoe, W. W., ‘The STR+VE prover’, University of Texas CS Dept Report ATP 94, August 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bledsoe, W.W. Challenge problems in elementary calculus. J Autom Reasoning 6, 341–359 (1990). https://doi.org/10.1007/BF00244493
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244493