Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics
Logic in Computer Science
2017-10-17 v3 Computational Complexity
Abstract
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 for the lax semantics. Both problems turn out to be EXPTIME-complete on general structures. Finally, we show how for a specific class of structures NEXPTIME-completeness for these problems under strict semantics can be achieved.
Cite
@article{arxiv.1504.06409,
title = {Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics},
author = {Lauri Hella and Antti Kuusisto and Arne Meier and Heribert Vollmer},
journal= {arXiv preprint arXiv:1504.06409},
year = {2017}
}
Comments
Correction of MFCS 2015 paper