Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices

被引：4

作者：

Lahav, Ori ^{[1
]}

Zohar, Yoni ^{[2
]}

机构：

[1] Tel Aviv Univ, Tel Aviv, Israel

[2] Bar Ilan Univ, Ramat Gan, Israel

来源：

AUTOMATED REASONING, IJCAR 2022 | 2022年 / 13385卷

关键词：

S4;

D O I：

10.1007/978-3-031-10769-6_28

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A four-valued semantics for the modal logic K is introduced. Possible worlds are replaced by a hierarchy of four-valued valuations, where the valuations of the first level correspond to valuations that are legal w.r.t. a basic non-deterministic matrix, and each level further restricts its set of valuations. The semantics is proven to be effective, and to precisely capture derivations in a sequent calculus for K of a certain form. Similar results are then obtained for the modal logic KT, by simply deleting one of the truth values.

引用

页码：468 / 485

页数：18

共 50 条

[41] Effiective non-deterministic semantics for first-order LFIs
Zamansky, Anna
Avron, Arnon
JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2007, 13 (4-6) : 335 - 351
[42] Proof Search on Bilateralist Judgments over Non-deterministic Semantics
Greati, Vitor
Marcelino, Sergio
Marcos, Joao
AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2021, 2021, 12842 : 129 - 146
[43] Generalizations of lattices via non-deterministic operators
Martínez, J
Gutiérrez, G
de Guzmán, IP
Cordero, P
DISCRETE MATHEMATICS, 2005, 295 (1-3) : 107 - 141
[44] LTL Synthesis via Non-deterministic Planning
Lu, Xu
Yu, Bin
Tian, Cong
Duan, Zhen-Hua
Ruan Jian Xue Bao/Journal of Software, 2022, 33 (08): : 2769 - 2781
[45] Non-deterministic Matrices for Semi-canonical Deduction Systems
Lahav, Ori
2012 42ND IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL), 2012, : 79 - 84
[46] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Nystrom, SO
INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293
[47] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Computer Science Department, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
Inf. Process. Lett., 6 (289-293):
[48] A framework for reasoning under uncertainty based on non-deterministic distance semantics
Arieli, Ofer
Zamansky, Anna
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2011, 52 (02) : 184 - 211
[49] REMARKS ON THE SEMANTICS OF NON-NORMAL MODAL-LOGICS
SCHOTCH, PK
TOPOI-AN INTERNATIONAL REVIEW OF PHILOSOPHY, 1984, 3 (01): : 85 - 90
[50] A Benchmark Method for the Propositional Modal Logics K, KT, S4
Peter Balsiger
Alain Heuerding
Stefan Schwendimann
Journal of Automated Reasoning, 2000, 24 : 297 - 317

← 1 2 3 4 5 →