ILTP
From MaRDI portal
Software:13195
swMATH437MaRDI QIDQ13195FDOQ13195
Author name not available (Why is that?)
Cited In (29)
- Herbrand constructivization for automated intuitionistic theorem proving
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
- Optimization techniques for propositional intuitionistic logic and their implementation
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations
- Title not available (Why is that?)
- 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
- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description
- Automated Reasoning with Analytic Tableaux and Related Methods
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
- Machine learning guidance for connection tableaux
- The ILTP problem library for intuitionistic logic
- Intuitionistic Decision Procedures Since Gentzen
- JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi
- Title not available (Why is that?)
- fCube: An Efficient Prover for Intuitionistic Propositional Logic
- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description
- Improvements to the Tableau Prover PITP
- The QMLTP Problem Library for First-Order Modal Logics
- Automating Theories in Intuitionistic Logic
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
- Restricting backtracking in connection calculi
- Practical Proof Search for Coq by Type Inhabitation
- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
- A tableaux calculus for default intuitionistic logic
This page was built for software: ILTP