Ambiguity decision tables and P-ternary logic functions

A decision table that treats inputs and outputs involving ambiguity is proposed. The table is defined so that its information loss is zero and it satisfies ambiguity monotonicity. Any action in the ambiguity decision table is represented by a P-ternary logic function. It is shown that the logic formula of a P-ternary logic function can uniquely be derived from the disjoint of all prime implicants of a Boolean function. The feasibility of some methods for implementing the ambiguity decision table by a computer is discussed.<>