Showing cs.LOShow all
3 papers · 1 filter
cs.LO2023
COOL 2 -- A Generic Reasoner for Modal Fixpoint Logics
Oliver Görlitz, Daniel Hausmann, Merlin Humml +3
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood st…
cs.LO2020
NP Reasoning in the Monotone -Calculus
Daniel Hausmann, Lutz Schröder
Satisfiability checking for monotone modal logic is known to be (only) NP-complete. We show that this remains true when the logic is extended with aconjunctive and alternation-free…
cs.LO2019
Optimal Satisfiability Checking for Arithmetic -Calculi
Daniel Hausmann, Lutz Schröder
The coalgebraic -calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or g…