1 citations · 1 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
Quasipolynomial Computation of Nested Fixpoints
Daniel Hausmann, Lutz Schröder
It is well-known that the winning region of a parity game with nodes and priorities can be computed as a -nested fixpoint of a suitable function; straightforward computa…
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…