TERMIUM Plus^®

Record 1,  Textual support,  English

Record number: 1, Textual support number: 1 DEF

A tree that consists of nodes and edges which represent the goals reduced during the computation.  3, record 1, English, - explanation%20tree

Record number: 1, Textual support number: 1 CONT

The result of this stage is an And/Or proof tree, which we shall call the explanation tree for the training instance. The explanation tree indicates how the training instance satisfies PosInst(positive instance), and forms the basis for generalization by inferring sufficient conditions for satisfying PosInst.  2, record 1, English, - explanation%20tree

Record 1,  Textual support,  French

Record number: 1, Textual support number: 1 CONT

La justification à construire est une démonstration prouvant que l'exemple positif donné satisfait bien la définition non opérationnelle du concept-but. Cette démonstration peut être structurée en un arbre de preuve.  1, record 1, French, - arbre%20de%20preuve

Record 1,  Textual support,  Spanish

Record 2,  Textual support,  English

Record number: 2, Textual support number: 1 DEF

An inference rule that, given one or more assertions, produces an assertion that logically implies the original assertions. An inductive inference rule is a falsity-preserving transformation of assertions. (cf. deductive inference rule).  1, record 2, English, - inductive%20inference%20rule

Record number: 2, Textual support number: 1 CONT

An inductive inference rule performs some elementary act of inductive inference. It takes one or more assertions and generates an assertion that tautologically implies them.  1, record 2, English, - inductive%20inference%20rule

Record number: 2, Textual support number: 1 OBS

Here are a few examples of such rules : Dropping conditions... Turning constants into variables... Adding options... Climbing generalization tree...  1, record 2, English, - inductive%20inference%20rule

Record 2,  Textual support,  French

Record number: 2, Textual support number: 1 CONT

L'induction est un processus de dérivation de sentences plus générales à partir de sentences établies pour certains cas spécifiques par application d'un ensemble de règles d'inférence inductive.  1, record 2, French, - r%C3%A8gle%20d%27inf%C3%A9rence%20inductive

Record number: 2, Textual support number: 1 OBS

Parmi les règles d'inférence les plus utilisées pour généraliser des implicants, citons les suivantes (...) restriction de conjonction (...) extension de disjonction (...) remplacement de constantes par des variables (...) montée d'un arbre de spécialisation.  1, record 2, French, - r%C3%A8gle%20d%27inf%C3%A9rence%20inductive

Record 2,  Textual support,  Spanish

Record 3,  Textual support,  English

Record number: 3, Textual support number: 1 CONT

Inductive Inference Can be Performed by Rules. Here are a few examples of such rules : Climbing generalization tree(replacing a less general term boy a more general term in a statement; e. g., generalizing the statement "I like oranges" into "I like citrus fruits").  2, record 3, English, - climbing%20generalization%20tree%20rule

Record 3,  Textual support,  French

Record number: 3, Textual support number: 1 OBS

Règles d'inférence inductive. (...) Une autre variante peut s'avérer fort utile lorsque le domaine de valeurs d'une variable a une structure d'arbre de spécialisation. Les valeurs "descendantes" peuvent alors être remplacées par des valeurs "ancêtres".  1, record 3, French, - mont%C3%A9e%20d%27un%20arbre%20de%20sp%C3%A9cialisation

Record 3,  Textual support,  Spanish