CoLoSS: the coalgebraic logic satisfiability solver
From MaRDI portal
Publication:4982113
Recommendations
Cites work
- A Modal Logic for Coalitional Power in Games
- Bisimulation through probabilistic testing
- CONCUR 2004 - Concurrency Theory
- CondLean: a theorem prover for conditional logics
- scientific article; zbMATH DE number 1629944 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 1765711 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Implementation of Functional Languages
- Modular Algorithms for Heterogeneous Modal Logics
- Optimizing description logic subsumption
- Presburger Modal Logic Is PSPACE-Complete
- Probabilistic extensions of process algebras.
- Probability logic for type spaces
Cited in
(2)
This page was built for publication: CoLoSS: the coalgebraic logic satisfiability solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982113)