About: Concurrent logic programming

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Concurrent logic programming Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Concurrent logic programming (en)
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. (en)
sameAs	Concurrent logic programming Concurrent logic programming
dbp:wikiPageUsesTemplate	dbt:Mono dbt:Programming_paradigms
Subject	Programming paradigms Logic programming
Link from a Wikipage to an external page	https://dl.acm.org/citation.cfm%3Fid=806776
gold:hypernym	Variant
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Concurrent_logic_programming?oldid=1069452952&ns=0
Wikipage page ID	42755423 (xsd:integer)
page length (characters) of wiki page	2567 (xsd:nonNegativeInteger)
Wikipage revision ID	1069452952 (xsd:integer)
Link from a Wikipage to another Wikipage	Logic programming Nondeterministic programming Programming paradigms Logic programming Horn clause KL1 Concurrent constraint logic programming Ehud Shapiro Ministry of International Trade and Industry Fifth Generation Computer Systems Guard (computer science) dbr:Committed_choice dbr:Concurrent_Prolog
has 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". (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Concurrent_logic_programming
is Link from a Wikipage to another Wikipage of	Logic programming Concurrent constraint logic programming GHC Keith Clark (computer scientist) Fifth Generation Computer Systems
is known for of	Keith Clark (computer scientist)
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Concurrent_logic_programming

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software