首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Modal extension rule
作者姓名:WU Xi  SUN Jigui  LIN Hai  FENG Shasha
作者单位:College of Computer Science and Technology, Jilin University, Changchun 130012, China; Key Laboratory for Symbolic Computation and Knowledge Engineering, Jilin University, Changchun 130012, China,College of Computer Science and Technology, Jilin University, Changchun 130012, China; Key Laboratory for Symbolic Computation and Knowledge Engineering, Jilin University, Changchun 130012, China,College of Computer Science and Technology, Jilin University, Changchun 130012, China; Key Laboratory for Symbolic Computation and Knowledge Engineering, Jilin University, Changchun 130012, China,College of Computer Science and Technology, Jilin University, Changchun 130012, China; Key Laboratory for Symbolic Computation and Knowledge Engineering, Jilin University, Changchun 130012, China
摘    要:Modal logics are good candidates for a formal theory of agents. The efficiency of reasoning method in modal logics is very important, because it determines whether or not the reasoning method can be widely used in systems based on agent. In this paper, we modify the extension rule theorem proving method we presented before, and then apply it to P-logic that is translated from modal logic by functional transformation. At last, we give the proof of its soundness and completeness.

关 键 词:theorem  proving    extension  rule    modal  logics    functional  transformation.
点击此处可从《自然科学进展(英文版)》浏览原始摘要信息
点击此处可从《自然科学进展(英文版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号