The following pages link to leanCoP (Q21735):
Displaying 36 items.
- 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)
- ProofWatch: watchlist guidance for large theories in E (Q1791167) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← 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)
- Certification of nonclausal connection tableaux proofs (Q2180504) (← links)
- Herbrand constructivization for automated intuitionistic theorem proving (Q2180528) (← links)
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\) (Q2305414) (← links)
- Monte Carlo tableau proof search (Q2405274) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- A Connection Calculus for the Description Logic $$ {\mathcal{ALC}} $$ (Q2814524) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- HOL Based First-Order Modal Logic Provers (Q2870120) (← links)
- Automated Constructivization of Proofs (Q2988387) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- MaLeCoP Machine Learning Connection Prover (Q3010374) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- MleanCoP: A Connection Prover for First-Order Modal Logic (Q3192198) (← links)
- Efficient Low-Level Connection Tableaux (Q3455764) (← links)
- (Q3457212) (← links)
- FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover (Q3460043) (← links)
- Restricting backtracking in connection calculi (Q3568228) (← links)
- (Q4539650) (← 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)
- Hammering towards QED (Q5195271) (← links)
- (Q5219924) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479281) (← links)
