| 一个向上线序的命题时态逻辑PTL |
| |
| 引用本文： | 吕进.一个向上线序的命题时态逻辑PTL[J].西南师范大学学报(人文社会科学版),2010(2):70-74. |
| |
| 作者姓名： | 吕进 |
| |
| 作者单位： | 重庆大学贸易与行政学院,重庆市400030 |
| |
| 摘 要： | 命题时态逻辑PTL是一个可广泛应用于人工智能的逻辑，其特点是只有表达未来的时态算子。它刻画了人工智能研究中往往只需要描述未来状态，而不必关注过去的性质。PTL给出了一个表达时间具有向上线性、传递性、持续性和离散性的公理化逻辑系统，并证明了其可靠性和完全性。
|
| 关 键 词： | 时态逻辑 向上线序 离散性 完全性 |
A Propositional Temporal Logic With Up-Linear |
| |
| Institution: | LU Jin (College of Trade and Public Administration, Chongqing University, Chongqing 400032, China) |
| |
| Abstract: | The propositional temporal logic （PTL） with up linear can be used to artificial intelligent study. PTL was characterized by the temporal operator for the expression of future time in artificial intelligent study. PTL established an axiom system that it characterized the properties of time as up-linear, discreteness, seriality, transitivity, and so on. PTL was proved to be sound and complete. |
| |
| Keywords: | tempora logic up linear discreteness completeness |
| 本文献已被 维普 等数据库收录！ |
|
