Simplification of many-valued logic formulas using anti-links

From MaRDI portal





The authors consider the \(n\)-valued logic with the set of truth-values \(N= \{i_1,\dots, i_n\}\). The literals have the form \(S:p\), where \(p\) is a propositional variable and \(S\subset p\), \(S\neq 0\), \(S\neq N\). Formulas are ``true, ``false, literals and those expressions which can be formed by ``true, ``false, literals and the connectives \(\wedge\) and \(\vee\). An interpretation is a function \(I:\Sigma\to N\), where \(\Sigma\) is the set of propositional variables. An interpretation \(I\) satisfies a formula in the following cases: (i) for ``true -- always (ii) for ``false -- never (iii) for \(S:p\) -- if \(I(p)\in S\) (iv) for \(F_1\wedge\cdots\wedge F_m\) -- if \(I\) satisfies all of \(F_1,\dots, F_m\) (v) for \(F_1\vee\cdots\vee F_m\) -- if \(I\) satisfies at least one of the \(F_i\). Two formulas are logically equivalent when they are satisfied by the same interpretation. In the present paper, the authors present techniques for manipulating formulas, where the resulting formulas remain logically equivalent with their predecessors. The aim is to eliminate those cases where a formula \(F\) has a subformula \(X\vee Y\) with \(X\) and \(Y\) both containing the same literal.











This page was built for publication: Simplification of many-valued logic formulas using anti-links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209297)