31 citations · 83 across the 33 of their papers we have counts for
1 paper · 1 filter
Lauri Hella, Antti Kuusisto, Arne Meier +1
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one f…