TFX: The TPTP Extended Typed First-Order Form
Paper i proceeding, 2018

The TPTP world is a well established infrastructure that supports research, development, and deployment of Automated Theorem Proving systems for classical logics. The TPTP language is one of the keys to the success of the TPTP world. Originally the TPTP world supported only first-order clause normal form (CNF). Over the years support for full first-order form (FOF), monomorphic typed first-order form (TF0), rank-1 polymorphic typed first-order form (TF1), monomorphic typed higher-order form (TH0), and rank-1 polymorphic typed higher-order form (TH1), have been added. TF0 and TF1 together form the TFF language family; TH0 and TH1 together form the THF language family. This paper introduces the eXtended Typed First-order form (TFX), which extends TFF to include Boolean terms, tuples, conditional expressions, and let expressions.

Författare

Geoff Sutcliffe

University of Miami

Evgenii Kotelnikov

Chalmers, Data- och informationsteknik, Formella metoder

Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning co-located with Federated Logic Conference 2018

72-87

Workshop on Practical Aspects of Automated Reasoning
Oxford, ,

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Elektroteknik och elektronik

Datorsystem

Mer information

Skapat

2018-08-23