CoNP Complexity for Combinations of Non-normal Modal Logics

被引：0

作者：

Dalmonte, Tiziano ^{[1
]}

Mazzullo, Andrea ^{[2
]}

机构：

[1] Free Univ Bozen Bolzano, Bolzano, Italy

[2] Univ Trento, Trento, Italy

来源：

AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2023 | 2023年 / 14278卷

关键词：

Non-normal modal logics; Combination of logics; Fusion; Universal modality; Complexity; Hypersequent calculus; FUSION DECIDABILITY; ABILITY; CALCULI;

D O I：

10.1007/978-3-031-43513-3_17

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We study the complexity of the validity/derivability problem for combinations of non-normal modal logics in the form of logic fusions, possibly extended with simple interaction axioms. We first present cutfree sequent calculi for these logic combinations. Then, we introduce hypersequent calculi with invertible rules, and show that they allow for a coNP proof search procedure. In the last part of the paper, we consider the case of combinations of logics sharing a universal modality. Using the hypersequent calculi, we show that these logics remain coNP-complete, and also provide an equivalent axiomatisation for them.

引用

页码：302 / 321

页数：20

共 50 条

[31] EPISTEMIC LOGIC, SKEPTICISM, AND NON-NORMAL MODAL LOGIC
SCHOTCH, PK
JENNINGS, RE
PHILOSOPHICAL STUDIES, 1981, 40 (01) : 47 - 67
[32] EVOLUTIONARY EPISTEMOLOGY AND NON-NORMAL MODAL LOGIC OF KNOWLEDGE
Lobovikov, Vladimir O.
VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-FILOSOFIYA-SOTSIOLOGIYA-POLITOLOGIYA-TOMSK STATE UNIVERSITY JOURNAL OF PHILOSOPHY SOCIOLOGY AND POLITICAL SCIENCE, 2018, 41 : 5 - 14
[33] On the complexity of elementary modal logics
Hemaspaandra, Edith
Schnoor, Henning
STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 349 - 360
[34] Complexity of products of modal logics
Marx, M
JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (02) : 197 - 214
[35] Complexity of products of modal logics
Department of Computing, Imperial College, London, United Kingdom
不详
J Logic Comput, 2 (197-214):
[36] Modal Hyperdoctrine: Higher-Order and Non-normal Extensions
Verity, Florrie
Maruyama, Yoshihiro
LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2024, 2024, 14672 : 225 - 242
[37] The complexity of regularity in grammar logics and related modal logics
Demri, S
JOURNAL OF LOGIC AND COMPUTATION, 2001, 11 (06) : 933 - 960
[38] On the Complexity of Graded Modal Logics with Converse
Bednarczyk, Bartosz
Kieronski, Emanuel
Witkowski, Piotr
LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 642 - 658
[39] Complexity of modal logics with Presburger constraints
Demri, Stephane
Lugiez, Denis
JOURNAL OF APPLIED LOGIC, 2010, 8 (03) : 233 - 252
[40] On the Complexity of Fragments of Horn Modal Logics
Bresolin, Davide
Munoz-Velasco, Emilio
Sciavicco, Guido
PROCEEDINGS 23RD INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING - TIME 2016, 2016, : 186 - 195

← 1 2 3 4 5 →