On the complexity of resource-bounded logics

Natasha Alechina, Nils Bulling, St├ęphane Demri, Brian Logan. On the complexity of resource-bounded logics. Theoretical Computer Science, 750:69-100, 2018. [doi]

Abstract

Abstract is missing.