TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 CONT

One solution is to generate the graph node by node. A complete reasoning path is generated until it either reaches the goal or hits a dead end. If it hits a dead end, the next path is generated, and so on.  2, fiche 1, Anglais, - reasoning%20path

Record number: 1, Textual support number: 2 CONT

It is necessary for the student to ask an exhaustive series of questions, if he is to discover all of the reasoning paths considered by the program.  3, fiche 1, Anglais, - reasoning%20path

Record number: 1, Textual support number: 3 CONT

When expert reasoning paths are not unique or a limited window into the student’s thinking prevents monitoring each step of a chain of reasoning, how is the tutor to apportion credit and blame for the student’s observable behavior among the different knowledge sources?  3, fiche 1, Anglais, - reasoning%20path

Fiche 1,  Justifications,  Français

Record number: 1, Textual support number: 1 DEF

L'enchaînement des connaissances qui a permis de conclure.  2, fiche 1, Français, - parcours%20de%20raisonnement

Record number: 1, Textual support number: 1 OBS

Distinct de la trace de raisonnement.  1, fiche 1, Français, - parcours%20de%20raisonnement

Fiche 1,  Justifications,  Espagnol

Fiche 2,  Justifications,  Anglais

Record number: 2, Textual support number: 1 CONT

Essentially, the basic mechanism of a GAO graph is that of a production system, with the advantages of the finely grained formalism of production rules. But this production system is interpreted with a goal stack of interspersed AND and OR goals that provide the representation with an explicit control structure. In addition, some notion of scope is afforded by a focus of attention that can be shifted with the generation of subgoals.  1, fiche 2, Anglais, - GAO%20graph

Fiche 2,  Justifications,  Français

Record number: 2, Textual support number: 1 DEF

Graphe où un état peut être transformé alternativement de plusieurs façons (connexion ou), chaque transformation pouvant faire intervenir simultanément plusieurs états, dont la conjonction est équivalente à l'état initial (connexion ET).  1, fiche 2, Français, - graphe%20ET%2FOU%20g%C3%A9n%C3%A9ralis%C3%A9

Fiche 2,  Justifications,  Espagnol

Fiche 3,  Justifications,  Anglais

Record number: 3, Textual support number: 1 CONT

In the tower of Hanoi problem, the path from the initial state to the goal state in the state graph is clear.  1, fiche 3, Anglais, - goal%20state

Record number: 3, Textual support number: 2 CONT

The solution paths run from the initial state (root mode) along the branches of the tree and terminate on the leaves (Terminal nodes) labelled goal state.  2, fiche 3, Anglais, - goal%20state

Fiche 3,  Justifications,  Français

Record number: 3, Textual support number: 1 CONT

Dans GPS (...) il faut spécifier l'état initial (les données) et l'état final (à atteindre) ainsi que les opérateurs de changement d'état.  1, fiche 3, Français, - %C3%A9tat%20final

Fiche 3,  Justifications,  Espagnol

Fiche 4,  Justifications,  Français

Fiche 4,  Justifications,  Espagnol

Fiche 5,  Justifications,  Anglais

Record number: 5, Textual support number: 1 CONT

In the Tower of Hanoi problem, the path from initial state to the goal state on the state graph is clear.  1, fiche 5, Anglais, - initial%20state

Fiche 5,  Justifications,  Français

Fiche 5,  Justifications,  Espagnol

Fiche 6,  Justifications,  Anglais

Record number: 6, Textual support number: 1 DEF

A node-by-node generated graph. A complete path is generated until it either reaches the goal or hits a dead end. If it hits a dead end, the next path is generated, and so on.  1, fiche 6, Anglais, - implicit%20graph

Fiche 6,  Justifications,  Français

Record number: 6, Textual support number: 1 OBS

implicite : qui est virtuellement contenu dans une proposition, un fait, sans être formellement exprimé.  2, fiche 6, Français, - graphe%20implicite

Fiche 6,  Justifications,  Espagnol