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 条
  • [21] Logos of Dao:: The primal logic of translatability
    Gangadean, A
    [J]. ASIAN PHILOSOPHY, 2002, 12 (03) : 213 - 221
  • [22] The disjunction property in the class of paraconsistent extensions of minimal logic
    Stukachyova M.V.
    [J]. Algebra and Logic, 2004, 43 (2) : 132 - 141
  • [23] ON THE COMPLEXITY OF XPATH CONTAINMENT IN THE PRESENCE OF DISJUNCTION, DTDS, AND VARIABLES
    Neven, Frank
    Schwentick, Thomas
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2006, 2 (03)
  • [24] Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
    Confalonieri, Roberto
    Carlos Nieves, Juan
    Vazquez-Salceda, Javier
    [J]. AI (ASTERISK) IA 2009: EMERGENT PERSPECTIVES IN ARTIFICIAL INTELLIGENCE, 2009, 5883 : 52 - 61
  • [25] Complexity and Expressive Power of Disjunction and Negation in Limit Datalog
    Kaminski, Mark
    Grau, Bernardo Cuenca
    Kostylev, Egor, V
    Horrocks, Ian
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2862 - 2869
  • [26] Logic programs with abstract constraints: Representaton, disjunction and complexities
    You, Jia-Huai
    Yuan, Li Yan
    Liu, Guohua
    Shen, Yi-Dong
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2007, 4483 : 228 - +
  • [27] Computing Logic Programs with Ordered Disjunction Using asprin
    Lee, Joohyung
    Yang, Zhun
    [J]. SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 57 - 61
  • [28] DISJUNCTION PROPERTY AND CHURCHS THESIS IN ARITHMETIC WITH GZEGORCZYK LOGIC
    PANKRATIEV, NA
    [J]. VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA, 1989, (06): : 63 - 65
  • [29] Semantics for a Basic Relevant Logic with Intensional Conjunction and Disjunction
    Gao, Ying
    Cheng, Jingde
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 169 (SUPPL.) : 61 - 71
  • [30] Generalized disjunction decomposition for the evolution of programmable logic array structures
    Stomeo, Emanuele
    Kalganova, Tatiana
    Lambert, Cyrille
    [J]. AHS 2006: FIRST NASA/ESA CONFERENCE ON ADAPTIVE HARDWARE AND SYSTEMS, PROCEEDINGS, 2006, : 179 - +
12345