Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 417380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph rewriting for a partial ordering semantics of concurrent constraints programming |
scientific article; zbMATH DE number 417380 |
Statements
Graph rewriting for a partial ordering semantics of concurrent constraints programming (English)
0 references
31 October 1994
0 references
graph rewriting
0 references
partial ordering semantics
0 references
concurrent constraint programming
0 references
hypergraph
0 references
logic programming
0 references
entailment
0 references
graph derivation
0 references
true-concurrency semantics
0 references
graph grammars
0 references
0.7745233774185181
0 references
0.7682937383651733
0 references
0.7675969004631042
0 references
