Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127001668, #quickstatements; #temporary_batch_1722496391782
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90069-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008511866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint relaxation may be perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truly concurrent constraint programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127001668 / rank
 
Normal rank

Latest revision as of 08:14, 1 August 2024

scientific article
Language Label Description Also known as
English
Graph rewriting for a partial ordering semantics of concurrent constraints programming
scientific article

    Statements

    Graph rewriting for a partial ordering semantics of concurrent constraints programming (English)
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references