CondLean: a theorem prover for conditional logics
From MaRDI portal
Recommendations
- Automated Reasoning with Analytic Tableaux and Related Methods
- Theorem proving for conditional logics: CondLean and GOALDUCK
- A sequent calculus and a theorem prover for standard conditional logics
- NESCOND: an implementation of nested sequent calculi for conditional logics
- KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
Cited in
(16)- Embedding and automating conditional logics in classical higher-order logic
- From input/output logics to conditional logics via sequents -- with provers
- Systems and Implementations for Solving Reasoning Problems in Conditional Logics
- CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces
- CSL-\textsf{lean}: a theorem-prover for the logic of comparative concept similarity
- NESCOND: an implementation of nested sequent calculi for conditional logics
- Theorem proving for conditional logics: CondLean and GOALDUCK
- scientific article; zbMATH DE number 1305704 (Why is no real title available?)
- lean TAP revisited
- CoLoSS: the coalgebraic logic satisfiability solver
- A sequent calculus and a theorem prover for standard conditional logics
- KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
- Automated Reasoning with Analytic Tableaux and Related Methods
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- Mechanising Gödel-Löb provability logic in HOL light
- Sequent calculi and an efficient theorem prover for conditional logics with selection function semantics
This page was built for publication: CondLean: a theorem prover for conditional logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187875)
