论文信息 - Parametrization of knowledge structures

Parametrization of knowledge structures

Abstract 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.

Jean-Claude Falmagne | Jean-Paul Doignon

[1] H. Komm,et al. On the Dimension of Partially Ordered Sets , 1948 .

[2] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[3] T. Hiraguchi. On the Dimension of Partially Ordered Sets. , 1951 .

[4] J. Spencer. Minimal scrambling sets of simple orders , 1972 .

[5] Jean-Claude Falmagne,et al. Spaces for the Assessment of Knowledge , 1985, Int. J. Man Mach. Stud..

[6] F. Roberts. Measurement Theory with Applications to Decisionmaking, Utility, and the Social Sciences: Measurement Theory , 1984 .

[7] D. C. Kay,et al. Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers , 1971 .

[8] Jean-Paul Doignon,et al. A class of stochastic procedures for the assessment of knowledge. , 1988 .

[9] B. Monjardet. Tresses, fuseaux, préordres et topologies , 1970 .

[10] Nils J. Nilsson,et al. Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[11] Jean-Claude Falmagne,et al. Languages for the assessment of knowledge , 1986 .

[12] Jean-Paul Doignon,et al. On realizable biorders and the biorder dimension of a relation , 1984 .

[13] G. Birkhoff. Rings of sets , 1937 .

[14] Jean-Paul Doignon,et al. A Markovian procedure for assessing the state of a system , 1988 .