Concurrent logic programming

EN Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

Concurrent logic programming is a variant of logic programming designed for parallel computing in which programs are sets of guarded Horn clauses of the form: H :- G1, …, Gn | B1, …, Bn. The conjunction G1, … , Gn is called the guard of the clause, and | is the commitment operator. Declaratively, guarded Horn clauses are read as ordinary logical implications: H if G1 and … and Gn and B1 and … and Bn. However, procedurally, when there are several clauses whose heads H match a given goal, then all of the clauses are executed in parallel, checking whether their guards G1, … , Gn hold. If the guards of more than one clause hold, then a committed choice is made to one of the clauses, and execution proceeds with the subgoals B1, …, Bn of the chosen clause. These subgoals can also be executed in parallel. Thus concurrent logic programming implements a form of "don't care nondeterminism", rather than "don't know nondeterminism".