THF0 --- The Core of the TPTP Language for Higher-Order Logic

Authors:
Christoph Benzmüller;Florian Rabe;Geoff Sutcliffe
Affiliations:
Saarland University, Germany;Jacobs University Bremen, Germany;University of Miami, USA
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 14
Cited 10

A framework for defining logics

Journal of the ACM (JACM)
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Towards a standard upper ontology

Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
The TPTP Problem Library

Journal of Automated Reasoning
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: LEO - A Higher-Order Theorem Prover

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
The state of CASC

AI Communications
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Using the TPTP language for writing derivations and finite interpretations

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Extending the TPTP language to higher-order logic with automated parser generation

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A structured set of higher-order problems

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
TPTP, TSTP, CASC, etc.

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Progress in the Development of Automated Theorem Proving for Higher-Order Logic

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combining logics in simple type theory

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
The TPTP world - infrastructure for automated reasoning

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Combining and automating classical and non-classical logics in classical higher-order logics

Annals of Mathematics and Artificial Intelligence
Higher-order aspects and context in SUMO

Web Semantics: Science, Services and Agents on the World Wide Web
The TPTP typed first-order form with arithmetic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
TFF1: the TPTP typed first-order form with rank-1 polymorphism

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This paper introduces the core of the TPTP language for higher-order logic --- THF0, based on Church's simple type theory. THF0 is a syntactically conservative extension of the untyped first-order TPTP language.