swMATH437MaRDI QIDQ13195FDOQ13195
Author name not available (Why is that?)
Official website: http://www.cs.uni-potsdam.de/ti/iltp/
Cited In (53)
- 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
- Automating theories in intuitionistic logic
- 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
- Automated Reasoning with Analytic Tableaux and Related Methods
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
- The QMLTP problem library for first-order modal logics
- 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
- SATLIB
- THF0
- STRIP
- CoLoSS
- ileanCoP
- JProver
- QMLTP
- fCube
- Imogen
- PITP
- linTAP
- llprover
- TABLEAUX
- IDV
- JTabWb
- GAPT
- BDDIntKt
- IntHistGC
- DeReS
- intuit
- Slakje
- WhaleProver
- Improvements to the Tableau Prover PITP
- 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
- ILLTP
- Sympli
- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
- Disproving using the inverse method by iterative refinement of finite approximations
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
- A tableaux calculus for default intuitionistic logic
- The ILLTP library for intuitionistic linear logic
- fCube: an efficient prover for intuitionistic propositional logic
- An improved BDD method for intuitionistic propositional logic: BDDIntKt system description
- A history-based theorem prover for intuitionistic propositional logic using global caching: IntHistGC system description
- JTabWb: a Java framework for implementing terminating sequent and tableau calculi
This page was built for software: ILTP
