This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n12	https://dl.acm.org/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n8	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Concurrent_logic_programming

rdfs:label

Concurrent logic programming

rdfs:comment

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.

owl:sameAs

yago-res:Concurrent_logic_programming freebase:m.010ls_2c

dbp:wikiPageUsesTemplate

dbt:Mono dbt:Programming_paradigms

dct:subject

dbc:Programming_paradigms dbc:Logic_programming

dbo:wikiPageExternalLink

n12:citation.cfm%3Fid=806776

gold:hypernym

dbr:Variant

prov:wasDerivedFrom

n8:Concurrent_logic_programming?oldid=1069452952&ns=0

dbo:wikiPageID

42755423

dbo:wikiPageLength

2567

dbo:wikiPageRevisionID

1069452952

dbo:wikiPageWikiLink

dbc:Logic_programming dbr:Nondeterministic_programming dbr:Fifth_Generation_Computer_Systems dbr:KL1 dbr:Concurrent_Prolog dbr:Ministry_of_International_Trade_and_Industry dbr:Concurrent_constraint_logic_programming dbr:Ehud_Shapiro dbr:Guard_(computer_science) dbr:Logic_programming dbr:Committed_choice dbc:Programming_paradigms dbr:Horn_clause

dbo:abstract

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. 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 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", ratherthan "don't know nondeterminism".

foaf:isPrimaryTopicOf

n8:Concurrent_logic_programming