Abstract
In this article, we describe a procedure for systematically searching for shortest proofs in logical systems based on the inference rule condensed detachment. The procedure relies on applications of linked UR-resolution and uses demodulation to categorize derivations. Although the procedure is exhaustive in nature – and therefore realistically is applicable only to relatively small problems – it is shown to overcome the obstacles to finding shortest proofs presented by ordinary resolution-style theorem proving.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kneale, W. and Kneale, M.: The Development of Logic, Clarendon Press, Oxford, 1962.
McCune, W.: OTTER 3.0 reference manual and guide, Technical Report ANL-94/6, Argonne National Laboratory, Argonne, IL, 1994.
Meredith, C.: A single axiom of positive logic, J. Comput. Systems 1 (1953), 169-170.
Ulrich, D.: New single axioms for positive implication, Bull. Sect. Logic, to appear.
Veroff, R. and Wos, L.: The linked inference principle, I: The formal treatment, J. Automated Reasoning 8(2) (1992), 213-274.
Wos, L., Veroff, R., Smith, B., and McCune, W.: The linked inference principle, II: The user's viewpoint. in R. Shostak (ed.), Proceedings of the 7th International Conference on Automated Deduction, Lecture Notes in Comput. Sci. 170, Springer-Verlag, 1984, pp. 316-332.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Veroff, R. Finding Shortest Proofs: An Application of Linked Inference Rules. Journal of Automated Reasoning 27, 123–139 (2001). https://doi.org/10.1023/A:1010635625063
Issue Date:
DOI: https://doi.org/10.1023/A:1010635625063