Efficient Satisfiability Checking for Coalgebraic Fixpoint Logics with Arithmetic Modalities

The paper presents a generic algorithm for exponential-time satisfiability checking in coalgebraic µ-calculi, without requiring the existence of tractable sets of modal tableau rules.