Abstract
In goal-directed proofs, such as those used in HOL, tactics often must operate on one or more specific assumptions. But goals often have many assumptions. Currently there is no good way to select or denote assumptions in HOL88. Most mechanisms are sensitive to inconsequential changes or are difficult to use.
Denoting assumptions by filters (matching) makes it easier to maintain large proofs and reuse pieces. But writing the filter predicate can be time-consuming and distracting.
We describe an aid to proof building which synthesizes filter functions from terms. Given examples of terms which should and should not be matched, the function creates an ML predicate which can be used, for example, with filter or Filter_asm_rewrite_tac.
This paper reviews past discussions on denotation methods, the design and implementation of the filter synthesizer, applicable AI classification techniques, and possible application to more general term handling and recognition.
This work was sponsored by the National Science Foundation under NSF grant MIP-9412581
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers, Principles, Techniques, and Tools. Addison-Wesley Publishing Co., 1986.
Jim Alves-Foss. message of 1 November 1991 to info-hol mailing list. (Available electronically at http://lal.cs.byu.edu/lal/hol-documentation.html)
Jaime G. Carbonell, Ryszard S. Michalski, and Tom M. Mitchell. (Eds.) Machine Learning. An Artificial Intelligence Approach. Tioga Publishing Company, Palo Alto, California, 94302, 1983, page 9.
Eugene Charniak, Christopher K. Riesbeck, and Drew V. McDermott. Artificial Intelligence Programming. Lawrence Erlbaum Associates, 1980, chapters 11 and 14, pp. 121–130 and 162–176.
Ching-Tsun Chou. “A Note on Interactive Theorem Proving with Theorem Continuation Functions,” in Higher Order Logic Theorem Proving and Its Applications (HOL '92), edited by Luc Claesen and Michael Gordon, Elsevier Science Publishers B.V., 1992, pp. 59–69.
Paul Curzon. Re: Accessing Assumptions. message of 25 May 1994 to hol2000 mailing list. (Available electronically at http://lal.cs.byu.edu/lal/holdocumentation.html)
M. J. C. Gordon and T. F. Melham. Introduction to HOL. A theorem proving environment for higher order logic. Cambridge University Press, 1993, Section 24.5, pp. 384–396.
Cao Feng and Stephen Muggleston. “Towards Inductive Generalisation in Higher Order Logic,” in Machine Learning: Proceedings of the Ninth International Workshop (ML92) edited by Derek Sleeman and Peter Edwards, Morgan Kaufmann Publishers, 1992, pp. 154–162.
John Harrison. Selecting Assumptions. message of 31 October 1991 to info-hol mailing list. (Available electronically at http://lal.cs.byu.edu/lal/holdocumentation.html)
Sara Kalvala, Myla Archer, Karl Levitt. “Implementation and Use of Annotations in HOL,” in Higher Order Logic Theorem Proving and Its Applications (HOL '92), edited by Luc Claesen and Michael Gordon, Elsevier Science Publishers B.V., 1992, pp. 407–426.
Kenji Kira and Larry A. Rendell. “A Practical Approach to Feature Selection,” in Machine Learning: Proceedings of the Ninth International Workshop (ML92) edited by Derek Sleeman and Peter Edwards, Morgan Kaufmann Publishers, 1992, pp. 249–256.
Miriam Leeser. assumption numbering, user interfaces .... message of 26 May 1994 to hol2000 mailing list, archived at http://lal.cs.byu.edu/lal/holdocumentation.html.
David Shepherd. Re: Accessing Assumptions. message of 26 May 1994 to hol2000 mailing list. (Available electronically at http://lal.cs.byu.edu/lal/holdocumentation.html)
Steven L. Tanimoto. The Elements of Artificial Intelligence. Computer Science Press, 1987.
Phillip J. Windley and Michael Coe. “A Correctness Model for Pipelined Microprocessors,” in Proceedings of the 1994 Conference on Theorem Provers in Circuit Design, edited by Thomas Kropf and Ramayya Kumar, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Black, P.E., Windley, P.J. (1995). Automatically synthesized term denotation predicates: A proof aid. In: Thomas Schubert, E., Windley, P.J., Alves-Foss, J. (eds) Higher Order Logic Theorem Proving and Its Applications. TPHOLs 1995. Lecture Notes in Computer Science, vol 971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60275-5_56
Download citation
DOI: https://doi.org/10.1007/3-540-60275-5_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60275-0
Online ISBN: 978-3-540-44784-9
eBook Packages: Springer Book Archive