Data mining techniques applied to decision support in real-life problems require a multi-step process. Inputs and outputs of these steps require some standard format to be followed in order to achieve a useful platform for the execution of data mining algorithms. There is a need to develop a uniform model where every operation can be expressed in a standard way, allowing algorithms to cooperate and to reuse results. We present, first, a common structure for the representation of inter-step results, and second, a model of the operator, i.e. the entity that handles and transforms this common structure according to a basic data mining algorithm.

We present here an effective proof theory that allows one to reason within algebras of algebraic logic in a purely syntactic, algebraic fashion. We demonstrate the effectiveness of the method by discussing our automated proofs of problems and theorem