Semantic Minimization of 3-Valued Propositional Formulae

This paper presents an algorithm for a non-standard logicminimization problem that arises in £ -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use £ -valued logic. An answer of ¤ or ¥ provides precise (definite) information; an answer of ¥§¦©¨ provides imprecise (indefinite) information. By replacing a formula  with a “better” formula  , 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).

• Type: Conference
• Year: 2002
• Where: LICS
• Authors: Thomas W. Reps, Alexey Loginov, Shmuel Sagiv
• Keywords: -valued Propositional Logic, Automated Reasoning, Better Answers, LICS 2002, Non-standard Logicminimization Problem