Semantic minimization of 3-valued propositional formulae
Semantic minimization of 3-valued propositional formulae
复制标题
三值命题公式的语义最小化
DOI：
10.1109/lics.2002.1029816
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Shmuel Sagiv
中科院分区：
文献类型：
--
作者：
T. Reps;Alexey Loginov;Shmuel Sagiv
本文给出了一个三值命题逻辑中的非标准逻辑最小化问题的算法。这个问题的动机是在使用3值逻辑的应用程序中获得更好的答案的潜力。答案为0或1提供精确（明确）信息;答案为1/2提供不精确（不确定）信息。通过用“更好的”公式/spl psi/替换公式/spl phi/，我们可以提高所获得的答案的精度。在本文中，我们给出了一个算法，总是产生一个公式，是“最好的”（在一定的定义良好的意义）。
This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula /spl phi/ with a "better" formula /spl psi/, we may improve the precision of the answers obtained. In this paper we give an algorithm that always produces a formula that is "best" (in a certain well-defined sense).