Concurrent logic programming
Concurrent logic programming is a variant of logic programming in which programs are sets of guarded Horn clauses of the form: 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 or B1 and … and Bn.
known for
Link from a Wikipage to another Wikipage
known for
primaryTopic
Concurrent logic programming
Concurrent logic programming is a variant of logic programming in which programs are sets of guarded Horn clauses of the form: 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 or B1 and … and Bn.
has abstract
Concurrent logic programming i ...... n "don't know nondeterminism".
@en
Link from a Wikipage to an external page
Wikipage page ID
42,755,423
page length (characters) of wiki page
Wikipage revision ID
972,382,884
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Concurrent logic programming i ...... d … and Gn or B1 and … and Bn.
@en
label
Concurrent logic programming
@en