The Complexity of Boundedness for Guarded Logics

Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom. The Complexity of Boundedness for Guarded Logics. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 293-304, IEEE, 2015. [doi]