Alechina, N., Bulling, N., Demri, S., & Logan, B. S. (2018). On the complexity of resource-bounded logics. Theoretical Computer Science, 750, 69-100. https://doi.org/10.1016/j.tcs.2018.01.019