Destructive Extension Rule in Propositional Modal Logic S5 System

被引：0
|
作者：
Ma, Li Zheng [1 ]
Tan, Xi [1 ]
Huang, Pei [1 ]
Bai, Li [1 ]
Wu, Zi Yan [1 ]
机构：
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130023, Peoples R China
来源：
MANUFACTURING, DESIGN SCIENCE AND INFORMATION ENGINEERING, VOLS I AND II | 2015年
关键词：
extension rule; destructive; S5; RDS5; DMS5;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The extension rule reasoning algorithm as a new kind of reasoning algorithm has been constantly developed and improved; meanwhile, it is applied to the practical reasoning system. We mainly study how to apply the latest extension rule in the S5 to implement destructive reasoning. To start with, we put forward the RDS5 to reduce formulas, then use the K-pi Rule to prove the clause set unsatisfactory. From that, we present a DMS5 algorithm and prove the correctness of the algorithm.
引用
收藏
页码：1249 / 1255
页数：7
相关论文
共 50 条
  • [21] S5 WITH QUANTIFIABLE PROPOSITIONAL VARIABLES
    KAPLAN, D
    JOURNAL OF SYMBOLIC LOGIC, 1970, 35 (02) : 355 - &
  • [22] Visualizing Polymorphisms and Counter-Polymorphisms in S5 Modal Logic
    Falcao, Pedro
    DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2022, 2022, 13462 : 296 - 311
  • [23] Natural Deduction for Full S5 Modal Logic with Weak Normalization
    Martins, Ana Teresa
    Martins, Lilia Ramalho
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 129 - 140
  • [24] Gentzen-type sequent calculus for modal logic S5
    Alonderis, R.
    Giedra, H.
    LOGIC JOURNAL OF THE IGPL, 2025,
  • [25] BINARY CONNECTIVES FUNCTIONALLY COMPLETE BY THEMSELVES IN S5 MODAL LOGIC
    MASSEY, GJ
    JOURNAL OF SYMBOLIC LOGIC, 1967, 32 (01) : 91 - &
  • [26] A Henkin-Style Completeness Proof for the Modal Logic S5
    Bentzen, Bruno
    LOGIC AND ARGUMENTATION, CLAR 2021, 2021, 13040 : 459 - 467
  • [27] Finite Topological Models of Modal Logic Systems S4 and S5
    Li, Cao-lin
    Xu, Luo-shan
    QUANTITATIVE LOGIC AND SOFT COMPUTING 2010, VOL 2, 2010, 82 : 311 - 319
  • [28] A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
    Poggiolesi, Francesca
    REVIEW OF SYMBOLIC LOGIC, 2008, 1 (01): : 3 - 15
  • [29] Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring
    Huang, Pei
    Liu, Minghao
    Wang, Ping
    Zhang, Wenhui
    Ma, Feifei
    Zhang, Jian
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 1093 - 1100
  • [30] Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds
    Alviano, Mario
    Batsakis, Sotiris
    Baryannis, George
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2022, 2022, 13416 : 16 - 28
12345