Using the TPTP Language for Writing Derivations and Finite Interpretations
From MaRDI portal
Recommendations
- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
- A tactic language for declarative proofs
- scientific article; zbMATH DE number 4006231
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1302060
- scientific article; zbMATH DE number 3952035
- The relationship of derivations in artificial languages to ordinary rigorous mathematical proof
- scientific article; zbMATH DE number 2185692
- Term rewriting and beyond -- theorem proving in Isabelle
- Foundations of Software Science and Computation Structures
Cited in
(12)- Faster, higher, stronger: E 2.3
- An interactive derivation viewer
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- Teaching Automated Theorem Proving by Example: PyRes 1.2
- The CADE-27 automated theorem proving system competition -- CASC-27
- HOL(y)Hammer: online ATP service for HOL Light
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
- Panoptes: an exploration tool for formal proofs
- System description: GAPT 2.0
This page was built for publication: Using the TPTP Language for Writing Derivations and Finite Interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613401)
