« Programmation logique avec contraintes » : différence entre les versions

Dernière version du 28 janvier 2024 à 12:46

Définition

Type de programmation par contraintes que l'on peut considérer comme un prolongement de la programmation logique où l'unification est remplacée par la satisfaction de contraintes exprimées sous la forme de prédicat.

Français

programmation logique avec contraintes

programmation logique de contraintes

programmation logique par contraintes

PLC

Anglais

constraint logic programming

CLP

Sources

Source : Le grand dictionnaire terminologique

Source : Wikipedia (Constraint logic programming)

@@ Ligne 1 : / Ligne 1 : @@
-== Domaine ==
-[[Category:Vocabulary]]
 == Définition ==
+Type de [[programmation par contraintes]] que l'on peut considérer comme un prolongement de la [[programmation logique]] où l'unification est remplacée par la satisfaction de contraintes exprimées sous la forme de prédicat.
+== Français ==
+'''programmation logique avec contraintes'''
+'''programmation logique de contraintes'''
-== Français ==
+'''programmation logique par contraintes'''
+'''PLC'''
 == Anglais ==
+'''constraint logic programming'''
+'''CLP'''
+==Sources==
-=== Constraint logic programming ===
+[http://gdt.oqlf.gouv.qc.ca/ficheOqlf.aspx?Id_Fiche=8374132  Source : Le grand dictionnaire terminologique ]
-Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is A(X,Y) :- X+Y>0, B(X), C(Y). In this clause, X+Y>0 is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
-As in regular logic programming, programs are queried about the provability of a goal, which may contain constraints in addition to literals. A proof for a goal is composed of clauses whose bodies are satisfiable constraints and literals that can in turn be proved using other clauses. Execution is performed by an interpreter, which starts from the goal and recursively scans the clauses trying to prove the goal. Constraints encountered during this scan are placed in a set called constraint store. If this set is found out to be unsatisfiable, the interpreter backtracks, trying to use other clauses for proving the goal. In practice, satisfiability of the constraint store may be checked using an incomplete algorithm, which does not always detect inconsistency.
+[https://en.wikipedia.org/wiki/Constraint_logic_programming  Source : Wikipedia (Constraint logic programming) ]
-<br/>
+[[Catégorie:GRAND LEXIQUE FRANÇAIS]]
-<br/>
-<br/>
-<br/>
-<br/>
-<br/>
-<br/>