CoLoSS: The Coalgebraic Logic Satisfiability Solver

DOI10.1016/j.entcs.2009.02.028zbMath1347.68300OpenAlexW2039834595MaRDI QIDQ4982113

Georgel Calin

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.028

zbMATH Keywords

modal logiccoalgebraautomatic proving

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30) Mechanization of proofs and logical operations (03B35) Combined logics (03B62)

Related Items (1)

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra

Uses Software

• Haskell
• CoLoSS
• Pellet
• FaCT++
• Racer
• PolyLib

Cites Work

• Bisimulation through probabilistic testing
• Presburger Modal Logic Is PSPACE-Complete
• Optimizing description logic subsumption
• A Modal Logic for Coalitional Power in Games
• Automated Reasoning with Analytic Tableaux and Related Methods
• CONCUR 2004 - Concurrency Theory
• Modular Algorithms for Heterogeneous Modal Logics
• Implementation of Functional Languages
• Probability logic for type spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CoLoSS: The Coalgebraic Logic Satisfiability Solver