par Doignon, Jean-Paul
;Falmagne, Jean-Claude 
Référence Discrete applied mathematics, 21, 2, page (87-100)
Publication Publié, 1988-10


Référence Discrete applied mathematics, 21, 2, page (87-100)
Publication Publié, 1988-10
Article révisé par les pairs
Résumé : | A knowledge space was defined as a family of subsets of questions closed under union. This concept provides a formal background for the design of knowledge assessment algorithms. We investigate here various numerical parameters measuring in some sense the intricacy of such a structure. Two sources are considered for these parameters: axiomatic convexity and the theory of ordered sets. © 1988. |