Abstract
The careful introduction of cut inferences can be used to structure and possibly compress formal sequent calculus proofs. This paper presents CIRes, an algorithm for the introduction of atomic cuts based on various modifications and improvements of the CERes method, which was originally devised for efficient cut-elimination. It is also demonstrated that CIRes is capable of compressing proofs, and the amount of compression is shown to be exponential in the length of proofs.
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
Baaz, M., Ciabattoni, A., Fermüller, C.: Cut elimination for first order gödel logic by hyperclause resolution. In: Logic for Programming, Artificial Intelligence, and Reasoning, pp. 451–466 (2008)
Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. In: Voronkov, A., Robinson, A. (eds.) Handbook of Automated Reasoning, pp. 275–333. Elsevier, Amsterdam (2001)
Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: Cut-Elimination: Experiments with CERES. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 481–495. Springer, Heidelberg (2005)
Baaz, M., Leitsch, A.: Cut-elimination and Redundancy-elimination by Resolution. Journal of Symbolic Computation 29(2), 149–176 (2000)
Baaz, M., Leitsch, A.: Comparing the complexity of cut-elimination methods. Proof Theory in Computer Science, 49–67 (2001)
Baaz, M., Leitsch, A.: Ceres in many-valued logics. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 1–20. Springer, Heidelberg (2005)
Baaz, M., Leitsch, A.: Methods of Cut-Elimination (2009) (to appear)
Baaz, M., Zach, R.: Algorithmic structuring of cut-free proofs. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 29–42. Springer, Heidelberg (1993)
Cook, S., Reckhow, R.: On the lengths of proofs in the propositional calculus (preliminary version). In: STOC 1974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 135–148. ACM, New York (1974)
Egly, U., Genther, K.: Structuring of computer-generated proofs by cut introduction. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol. 1289, pp. 140–152. Springer, Heidelberg (1997)
Finger, M., Gabbay, D.M.: Equal rights for the cut: Computable non-analytic cuts in cut-based proofs. Logic Journal of the IGPL 15(5-6), 553–575 (2007)
Hetzl, S.: Proof Fragments, Cut-Elimination and Cut-Introduction (manuscript)
Hetzl, S.: Proof Profiles. Characteristic Clause Sets and Proof Transformations. VDM (2008)
Hetzl, S., Leitsch, A., Weller, D., Paleo, B.W.: Herbrand sequent extraction. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol. 5144, pp. 462–477. Springer, Heidelberg (2008)
Miller, D., Nigam, V.: Incorporating tables into proofs. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 466–480. Springer, Heidelberg (2007)
Nigam, V.: Using tables to construct non-redundant proofs. In: CiE 2008: Abstracts and extended abstracts of unpublished papers (2008)
Orevkov, V.P.: Lower bounds for increasing complexity of derivations after cut-elimination (translation). Journal Sov. Math. (1982), 2337–2350 (1979)
Statman, R.: Lower bounds on Herbrand’s theorem. Proceedings of the American Mathematical Society 75, 104–107 (1979)
Urquhart, A.: The complexity of propositional proofs. Bulletin of Symbolic Logic 1(4), 425–467 (1995)
Weller, D.: Skolemization Problems and Cut-elimination (In Preparation). PhD thesis, Technische Universitaet Wien (Vienna University of Technology) (2009)
Paleo, B.W.: A General Analysis of Cut-Elimination by CERes. PhD thesis, Vienna University of Technology (2009)
Paleo, B.W.: Physics and proof theory. In: International Workshop on Physics and Computation (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woltzenlogel Paleo, B. (2010). Atomic Cut Introduction by Resolution: Proof Structuring and Compression. In: Clarke, E.M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science(), vol 6355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17511-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-17511-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17510-7
Online ISBN: 978-3-642-17511-4
eBook Packages: Computer ScienceComputer Science (R0)