Abstract
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure, in a restricted equational framework. The automatic procedure is based on superposition rules for the unit equality case. Proof transformation techniques aimed to improve the readability of the final proof are discussed.
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
Asperti, A., Coen, C.S., Tassi, E., Zacchiroli, S.: User Interaction with the Matita Proof Assistant. Journal of Automated Reasoning, Special Issue on User. Interfaces for Theorem Proving (to appear)
Ayache, N., Filliâtre, J.C.: Combining the Coq proof assistant with first-order decision procedures (Unpublished)
Barrett, C., Berezin, S.: CVC Lite: A New Implementation of the Cooperating Validity Checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 515–518. Springer, Heidelberg (2004)
Déharbe, D., Ranise, S., Fontaine, P.: haRVey, a cocktail of theories, http://harvey.loria.fr/
Hurd, J.: Integrating Gandalf and HOL. In: Proceedings of Theorem Proving in Higher Order Logics (TPHOL), pp. 311–321 (1999)
Kreitz, C., Schmitt, S.: A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems. Information and Computation 162(1-2), 226–254 (2000)
Mc Cune, W.: Solution of the Robbins Problem. Journal of Automated Reasoning 19(3), 263–276 (1997)
Meng, J., Paulson, L.: Experiments On Supporting Interactive Proof Using Resolution. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, Springer, Heidelberg (2004)
Meng, J., Paulson, L.: Translating Higher-Order Problems to First-Order Clauses. In: Sutcliffe, G., Schmidt, R., Schulz, S. (eds.) ESCoR: Empirically Successful Computerized Reasoning. CEUR Workshop Proceedings, vol. 192, pp. 70–80 (2006)
Meng, J., Quigley, C., Paulson, L.: Automation for Interactive Proof: First Prototype. Information and Computation 204(10), 1575–1596 (2006)
Nieuwenhuis, R., Rubio, A.: Paramodulation-Based Theorem Proving. Handbook of Automated Reasoning, 371–443 (2001)
Obua, S., Skalberg, S.: Importing HOL into Isabelle/HOL. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 298–302. Springer, Heidelberg (2006)
Paulin-Mohring, C.: Définitions Inductives en Théorie des Types d’Ordre Supŕieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I (1996)
Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Communications 15(2-3), 91–110 (2002)
Riazanov, A.: Implementing an Efficient Theorem Prover. PHD thesis, The University of Manchester (2003)
Schmitt, S., Lorigo, L., Kreitz, C., Nogin, A.: Jprover: Integrating connection-based theorem proving into interactive proof assistants. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 421–426. Springer, Heidelberg (2001)
Slaney, J., Fujita, M., Stickel, M.: Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems. Computers and Mathematics with Applications (1993)
Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)
Tammet, T.: A resolution theorem prover for intuitionistic logic. In: McRobbie, M.A., Slaney, J.K. (eds.) Automated Deduction - Cade-13. LNCS, vol. 1104, Springer, Heidelberg (1996)
The Coq Development Team: The Coq Proof Assistant Reference Manual (2006), http://coq.inria.fr/doc/main.html
Werner, B.: Une Théorie des Constructions Inductives. PHD thesis, Université Paris VII (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asperti, A., Tassi, E. (2007). Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds) Towards Mechanized Mathematical Assistants. MKM Calculemus 2007 2007. Lecture Notes in Computer Science(), vol 4573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73086-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-73086-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73083-5
Online ISBN: 978-3-540-73086-6
eBook Packages: Computer ScienceComputer Science (R0)