SMTtoTPTP - A Converter for Theorem Proving Formats
Abstract. SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB for-mat supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arith-metics. The TPTP TFF format is an extension of the TPTP format widely used by automated theorem provers, adding a sort system and arithmetic theories. SMTtoTPTP is useful for, e.g., making SMT-LIB problems available to TPTP...[Show more]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Artificial Intelligence|
|01_Baumgartner_SMTtoTPTP_-_A_Converter_for_2015.pdf||165.61 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.