Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

SMTtoTPTP - A Converter for Theorem Proving Formats

Thumbnail Image

Date

2015

Authors

Baumgartner, Peter

Journal Title

Journal ISSN

Volume Title

Publisher

Landes Bioscience/Springer Science+Business Media

Abstract

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 system developers, and for making TPTP systems available to users of SMT solvers. This paper describes how the conversion works, its functionality and limitations.

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/67634

Collections

ANU Research Publications

Source

Lecture Notes in Artificial Intelligence

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1007/978-3-319-21401-6_19

Restricted until

2037-12-31

Downloads

File
Description
01_Baumgartner_SMTtoTPTP_-_A_Converter_for_2015.pdf (165.61 KB)

DSpace software copyright © 2002-2026 LYRASIS