References

  1. Vincent Aravantinos, Ricardo Caferra & Nicolas Peltier (2009): A Schemata Calculus for Propositional Logic. In: Automated Reasoning with Analytic Tableaux and Related Methods, Lecture Notes in Computer Science 5607. Springer, pp. 32–46, doi:10.1007/978-3-642-02716-1_4.
  2. Vincent Aravantinos, Ricardo Caferra & Nicolas Peltier (2010): RegSTAB: A SAT-Solver for Propositional Iterated Schemata. In: International Joint Conference on Automated Reasoning, pp. 309–315, doi:10.1007/978-3-642-14203-1_26.
  3. Vincent Aravantinos, Ricardo Caferra & Nicolas Peltier (2011): Decidability and Undecidability Results for Propositional Schemata. Journal of Artificial Intelligence Research 40, pp. 599–656, doi:10.1613/jair.3351.
  4. Matthias Baaz & Alexander Leitsch (2000): Cut-elimination and Redundancy-elimination by Resolution. Journal of Symbolic Computation 29(2), pp. 149–176, doi:10.1006/jsco.1999.0359.
  5. Matthias Baaz & Alexander Leitsch (2006): Towards a clausal analysis of cut-elimination. Journal of Symbolic Computation 41(3-4), pp. 381–410, doi:10.1016/j.jsc.2003.10.005.
  6. Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia & Daniel Weller (2010–2012): About Schemata And Proofs web page. http://www.logic.at/asap.
  7. Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia & Daniel Weller (2012): CERES for First-Order Schemata. submitted to the Journal of Logic and Computation.
  8. Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller & Bruno Woltzenlogel Paleo (2010): System Description: The Proof Transformation System CERES. In: Jürgen Giesl & Reiner Hähnle: Automated Reasoning, Lecture Notes in Computer Science 6173. Springer Berlin Heidelberg, pp. 427–433, doi:10.1007/978-3-642-14203-1_36.
  9. Stefan Hetzl, Alexander Leitsch & Daniel Weller (2011): CERES in higher-order Logic. Annals of Pure and Applied Logic 162(12), pp. 1001–1034, doi:10.1016/j.apal.2011.06.005.
  10. Stefan Hetzl, Alexander Leitsch & Daniel Weller (2012): Towards Algorithmic Cut-Introduction. In: Nikolaj Bj\IeCø rner & Andrei Voronkov: Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science. Springer Berlin Heidelberg, pp. 228–242, doi:10.1007/978-3-642-28717-6_19.
  11. Stefan Hetzl, Alexander Leitsch, Daniel Weller & Bruno Woltzenlogel Paleo (2008): Herbrand Sequent Extraction. In: Serge Autexier, John Campbell, Julio Rubio, Volker Sorge, Masakazu Suzuki & Freek Wiedijk: Intelligent Computer Mathematics, Lecture Notes in Computer Science 5144. Springer Berlin, pp. 462–477, doi:10.1007/978-3-540-85110-3_38.
  12. Stefan Hetzl, Alexander Leitsch, Daniel Weller & Bruno Woltzenlogel Paleo (2008): Proof Analysis with HLK, CERES and ProofTool - Current Status and Future Directions. In: Geoff Sutcliffe, Simon Colton & Stephan Schulz: Proceedings of the CICM Workshop on Empirically Successful Automated Reasoning in Mathematics, pp. 23–41.
  13. Stefan Hetzl, Alexander Leitsch, Daniel Weller & Bruno Woltzenlogel Paleo (2008): Transforming and Analyzing Proofs in the CERES-system. In: Piotr Rudnicki, Geoff Sutcliffe, Boris Konev, Renate Schmidt & Stephan Schulz: Proceedings of the LPAR 2008 Workshops Knowledge Exchange: Automated Provers and Proof Assistants, and The 7th International Workshop on the Implementation of Logics, pp. 77–91.
  14. Manohar Jonnalagedda (2009): Packrat Parsing in Scala.. Technical Report. École Polytechnique Fédérale de Lausanne. Available at http://scala-programming-language.1934581.n4.nabble.com/attachment/1956909/0/packrat_parsers.pdf.
  15. Ingo Maier (2009): The scala.swing package. http://www.scala-lang.org/sid/8.
  16. William McCune (2005–2010): Prover9 and Mace4. http://www.cs.unm.edu/~mccune/prover9/.
  17. William McCune & Olga Shumsky (2000): IVY: A Preprocessor and Proof Checker for First-order Logic. In: Matt Kaufmann, Panagiotis Manolios & J. Strother Moore: Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, doi:10.1007/978-1-4757-3188-0_16.
  18. Martin Odersky, Lex Spoon & Bill Venners (2010): Programming in Scala: A Comprehensive Step-by-step Guide, 2nd edition. Artima, Inc..
  19. Bruno Woltzenlogel Paleo (2007): An Approximate Gazetteer for GATE based on Levenshtein Edit Distance. In: Twelfth ESSLLI (European Summer School in Logic, Language and Information) Student Section, pp. 197–208.
  20. Bruno Woltzenlogel Paleo (2007): Herbrand Sequent Extraction. Vienna University of Technology.
  21. Alexandre Riazanov & Andrei Voronkov (2002): The design and implementation of VAMPIRE. AI Commun. 15(2,3), pp. 91–110.
  22. Jörg Siekmann, Stephan Hess, Christoph Benzmüller, Lassaad Cheikhrouhou, Armin Fiedler, Helmut Horacek, Michael Kohlhase, Karsten Konrad, Andreas Meier, Erica Melis, Martin Pollet & Volker Sorge (1999): LOUI: Lovely OMEGA User Interface. In: Formal Aspects of Computing, pp. 326–342.
  23. Geoff Sutcliffe (2009): The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0. Journal of Automated Reasoning 43(4), pp. 337–362, doi:10.1007/s10817-009-9143-8.
  24. Steven Trac, Yury Puzis & Geoff Sutcliffe (2006): An Interactive Derivation Viewer. In: Proceedings of the 7th Workshop on Workshop on User Interfaces for Theorem Provers, 3rd International Joint Conference on Automated Reasoning, volume 174 of Electronic Notes in Theoretical Computer Science, pp. 109–123.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org