Cut-elimination and redundancy-elimination by resolution
Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Comparing the Complexity of Cut-Elimination Methods
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Algorithmic Structuring of Cut-free Proofs
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Structuring of Computer-Generated Proofs by Cut Introduction
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proof Profiles - Characteristic Clause Sets and Proof Transformations
Proof Profiles - Characteristic Clause Sets and Proof Transformations
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Towards algorithmic cut-introduction
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
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.