Institutional Repository

Recursive specifications and formal logic. What benefits for intelligent tutoring systems?

Show simple item record

dc.contributor.author Tcheeko, L
dc.date.accessioned 2018-06-06T14:00:26Z
dc.date.available 2018-06-06T14:00:26Z
dc.date.issued 1998
dc.identifier.citation Tcheeko L (1998) Recursive specifications and formal logic. What benefits for intelligent tutoring systems? South African Computer Journal, Number 21, 1998 en
dc.identifier.issn 2313-7835
dc.identifier.uri http://hdl.handle.net/10500/24288
dc.description.abstract The pedagogical assessment of a tutoring system relies upon a proof of convergence: for such a tutor the correction of student mistakes must not forever delay the teaching process. Such a tutor must provide uniform diagnosis in order to drive the dialog with the student. Student learning can be simulated by a·compilation of knowledge, but it is also necessary to compile knowledge for the teaching process. How can the tutor adjust these levels of compilation while keeping uniform diagnosis? We propose here to use recursive specifications, which consists of formalizing the definition of a class of problems at the same time as their solutions. Such a class "doesn't hide information": this allows its subsequent compilation. en
dc.language.iso en en
dc.publisher South African Computer Society (SAICSIT) en
dc.subject Artificial intelligence en
dc.subject Tutoring system en
dc.subject Pragmatic approach en
dc.subject Computational models en
dc.subject Recursive specifications en
dc.subject Student model en
dc.title Recursive specifications and formal logic. What benefits for intelligent tutoring systems? en
dc.type Article en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics