Pages that link to "Item:Q877897"

The following pages link to The ILTP problem library for intuitionistic logic (Q877897):

Displaying 22 items.

• 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. CNF release v1. 2. 1 (Q1272614) (← 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)
• Efficient SAT-based proof search in intuitionistic propositional logic (Q2055856) (← links)
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
• Theorem prover for intuitionistic logic based on the inverse method (Q2216868) (← 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)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations (Q3455767) (← links)
• leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
• A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications (Q3647294) (← links)
• Automating Theories in Intuitionistic Logic (Q3655199) (← links)
• From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← 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)
• General clauses for SAT-based proof search in intuitionistic propositional logic (Q6611961) (← links)