The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
From MaRDI portal
Publication:2142078
DOI10.1007/978-3-030-86059-2_14OpenAlexW3196674925MaRDI QIDQ2142078
Publication date: 25 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_14
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ILTP problem library for intuitionistic logic
- IeanCOP: lean connection-based theorem proving
- Non-clausal connection calculi for non-classical logics
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- The higher-order prover Leo-III
- Untersuchungen über das logische Schliessen. II
- lean\(T^ AP\): Lean tableau-based deduction
- Herbrand constructivization for automated intuitionistic theorem proving
- Faster, higher, stronger: E 2.3
- System Description: GAPT 2.0
- nanoCoP: A Non-clausal Connection Prover
- The QMLTP Problem Library for First-Order Modal Logics
- A Non-clausal Connection Calculus
- MleanCoP: A Connection Prover for First-Order Modal Logic
- FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Restricting backtracking in connection calculi
- Matings in matrices
- ileanTAP: An intuitionistic theorem prover
- From Schütte’s Formal Systems to Modern Automated Deduction
- Prolog Technology Reinforcement Learning Prover
- Automated Reasoning with Analytic Tableaux and Related Methods
This page was built for publication: The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
