The formalism of GUHA style data mining is confronted with the approach of relational structures of Düntsch, Orlowska and others. A computational complexity result on tautologies with implicational quantifiers is presented.
The formalism of GUHA style data mining is confronted with the approach of relational structures of Düntsch, Orlowska and others. A computational complexity result on tautologies with implicational quantifiers is presented. (en)
Proceedings of the sixth international workshop on Relational Methods in Computer Science RelMiCS'6 and the first international workshop of COST Action 274 Theory and Application of Relational Structures as Knowledge Instruments TARSKI.