The complexity of primal logic with disjunction

被引：2
|
作者：
Magirius, Marco [1 ]
Mundhenk, Martin [1 ]
Palenta, Raphaela [2 ]
机构：
[1] Univ Jena, Inst Informat, D-07737 Jena, Germany
[2] Tech Univ Munich, Inst Informat, D-85748 Garching, Germany
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 05期
关键词：
Computational complexity; Non-classical logics; Model checking;
D O I：
10.1016/j.ipl.2015.01.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate the complexity of primal logic with disjunction according to the Kripke semantics as defined in [1] and the quasi-boolean semantics as defined in [2]. We show that the validity problem is coNP-complete, even for variable-free sequents. For quasi-boolean semantics, the satisfiability problem is shown to be NP-complete (even for variable-free sequents), whereas for Kripke semantics it is shown to be coNP-complete for variable-free sequents and Sigma(p)(2)-complete in the general case. The evaluation problem is in P for quasi-boolean semantics, but coNP-complete for Kripke semantics. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：536 / 542
页数：7
相关论文
共 50 条
  • [1] Propositional primal logic with disjunction
    Beklemishev, Lev
    Gurevich, Yuri
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2014, 24 (01) : 257 - 282
  • [2] The Complexity of Disjunction in Intuitionistic Logic
    Ramanujam, R.
    Sundararajan, Vaishnavi
    Suresh, S. P.
    [J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016), 2016, 9537 : 349 - 363
  • [3] The complexity of disjunction in intuitionistic logic
    Ramanujam, R.
    Sundararajan, Vaishnavi
    Suresh, S. P.
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 421 - 445
  • [4] The complexity of the disjunction and existential properties in intuitionistic logic
    Buss, S
    Mints, G
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 1999, 99 (1-3) : 93 - 104
  • [5] Disjunction and the Logic of Grounding
    Giovanni Merlo
    [J]. Erkenntnis, 2022, 87 : 567 - 587
  • [6] Disjunction and the Logic of Grounding
    Merlo, Giovanni
    [J]. ERKENNTNIS, 2022, 87 (02) : 567 - 587
  • [7] Logic programs with ordered disjunction
    Brewka, G
    Niemelä, I
    Syrjänen, T
    [J]. COMPUTATIONAL INTELLIGENCE, 2004, 20 (02) : 335 - 357
  • [8] Logic programndng with ordered disjunction
    Brewka, G
    [J]. EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 100 - 105
  • [9] The Logic of Multisets Continued: The Case of Disjunction
    Athanassios Tzouvaras
    [J]. Studia Logica, 2003, 75 (3) : 287 - 304
  • [10] Why the disjunction in quantum logic is not classical
    Aerts, D
    D'Hondt, E
    Gabora, L
    [J]. FOUNDATIONS OF PHYSICS, 2000, 30 (09) : 1473 - 1480
12345