par Falmagne, Jean-Claude ;Cosyn, Eric;Doignon, Jean-Paul ;Thiéry, Nicolas
Référence Lecture notes in computer science, 3874 LNAI, page (61-79)
Publication Publié, 2006
Article révisé par les pairs
Résumé : This paper is adapted from a book and many scholarly articles. It reviews the main ideas of a theory for the assessment of a student's knowledge in a topic and gives details on a practical implementation in the form of a software. The basic concept of the theory is the 'knowledge state,' which is the complete set of problems that an individual is capable of solving in a particular topic, such as Arithmetic or Elementary Algebra. The task of the assessor - which is always a computer - consists in uncovering the particular state of the student being assessed, among all the feasible states. Even though the number of knowledge states for a topic may exceed several hundred thousand, these large numbers are well within the capacity of current home or school computers. The result of an assessment consists in two short lists of problems which may be labelled: 'WHAT THE STUDENT CAN DO' and 'WHAT THE STUDENT is READY TO LEARN.' In the most important applications of the theory, these two lists specify the exact knowledge state of the individual being assessed. Moreover, the family of feasible states is specified by two combinatorial axioms which are pedagogically sound from the standpoint of learning. The resulting mathematical structure is related to closure spaces and thus also to concept lattices. This work is presented against the contrasting background of common methods of assessing human competence through standardized tests providing numerical scores. The philosophy of these methods, and their scientific origin in nineteenth century physics, are briefly examined. © Springer-Verlag Berlin Heidelberg 2006.