Programmation logique avec contraintes - Historique des versions

Pitpitt : Remplacement de texte : « ↵ » par «  ==Sources== »

2024-01-28T16:46:54Z

Remplacement de texte : « ↵ » par «  ==Sources== »

← Version précédente		Version du 28 janvier 2024 à 12:46
Ligne 17 :		Ligne 17 :


	~~<small>~~		==Sources==

	[http://gdt.oqlf.gouv.qc.ca/ficheOqlf.aspx?Id_Fiche=8374132 Source : Le grand dictionnaire terminologique ]		[http://gdt.oqlf.gouv.qc.ca/ficheOqlf.aspx?Id_Fiche=8374132 Source : Le grand dictionnaire terminologique ]

Pitpitt le 3 juin 2021 à 15:00

2021-06-03T15:00:31Z

← Version précédente		Version du 3 juin 2021 à 11:00
Ligne 18 :		Ligne 18 :

	<small>		<small>


	[http://gdt.oqlf.gouv.qc.ca/ficheOqlf.aspx?Id_Fiche=8374132 Source : Le grand dictionnaire terminologique ]		[http://gdt.oqlf.gouv.qc.ca/ficheOqlf.aspx?Id_Fiche=8374132 Source : Le grand dictionnaire terminologique ]
Ligne 24 :		Ligne 23 :
	[https://en.wikipedia.org/wiki/Constraint_logic_programming Source : Wikipedia (Constraint logic programming) ]		[https://en.wikipedia.org/wiki/Constraint_logic_programming Source : Wikipedia (Constraint logic programming) ]

	[[~~Category~~:~~Publication~~]]		[[Catégorie:GRAND LEXIQUE FRANÇAIS]]

JBM : JBM a déplacé la page Constraint logic programming vers Programmation logique avec contraintes

2021-06-02T19:15:08Z

JBM a déplacé la page Constraint logic programming vers Programmation logique avec contraintes

← Version précédente	Version du 2 juin 2021 à 15:15
(Aucune différence)

JBM le 2 juin 2021 à 19:14

2021-06-02T19:14:49Z

← Version précédente		Version du 2 juin 2021 à 15:14
Ligne 1 :		Ligne 1 :
			== 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'''

	~~== en construction ==~~		'''programmation logique de contraintes'''

	~~[[Category:Vocabulary]]~~		'''programmation logique par contraintes'''

			'''PLC'''

	== ~~Définition~~ ==		== Anglais ==
			'''constraint logic programming'''

			'''CLP'''



	~~== Français ==~~		<small>





	~~== Anglais ==~~

	~~''' 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.~~		[https://en.wikipedia.org/wiki/Constraint_logic_programming Source : Wikipedia (Constraint logic programming) ]

	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.		[[Category:Publication]]

Pitpitt : Remplacement de texte — « 
 » par «  »

2020-05-07T16:06:33Z

Remplacement de texte — «   » par «  »

← Version précédente		Version du 7 mai 2020 à 12:06
Ligne 22 :		Ligne 22 :

	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.		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.

	~~<br/>~~
	~~<br/>~~
	~~<br/>~~
	~~<br/>~~
	~~<br/>~~
	~~<br/>~~
	~~<br/>~~

Pitpitt : Remplacement de texte — « Entrez ici les domaines et catégories... » par «  »

2019-07-03T15:29:30Z

Remplacement de texte — « Entrez ici les domaines et catégories... » par «  »

← Version précédente		Version du 3 juillet 2019 à 11:29
Ligne 1 :		Ligne 1 :

	== en construction ==		== en construction ==
	~~<small>Entrez ici les domaines et catégories...</small>~~
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

Pitpitt : Remplacement de texte — « == Domaine == » par « == en construction == Entrez ici les domaines et catégories... »

2019-07-01T14:57:29Z

Remplacement de texte — « == Domaine == » par « == en construction == Entrez ici les domaines et catégories... »

← Version précédente		Version du 1 juillet 2019 à 10:57
Ligne 1 :		Ligne 1 :

	== ~~Domaine~~ ==		== en construction ==
			<small>Entrez ici les domaines et catégories...</small>
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

Pitpitt le 28 avril 2019 à 16:18

2019-04-28T16:18:00Z

← Version précédente		Version du 28 avril 2019 à 12:18
Ligne 16 :		Ligne 16 :
	== Anglais ==		== Anglais ==

	~~===~~ Constraint logic programming ~~===~~		''' Constraint logic programming '''

	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.		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.

Pitpitt : Remplacement de texte — « Termes privilégiés » par « Français »

2018-12-31T18:37:26Z

Remplacement de texte — « Termes privilégiés » par « Français »

← Version précédente		Version du 31 décembre 2018 à 14:37
Ligne 8 :		Ligne 8 :


	== ~~Termes privilégiés~~ ==		== Français ==

Pitpitt : Page créée avec « == Domaine == Category:Vocabulary == Définition == == Termes privilégiés == == Anglais == === Constraint logic programming === Constraint logic pr... »

2018-02-28T20:26:34Z

Page créée avec « == Domaine == Category:Vocabulary == Définition == == Termes privilégiés == == Anglais == === Constraint logic programming === Constraint logic pr... »

Nouvelle page

== Domaine ==
[[Category:Vocabulary]]

== Définition ==

== Termes privilégiés ==

== Anglais ==

=== Constraint logic programming ===
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.

Programmation logique avec contraintes - Historique des versions

Pitpitt : Remplacement de texte : « ↵ » par « ==Sources== »

Pitpitt le 3 juin 2021 à 15:00

JBM : JBM a déplacé la page Constraint logic programming vers Programmation logique avec contraintes

JBM le 2 juin 2021 à 19:14

Pitpitt : Remplacement de texte — « » par « »

Pitpitt : Remplacement de texte — « Entrez ici les domaines et catégories... » par « »

Pitpitt : Remplacement de texte — « == Domaine == » par « == en construction == Entrez ici les domaines et catégories... »