scientific article; zbMATH DE number 5850137
From MaRDI portal
Publication:3075241
Recommendations
- The TPTP World -- infrastructure for automated reasoning
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic
- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- Higher-order modal logics: automation and applications
- Automated theorem proving and logic programming: a natural symbiosis
- scientific article; zbMATH DE number 4117898
- Automating theories in intuitionistic logic
- scientific article; zbMATH DE number 4053062
- scientific article; zbMATH DE number 1127072
Cited in
(44)- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Embedding and automating conditional logics in classical higher-order logic
- Automating free logic in HOL, with an experimental application in category theory
- Reducing higher-order theorem proving to a sequence of SAT problems
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
- Cut-elimination for quantified conditional logic
- Extensional higher-order paramodulation in Leo-III
- Extracting Higher-Order Goals from the Mizar Mathematical Library
- Race against the teens -- benchmarking mechanized math on pre-university problems
- Internal guidance for Satallax
- Effective normalization techniques for HOL
- Automating free logic in Isabelle/HOL
- MaLeS: a framework for automatic tuning of automated theorem provers
- The higher-order prover \textsc{Leo}-II
- The TPTP typed first-order form with arithmetic
- Higher-order modal logics: automation and applications
- Verifying the modal logic cube is an easy task (for higher-order automated reasoners)
- The TPTP World -- infrastructure for automated reasoning
- scientific article; zbMATH DE number 1809864 (Why is no real title available?)
- scientific article; zbMATH DE number 3878393 (Why is no real title available?)
- \textsc{LeoPARD} -- a generic platform for the implementation of higher-order reasoners
- Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
- GoedelGod
- Extensional paramodulation for higher-order logic and its effective implementation Leo-III
- scientific article; zbMATH DE number 1863374 (Why is no real title available?)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic
- Translating between language and logic: what is easy and what is difficult
- Reducing higher-order theorem proving to a sequence of SAT problems
- Logic for Programming, Artificial Intelligence, and Reasoning
- The MET: The Art of Flexible Reasoning with Modalities
- Solving modal logic problems by translation to higher-order logic
- The logic languages of the TPTP world
- Combining and automating classical and non-classical logics in classical higher-order logics
- The dependently typed higher-order form for the TPTP world
- Dependently typed higher-order logic
- Notes on Gödel's and Scott's variants of the ontological argument
- Solving quantified modal logic problems by translation to classical logics
- Representation, verification, and visualization of Tarskian interpretations for typed first-order logic
- An empirical assessment of progress in automated theorem proving
- Stepping stones in the TPTP world
- Exploring Simplified Variants of Gödel’s Ontological Argument in Isabelle/HOL
- Automation of Boolos' Curious Inference in Isabelle/HOL
Describes a project that uses
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075241)
