12 citations · 17 across the 10 of their papers we have counts for
11 papers
Sori: Streamable and Controllable Model for Non-musical Audio to Symbolic Music Transformation
Kyungsu Kim, Yejin Kim, Kyogu Lee
We introduce Non-musical Audio to Symbolic Music Transformation (NASMT), a novel task that converts non-musical audio into symbolic music representations. Unlike automatic music tr…
Finite Convergence of the Modal Mu-Calculus on Almost-Periodic Words
Fabian Lehr, Florian Bruse
A formula of the modal mu-calculus enjoys finite convergence on a structure if there is some finite unfolding of the formula that defines the same set. A structure enjoys finite co…
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
Florian Bruse, Martin Lange
We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invarian…
Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints
Florian Bruse, David Kronenberger, Martin Lange
The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results i…
Verifying And Interpreting Neural Networks using Finite Automata
Marco Sälzer, Eric Alsmann, Florian Bruse +1
Verifying properties and interpreting the behaviour of deep neural networks (DNN) is an important task given their ubiquitous use in applications, including safety-critical ones, a…
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes
Florian Bruse, David Kronenberger, Martin Lange
Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi…
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
Eric Alsmann, Florian Bruse, Martin Lange
We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynam…
Local Higher-Order Fixpoint Iteration
Florian Bruse, Jörg Kreiker, Martin Lange +1
Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in…
A Canonical Model Construction for Iteration-Free PDL with Intersection
Florian Bruse, Daniel Kernberger, Martin Lange
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and te…
Alternation Is Strict For Higher-Order Modal Fixpoint Logic
Florian Bruse
We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinar…
The Fixpoint-Iteration Algorithm for Parity Games
Florian Bruse, Michael Falk, Martin Lange
It is known that the model checking problem for the modal mu-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz form…