Reducing redundancy in cut-elimination by resolution
暂无分享,去创建一个
[1] Alexander Leitsch,et al. System Description: The Proof Transformation System CERES , 2010, IJCAR.
[2] Alexander Leitsch,et al. PROOFTOOL: a GUI for the GAPT Framework , 2012, UITP.
[3] Stefan Hetzl. Proof Profiles: Characteristic Clause Sets and Proof Transformations , 2008 .
[4] Jean Goubault-Larrecq,et al. Normal Form Transformations , 2001, Handbook of Automated Reasoning.
[5] M. Baaz,et al. Methods of Cut-Elimination , 2011 .
[6] Alexander Leitsch,et al. Transforming and Analyzing Proofs in the CERES-System , 2008, LPAR Workshops.
[7] Alexander Leitsch,et al. Proof Transformation by CERES , 2006, MKM.
[8] Alexander Leitsch,et al. Cut-elimination and Redundancy-elimination by Resolution , 2000, J. Symb. Comput..
[9] Alan Robinson,et al. Handbook of automated reasoning , 2001 .
[10] Alexander Leitsch,et al. Towards a clausal analysis of cut-elimination , 2006, J. Symb. Comput..
[11] Bruno Woltzenlogel Paleo,et al. Atomic Cut Introduction by Resolution: Proof Structuring and Compression , 2010, LPAR.
[12] Alexander Leitsch,et al. Towards CERes in intuitionistic logic , 2012, CSL.
[13] Alexander Leitsch,et al. The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.
[14] Alexander Leitsch,et al. Herbrand Sequent Extraction , 2008, AISC/MKM/Calculemus.
[15] Alexander Leitsch,et al. A Clausal Approach to Proof Analysis in Second-Order Logic , 2009, LFCS.