lolliCoP -- a linear logic implementation of a lean connection-method theorem prover for first-order classical logic
From MaRDI portal
(Redirected from lolliCoP -- a linear logic implementation of a lean connection-method theorem prover for first-order classical logic)
LolliCoP -- a linear logic implementation of a lean connection-method theorem prover for first-order classical logic
LolliCoP -- a linear logic implementation of a lean connection-method theorem prover for first-order classical logic
Recommendations
- IeanCOP: lean connection-based theorem proving
- Logic Programming with Focusing Proofs in Linear Logic
- Efficient resource management for linear logic proof search
- scientific article; zbMATH DE number 4055576
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
Cited in
(9)- IeanCOP: lean connection-based theorem proving
- lolliCoP
- Efficient resource management for linear logic proof search
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- scientific article; zbMATH DE number 1497840 (Why is no real title available?)
- Automated Deduction – CADE-20
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Finite model finding in first-order modal logics
This page was built for publication: lolliCoP -- a linear logic implementation of a lean connection-method theorem prover for first-order classical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539650)
