Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17008825> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q17008825 subject Q13360530.
- Q17008825 subject Q8601379.
- Q17008825 abstract "Concurrent logic programming is a variant of logic programming 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 proceedes 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", ratherthan "don't know nondeterminism".".
- Q17008825 wikiPageWikiLink Q13360530.
- Q17008825 wikiPageWikiLink Q2088989.
- Q17008825 wikiPageWikiLink Q2379942.
- Q17008825 wikiPageWikiLink Q275603.
- Q17008825 wikiPageWikiLink Q407091.
- Q17008825 wikiPageWikiLink Q5159106.
- Q17008825 wikiPageWikiLink Q5348683.
- Q17008825 wikiPageWikiLink Q5965507.
- Q17008825 wikiPageWikiLink Q6867297.
- Q17008825 wikiPageWikiLink Q7049263.
- Q17008825 wikiPageWikiLink Q8601379.
- Q17008825 wikiPageWikiLink Q933932.
- Q17008825 comment "Concurrent logic programming is a variant of logic programming 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.".
- Q17008825 label "Concurrent logic programming".