Graph rewriting for a partial ordering semantics of concurrent constraint programming
- 1 March 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 109 (1-2) , 225-256
- https://doi.org/10.1016/0304-3975(93)90069-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Constraint relaxation may be perfectArtificial Intelligence, 1991
- The family of concurrent logic programming languagesACM Computing Surveys, 1989
- A model for distributed systems based on graph rewritingJournal of the ACM, 1987