ileanCoP - MaRDI portal

swMATH9757MaRDI QIDQ21736FDOQ21736

Author name not available (Why is that?)

Cited In (32)

Specifying and Verifying Organizational Security Properties in First-Order Logic
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
MaLeCoP Machine Learning Connection Prover
nanoCoP: A Non-clausal Connection Prover
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
MleanCoP: A Connection Prover for First-Order Modal Logic
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
Teaching Automated Theorem Proving by Example: PyRes 1.2
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
Machine learning guidance for connection tableaux
Title not available (Why is that?)
The ILTP problem library for intuitionistic logic
Monte Carlo tableau proof search
Intuitionistic Decision Procedures Since Gentzen
Internal Guidance for Satallax
Proof Search for the First-Order Connection Calculus in Maude
Practical Proof Search for Coq by Type Inhabitation
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
A Non-clausal Connection Calculus
A proof-search procedure for intuitionistic propositional logic
A Labelled System for IPL with Variable Splitting
Prolog Technology Reinforcement Learning Prover
\textsf{lazyCoP}: lazy paramodulation meets neurally guided search
Title not available (Why is that?)

This page was built for software: ileanCoP