The following pages link to ILTP (Q13195):
Displayed 29 items.
- The ILTP problem library for intuitionistic logic (Q877897) (← links)
- Optimization techniques for propositional intuitionistic logic and their implementation (Q959821) (← links)
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus (Q991900) (← links)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic (Q2180511) (← links)
- Herbrand constructivization for automated intuitionistic theorem proving (Q2180528) (← links)
- A tableaux calculus for default intuitionistic logic (Q2305412) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- The QMLTP Problem Library for First-Order Modal Logics (Q2908515) (← links)
- (Q3075241) (← links)
- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description (Q3192197) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations (Q3455767) (← links)
- Restricting backtracking in connection calculi (Q3568228) (← links)
- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 (Q3608769) (← links)
- Automating Theories in Intuitionistic Logic (Q3655199) (← links)
- JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi (Q4589603) (← links)
- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description (Q4928444) (← links)
- fCube: An Efficient Prover for Intuitionistic Propositional Logic (Q4933312) (← links)
- (Q5018490) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method (Q5191105) (← links)
- Improvements to the Tableau Prover PITP (Q5434492) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479292) (← links)
- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic (Q5505551) (← links)