Languages for the assessment of knowledge. (English) Zbl 0609.92037

Given a set of questions X, the state of knowledge of any individual is a subset K of X, hence all possible states of knowledge is a family k of subsets of X; this pair constitutes a knowledge structure. An assessment language over X (defined recursively) is shown to be identical with a BC- language as defined by the authors. Finally it is shown that a partially ordinal knowledge structure can always be recovered from its assessment languages.
Reviewer’s comment: There exists a very strong Ideenkreis around the logical approach to knowledge theory; cf. e.g. J. Y. Halpern (ed.), Theoretical aspects of reasoning about knowledge (1986).
Reviewer: M.Eytan


91E99 Mathematical psychology
68T99 Artificial intelligence
68Q45 Formal languages and automata
Full Text: DOI


[1] Birkhoff, G, Rings of sets, Duke mathematical journal, 3, 443-454, (1937) · JFM 63.0832.02
[2] Doignon, J.-P; Falmagne, J.-C, Spaces for the assessment of knowledge, International journal of man-machine studies, 23, 175-196, (1985) · Zbl 0581.68066
[3] Falmagne, J.-C; Doignon, J.-P, A class of stochastic procedures for the assessment of knowledge, New York university department of psychology MSPC 85-5, (1985), Submitted for publication · Zbl 0719.92026
[4] Roberts, F.S, Measurement theory, () · Zbl 0174.55801
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.