Finding Shortest Proofs: An Application of Linked Inference Rules

Authors:
Robert Veroff
Affiliations:
University of New Mexico, Albuquerque, NM 87131, U.S.A.
Venue:
Journal of Automated Reasoning
Year:
2001

Citing 2
Cited 2

The linked inference principle, I.: the formal treatment

Journal of Automated Reasoning
The Linked Inference Principle, II: The User's Viewpoint

Proceedings of the 7th International Conference on Automated Deduction

A Legacy Recalled and a Tradition Continued

Journal of Automated Reasoning
Hilbert's Twenty-Fourth Problem

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.