Modal Inclusion Logic: Being Lax is Simpler than Being Strict

@inproceedings{Hella2015ModalIL,
  title={Modal Inclusion Logic: Being Lax is Simpler than Being Strict},
  author={Lauri Hella and Antti Kuusisto and Arne Meier and Heribert Vollmer},
  booktitle={MFCS},
  year={2015}
}
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for strict and another one for lax semantics. The complexity of the lax version turns out to be complete for EXPTIME, whereas with strict semantics, the problem becomes NEXPTIME-complete. 
2
Twitter Mentions

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Lower bounds for multiplayer noncooperative games of incomplete information

G. Peterson, S. Azhar, J. H. Reif
  • Computers and Mathematics with Applications, 41:957–992
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Modal Independence Logic

VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

Dynamic Epistemic Logics

  • Johan van Benthem on Logic and Information Dynamics
  • 2014
VIEW 1 EXCERPT

Complexity of the Two-Variable Fragment with Counting Quantifiers

  • Journal of Logic, Language and Information
  • 2005
VIEW 1 EXCERPT

M

P. Blackburn
  • de Rijke, and Y. Venema. Modal Logic. Cambridge University Press
  • 2001
VIEW 3 EXCERPTS

Similar Papers

Loading similar papers…