HDM—a model-based approach to hypertext application design
ACM Transactions on Information Systems (TOIS)
Discrete structures, logic, and computability
Discrete structures, logic, and computability
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
| Hi-index | 0.00 |
This paper describes the conception and implementation of a learning system on Euclidean Geometry demonstrations and its knowledge base. We use the formalism of finite automata with output to represent and ordain the statements that constitute a geometric demonstration in the knowledge base. The system is built on the MOSCA learning protocol, based on learning with the assistance of examples and interaction among five agents (Mestre, Oráculo, Sonda, Cliente and Aprendiz) involved in the learning process. We briefly revise the Hyper-Automaton concept as a structural model for hypertext and its use as the basis for the central core of the agents in a learning system is analyzed.