A Hierarchical System of Linear Logic for Exponential Time Complexity

被引：0
|
作者：
Redmond, Brian F.
机构：
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2019年 / 298期
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that Lafont's system of Soft Linear Logic together with a hierarchical version of digging captures the complexity class EXPTIME.
引用
收藏
页码：75 / +
页数：9
相关论文
共 50 条
  • [1] Linear logic by levels and bounded time complexity
    Baillot, Patrick
    Mazza, Damiano
    [J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) : 470 - 503
  • [2] Linear, polynomial or exponential? Complexity inference in polynomial time
    Ben-Amram, Amir M.
    Jones, Neil D.
    Kristiansen, Lars
    [J]. LOGIC AND THEORY OF ALGORITHMS, 2008, 5028 : 67 - +
  • [3] The complexity of counting models of linear-time temporal logic
    Torfah, Hazem
    Zimmermann, Martin
    [J]. ACTA INFORMATICA, 2018, 55 (03) : 191 - 212
  • [4] The complexity of the temporal logic with "until" over general linear time
    Reynolds, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (02) : 393 - 426
  • [5] The Complexity of Linear-Time Temporal Logic Model Repair
    Tao, Xiuting
    Li, Guoqiang
    [J]. STRUCTURED OBJECT-ORIENTED FORMAL LANGUAGE AND METHOD, SOFL+MSVL 2017, 2018, 10795 : 69 - 87
  • [6] The complexity of counting models of linear-time temporal logic
    Hazem Torfah
    Martin Zimmermann
    [J]. Acta Informatica, 2018, 55 : 191 - 212
  • [7] On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
    Baillot, Patrick
    [J]. INFORMATION AND COMPUTATION, 2015, 241 : 3 - 31
  • [8] The complexity of linear logic with weakening
    Urquhart, A
    [J]. LOGIC COLLOQUIM '98, 2000, 13 : 500 - 515
  • [9] On Parameterized Exponential Time Complexity
    Chen, Jianer
    Kanj, Iyad A.
    Ge Xia
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 168 - +
  • [10] On parameterized exponential time complexity
    Chen, Jianer
    Kanj, Iyad A.
    Xia, Ge
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2641 - 2648
12345