[IEEE 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - Kyoto, Japan (2015.7.6-2015.7.10)] 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science - The Complexity of Boundedness for Guarded Logics
Benedikt, Michael; Cate, Balder Ten; Colcombet, Thomas; Boom, Michael Vanden
- 作者Benedikt, Michael; Cate, Balder Ten; Colcombet, Thomas; Boom, Michael Vanden
- 文件大小298.14KB
- 发表时间2015
- DOI10.1109/lics.2015.36
- 页码293-304