Cited in
(57)- Bayesian ranking for strategy scheduling in automated theorem provers
- Vampire getting noisy: Will random bits help conquer chaos? (system description)
- Theorem prover for intuitionistic logic based on the inverse method
- HOL Based First-Order Modal Logic Provers
- Aligning concepts across proof assistant libraries
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Automated Reasoning with Analytic Tableaux and Related Methods
- Automated Reasoning with Analytic Tableaux and Related Methods
- Implementing and evaluating provers for first-order modal logics
- Internal guidance for Satallax
- Eliminating models during model elimination
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
- The role of entropy in guiding a connection prover
- Teaching Automated Theorem Proving by Example: PyRes 1.2
- Machine learning guidance for connection tableaux
- The ILTP problem library for intuitionistic logic
- scientific article; zbMATH DE number 5305114 (Why is no real title available?)
- Monte Carlo tableau proof search
- Intuitionistic Decision Procedures Since Gentzen
- ILTP
- SETHEO
- STRIP
- LoTREC
- Polar
- DLog
- leanCoP
- JProver
- leanTAP
- QMLTP
- Imogen
- TABLEAUX
- ModLeanTAP
- SMTtoTPTP
- FOOL
- randoCoP
- FEMaLeCoP
- MleanCoP
- nanoCoP
- IntHistGC
- KoMeT
- intuit
- WhaleProver
- Proof Search for the First-Order Connection Calculus in Maude
- PyRes
- Specifying and verifying organizational security properties in first-order logic
- Practical Proof Search for Coq by Type Inhabitation
- A Non-clausal Connection Calculus
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
- A proof-search procedure for intuitionistic propositional logic
- MaLeCoP. Machine learning connection prover
- A Labelled System for IPL with Variable Splitting
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search
- BanditFuzz
- MleanCoP: a connection prover for first-order modal logic
- Prolog Technology Reinforcement Learning Prover
- nanoCoP: a non-clausal connection prover
This page was built for software: ileanCoP
