Deep cognitive diagnosis in intelligent tutoring systems in the framework of logic programming an meta-level reasoning
- FB Informatik und Informationswissenschaft
|(2014): Heuristic Search over Program Transformations Declarative Programming and Knowledge Management : Declarative Programming Days, KDPD 2013 ; Unifying INAP, WFLP, and WLP, Kiel, Germany, September 11–13, 2013, Revised Selected Papers / Hanus, Michael et al. (Hrsg.). - Cham : Springer, 2014. - (Lecture Notes in Artificial Intelligence ; 8439). - S. 234-249. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-319-08908-9||
In prior work, we have developed a method for the automatic reconstruction of buggy Prolog programs from correct programs to model learners' incorrect reasoning in a tutoring context. The method combines an innovative variant of algorithmic debugging with program transformations. Algorithmic debugging is used to indicate a learner's error and its type; this informs a program transformation that "repairs'' the expert program into a buggy variant that is closer at replicating a learner's behaviour. In this paper, we improve our method by using heuristic search. To search the space of program transformations, we estimate the distance between programs. Instead of only returning the first irreducible disagreement between program and Oracle, the algorithmic debugger now traverses the entire program. In the process, all irreducible agreements and disagreements are counted to compute the distance metrics, which also includes the cost of transformations. Overall, the heuristic approach is a significant improvement to our existing blind method.
|Period:||01.01.2012 – 31.12.2013|