Modal Operators and Multivalued Logics

人工智能的各种理论应用都利用了模式算子。模运算符通常被认为是一个函数，它以格式良好的公式为参数，并被赋予一个语义。本项目是对一种新的模算子形式化的理论和计算性质的研究。这种形式化将情态运算符视为由句法和语义两部分组成。这项研究的目的是检验这种新的形式化如何在一些不同的情态运算符下工作，并构建这一公式的通用实现，使我们能够查看在分析信念、知识、因果关系和简单的时间推理时出现的涉及情态运算符的具体例子。

A variety of theoretical applications of artificial intelligence make use of modal operators. A modal operator is often thought as a function that takes a well.formed formula as an argument and is assigned a semantics. This project is an investigation into the theoretical and computational properties of a new formalization of modal operators. This formalization views a modal operator as consisting of both a syntactic and semantic component. The aim of this research is to examine how this new formalization would work under a number of different modal operators and to construct a general purpose implementation of this formulation that allows us to look at specific examples involving the modal operators arising in the analysis of belief, knowledge, casuality and simple temporal reasoning.