« Programmation logique abductive » : différence entre les versions
Ligne 10 : | Ligne 10 : | ||
== Français == | == Français == | ||
programmation logique abductive | programmation logique abductive | ||
programmation logique par abduction | |||
Employée en raisonnement temporel, l'abduction est une explication ou une projection des effets vers les causes, contrairement à la déduction qui va des | |||
causes vers les effets. | |||
== Anglais == | == Anglais == |
Version du 29 janvier 2019 à 14:20
Domaine
Vocabulary
Définition
Français
programmation logique abductive programmation logique par abduction
Employée en raisonnement temporel, l'abduction est une explication ou une projection des effets vers les causes, contrairement à la déduction qui va des causes vers les effets.
Anglais
Abductive logic programming
Abductive logic programming (ALP) is a high-level knowledge-representation framework that can be used to solve problems declaratively based on abductive reasoning. It extends normal logic programming by allowing some predicates to be incompletely defined, declared as abducible predicates. Problem solving is effected by deriving hypotheses on these abducible predicates (abductive hypotheses) as solutions of problems to be solved. These problems can be either observations that need to be explained (as in classical abduction) or goals to be achieved (as in normal logic programming). It can be used to solve problems in diagnosis, planning, natural language and machine learning. It has also been used to interpret negation as failure as a form of abductive reasoning.
Contributeurs: Claude Coulombe, Jacques Barolet, wiki