Abstract
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be used for very different applications. This paper reports a series of experiments designed to determine whether resolution can support interactive proof as it is currently done. In particular, we present a sound and practical encoding in first-order logic of Isabelle’s type classes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahrendt, W., Beckert, B., Hähnle, R., Menzel, W., Reif, W., Schellhorn, G., Schmitt, P.H.: Integrating automated and interactive theorem proving. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction— A Basis for Applications, Systems and Implementation Techniques, vol. II, pp. 97–116. Kluwer Academic Publishers, Dordrecht (1998)
Bezem, M., Hendriks, D., de Nivelle, H.: Automatic proof construction in type theory using resolution. Journal of Automated Reasoning 29(3-4), 253–275 (2002)
Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)
Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)
Hurd, J.: Integrating Gandalf and HOL. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 311–321. Springer, Heidelberg (1999)
Hurd, J.: An LCF-style interface between HOL and first-order logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 134–138. Springer, Heidelberg (2002)
Meng, J.: Integration of interactive and automatic provers. In: Carro, M., Correas, J. (eds.) Second CologNet Workshop on Implementation Technology for Computational Logic Systems (2003), On the Internet at http://www.cl.cam.ac.uk/users/jm318/papers/integration.pdf
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson and Voronkov [17], ch. 6. pp. 335–367
Owre, S., Rajan, S., Rushby, J.M., Shankar, N., Srivas, M.K.: PVS: Combining specification, proof checking, and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 411–414. Springer, Heidelberg (1996)
Paulson, L.C.: Generic automatic proof tools. In: Veroff, R. (ed.) Automated Reasoning and its Applications: Essays in Honor of Larry Wos, ch. 3. MIT Press, Cambridge (1997)
Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6, 85–128 (1998)
Paulson, L.C.: A generic tableau prover and its integration with Isabelle. Journal of Universal Computer Science 5(3), 73–87 (1999)
Paulson, L.C.: Isabelle’s isabelle’s logics: FOL and ZF. Technical report, Computer Laboratory, University of Cambridge (2003), On the Internet at http://isabelle.in.tum.de/dist/Isabelle2003/doc/logics-ZF.pdf
Riazanov, A., Voronkov, A.: Efficient checking of term ordering constraints. Preprint CSPP-21, Department of Computer Science, University of Manchester (February 2003)
Riazanov, A., Voronkov, A.: Vampire 1.1 (system description). In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 376–380. Springer, Heidelberg (2001)
Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning. Elsevier Science, Amsterdam (2001)
Siekmann, J., Benzmüller, C., Fiedler, A., Meier, A., Normann, I., Pollet, M.: Proof development with ωmega: The irrationality of \(\sqrt{2}\). In: Kamareddine, F. (ed.) Thirty Five Years of Automating Mathematics, pp. 271–314. Kluwer Academic Publishers, Dordrecht (2003)
Sutcliffe, G., Suttner, C.: The TPTP problem library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)
Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson and Voronkov [17], ch. 27. pp. 1965–2013
Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 307–322. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meng, J., Paulson, L.C. (2004). Experiments on Supporting Interactive Proof Using Resolution. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive