1 citations · 1 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.FL2020
A Linear-Time Nominal -Calculus with Name Allocation
Daniel Hausmann, Stefan Milius, Lutz Schröder
Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate…
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…