THF0 – The Core of the TPTP Language for Higher-Order Logic-Reference-Cited by-同舟云学术

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

Published: Issue: Volume: Page:491-506
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Benzmüller Christoph,Rabe Florian,Sutcliffe Geoff

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71070-7_41.pdf

Reference32 articles.

1. Andrews, P.B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F., Xi, H.: TPS: A Theorem-Proving System for Classical Type Theory. Journal of Automated Reasoning 16(3), 321–353 (1996)

2. Beeson, M.: Otter-lambda, a Theorem-prover with Untyped Lambda-unification. In: Sutcliffe, G., Schulz, S., Tammet, T. (eds.) Proceedings of the Workshop on Empirically Successful First Order Reasoning (2004)

3. Lecture Notes in Computer Science;C. Benzmüller,2005

4. Benzmüller, C., Brown, C., Kohlhase, M.: Higher-order Semantics and Extensionality. Journal of Symbolic Logic 69(4), 1027–1088 (2004)

5. Lecture Notes in Artificial Intelligence;C. Benzmüller,1998

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving the Diproche CNL through Autoformalization via Large Language Models;Electronic Proceedings in Theoretical Computer Science;2024-04-06

2. The Naproche-ZF Theorem Prover (Short Paper);Lecture Notes in Computer Science;2024

3. Translating SUMO-K to Higher-Order Set Theory;Frontiers of Combining Systems;2023

4. A Survey of Languages for Formalizing Mathematics;Lecture Notes in Computer Science;2020

5. GRUNGE: A Grand Unified ATP Challenge;Lecture Notes in Computer Science;2019