Pages that link to "Item:Q3541708"
From MaRDI portal
The following pages link to leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708):
Displaying 20 items.
- leanCoP (Q21735) (← links)
- A proof-search procedure for intuitionistic propositional logic (Q377482) (← links)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- Bayesian ranking for strategy scheduling in automated theorem provers (Q2104545) (← links)
- Vampire getting noisy: Will random bits help conquer chaos? (system description) (Q2104552) (← links)
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075) (← links)
- The role of entropy in guiding a connection prover (Q2142077) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- Automated Constructivization of Proofs (Q2988387) (← links)
- MaLeCoP Machine Learning Connection Prover (Q3010374) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
