On query procedures to build knowledge structures

Title:	On query procedures to build knowledge structures
Authors:	Ivo Düntsch , Dept of Computer Science , Brock University , St Catherines, Ontario, L2S 3A1, Canada Günther Gediga , Institut für Evaluation und Marktanalysen; Brinkstr. 19; D-49143 Jeggen; Germany
Status:	Journal of Mathematical Psychology 40(2), 1996, 160 - 168
Abstract:	Let Q be a finite set of problems. A knowledge state is the set of problems a person is capable of solving. A family K of knowledge states is called a knowledge structure, if the empty set and Q are elements of K. When K is closed under union, the structure is called a knowledge space. There exist effective algorithms to generate a knowledge space by querying an expert using an entail relation. In this note, we show that more general knowledge structures can be generated using modified query procedures. The general theory of the Galois connections between entail relations and knowledge structures is explored. Finally, we present query procedures which can be applied to generate any knowledge structure.