论文信息 - System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level

System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level

The Tramp system transforms the output of several automated theorem provers for first order logic with equality into natural deduction proofs at the assertion level. Through this interface, other systems such as proof presentation systems or interactive deduction systems can access proofs originally produced by any system interfaced by Tramp only by adapting the assertion level proofs to their own needs.

Andreas Meier

[1] Helmut Horacek. Presenting Proofs in a Human-Oriented Way , 1999, CADE.

[2] Norbert Eisinger. Completeness, confluence, and related properties of clause graph resolution , 1988 .

[3] Xiaorong Huang,et al. Reconstruction Proofs at the Assertion Level , 1994, CADE.

[4] Xiaorong Huang,et al. Translating Machine-Generated Resolution Proofs into ND-Proofs at the Assertion Level , 1996, PRICAI.

[5] Peter B. Andrews. Transforming Matings into Natural Deduction Proofs , 1980, CADE.

[6] Volker Sorge,et al. ΩMEGA : Towards a mathematical assistant , 1997 .

[7] Volker Sorge,et al. Omega: Towards a Mathematical Assistant , 1997, CADE.

[8] Michael Kohlhase,et al. System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving , 1999, CADE.

[9] Geoff Sutcliffe,et al. The TPTP Problem Library , 1994, CADE.

[10] Xiaorong Huang,et al. Presenting Machine-Found Proofs , 1996, CADE.

[11] Christoph Benzmüller,et al. System Description: LEO - A Higher-Order Theorem Prover , 1998, CADE.