Cool -- a generic reasoner for coalgebraic hybrid logics. We describe the coalgebraic ontology logic solver Cool, a generic reasoner that decides the satisfiability of modal (and, more generally, hybrid) formulas with respect to a set of global assumptions – in description logic parlance, we support a general TBox and internalize a Boolean ABox. The level of generality is that of coalgebraic logic, a logical framework covering a wide range of modal logics, beyond relational semantics. The core of Cool is an efficient unlabelled tableaux search procedure using global caching. Concrete logics are added by implemening the corresponding (one-step) tableaux rules. The logics covered at the moment include standard relational examples as well as graded modal logic and Pauly’s coalition logic (the next-step fragment of alternating-time temporal logic), plus every logic that arises as a fusion of the above. We compare the performance of Cool with state-of-the-art reasoners.
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Nalon, Cláudia; Pattinson, Dirk: A resolution-based calculus for preferential logics (2018)
- Ferrari, Mauro; Fiorentini, Camillo; Fiorino, Guido: JTabWb: a Java framework for implementing terminating sequent and tableau calculi (2017)
- Demri, Stéphane (ed.); Kapur, Deepak (ed.); Weidenbach, Christoph (ed.): Automated reasoning. 7th international joint conference, IJCAR 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 19--22, 2014. Proceedings (2014)
- Gorín, Daniel; Pattinson, Dirk; Schröder, Lutz; Widmann, Florian; Wißmann, Thorsten: Cool -- a generic reasoner for coalgebraic hybrid logics (System description) (2014) ioport