Compatibility relations for the representation of associations between variables in knowledge-based systems, and their use in approximate reasoning (Q1177686)

The paper studies production rules in which both IF and THEN parts consist of single variables, \(A\) and \(B\), respectively. The sets of all values of \(A\) and \(B\) are sets \(X\) and \(Y\), respectively. Six types of such rules are defined, all represented by their compatibility relations. The simplest type is represented by a compatibility relation that is the following function: \(X\times Y\to \{0,1\}\), the most sophisticated by the function (called a degree of belief): \(P\times Q\to [0,1]\), where \(P\subseteq 2^ X-\emptyset\) and \(Q\subseteq 2^ Y-\emptyset\). Also, the following problem is discussed: How a possibility distribution on \(Y\) is determined from a possibility distribution on \(X\) and a production rule represented by its compatibility relation.