PROOFTOOL: a GUI for the GAPT Framework

This paper introduces PROOFTOOL, the graphical user interface for the General Architecture for Proof Theory (GAPT) framework. Its features are described with a focus not only on the visualization but also on the analysis and transformation of proofs and related tree-like structures, and its implementation is explained. Finally, PROOFTOOL is compared with three other graphical interfaces for proofs.

[1]  Tiark Rompf,et al.  Packrat Parsing in Scala , 2009 .

[2]  Vincent Aravantinos,et al.  Decidability and Undecidability Results for Propositional Schemata , 2014, J. Artif. Intell. Res..

[3]  Volker Sorge,et al.  LΩUI: Lovely ΩMEGA User Interface , 1999, Formal Aspects of Computing.

[4]  Alexander Leitsch,et al.  CERES in higher-order logic , 2011, Ann. Pure Appl. Log..

[5]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[6]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[7]  Alexander Leitsch,et al.  Herbrand Sequent Extraction , 2008, AISC/MKM/Calculemus.

[8]  Alexander Leitsch,et al.  Cut-elimination and Redundancy-elimination by Resolution , 2000, J. Symb. Comput..

[9]  Cvetan Dunchev Institute of Computer Languages,et al.  PROOFTOOL: a GUI for the GAPT Framework , 2013 .

[10]  Geoff Sutcliffe,et al.  An Interactive Derivation Viewer , 2007, UITP@FLoC.

[11]  Alexander Leitsch,et al.  Cut-Elimination and Proof Schemata , 2013, TbiLLC.

[12]  Vincent Aravantinos,et al.  RegSTAB: A SAT Solver for Propositional Schemata , 2010, IJCAR.

[13]  Martin Odersky,et al.  Programming in Scala: A Comprehensive Step-by-Step Guide, 2nd Edition , 2010 .

[14]  Vincent Aravantinos,et al.  A Schemata Calculus for Propositional Logic , 2009, TABLEAUX.

[15]  William McCune,et al.  Ivy: a preprocessor and proof checker for first-order logic , 2000 .

[16]  Alexander Leitsch,et al.  Towards a clausal analysis of cut-elimination , 2006, J. Symb. Comput..

[17]  Alexander Leitsch,et al.  CERES: An analysis of Fürstenberg's proof of the infinity of primes , 2008, Theoretical Computer Science.

[18]  Stefan Hetzl,et al.  Proof Analysis with HLK, CERES and ProofTool: Current Status and Future Directions , 2008 .

[19]  Alexander Leitsch,et al.  Transforming and Analyzing Proofs in the CERES-System , 2008, LPAR Workshops.

[20]  Alexander Leitsch,et al.  Towards Algorithmic Cut-Introduction , 2012, LPAR.

[21]  Alexander Leitsch,et al.  System Description: The Proof Transformation System CERES , 2010, IJCAR.