« Raisonnement automatique » : différence entre les versions
m (Remplacement de texte — « Category:Coulombe » par « <!-- Coulombe --> ») |
Aucun résumé des modifications Balise : Éditeur de wikicode 2017 |
||
| Ligne 2 : | Ligne 2 : | ||
== en construction == | == en construction == | ||
[[Category:Vocabulary]] | [[Category:Vocabulary]] | ||
<!-- Coulombe -->Coulombe | <!-- Coulombe -->Coulombe | ||
== Définition == | == Définition == | ||
== Français == | == Français == | ||
| Ligne 21 : | Ligne 19 : | ||
Automated reasoning is an area of computer science and mathematical logic dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer programs that allow computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence, it also has connections with theoretical computer science, and even philosophy. | Automated reasoning is an area of computer science and mathematical logic dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer programs that allow computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence, it also has connections with theoretical computer science, and even philosophy. | ||
< | (ATN) a formalism for describing parsers, especially for natural language. Similar to a finite automaton, but augmented in that arbitrary tests may be attached to transition arcs, subgrammars may be called recursively, and structure-building actions may be executed as an arc is traversed. | ||
<small> | |||
[https://www.cs.utexas.edu/users/novak/aivocab.html Source : Utexas Ai vocabulary ] | |||
Version du 14 septembre 2019 à 23:05
en construction
Coulombe
Définition
Français
raisonnement automatique
raisonnement automatisé
Anglais
Automated reasoning
Automated reasoning is an area of computer science and mathematical logic dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer programs that allow computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence, it also has connections with theoretical computer science, and even philosophy.
(ATN) a formalism for describing parsers, especially for natural language. Similar to a finite automaton, but augmented in that arbitrary tests may be attached to transition arcs, subgrammars may be called recursively, and structure-building actions may be executed as an arc is traversed.
Contributeurs: Claude Coulombe, Imane Meziani, wiki, Sihem Kouache
