. . "Concurrent logic programming is a variant of logic programming in which programs are sets of guarded Horn clauses of the form: B1, \u2026, Bn. The conjunction G1, \u2026 , Gn is called the guard of the clause, and \u01C0 is the commitment operator. Declaratively, guarded Horn clauses are read as ordinary logical implications: H if G1 and \u2026 and Gn or B1 and \u2026 and Bn."@en . "42755423"^^ . . "Concurrent logic programming is a variant of logic programming in which programs are sets of guarded Horn clauses of the form: B1, \u2026, Bn. The conjunction G1, \u2026 , Gn is called the guard of the clause, and \u01C0 is the commitment operator. Declaratively, guarded Horn clauses are read as ordinary logical implications: H if G1 and \u2026 and Gn or B1 and \u2026 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, \u2026 , Gn hold. If the guards of more than one clause hold, then a is made to one of the clauses, and execution proceeds with the subgoals B1, \u2026, 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\", ratherthan \"don't know nondeterminism\"."@en . "1069452952"^^ . . . . . . . . . . . . . . "Concurrent logic programming"@en . . . . "2567"^^ . . . . .