We present a labelled semantics for Soft Concurrent Constraint Programming (SCCP), a language where concurrent agents may synchronize on a shared store by either posting or checking the satisfaction of (soft) constraints. SCCP generalizes the classical formalism by parametrising the constraint system over an order-enriched monoid: the monoid operator is not required to be idempotent, thus adding the same information several times may change the store. The novel operational rules are shown to offer a sound and complete co-inductive technique to prove the original equivalence over the unlabelled semantics.
CITATION STYLE
Gadducci, F., Santini, F., Pino, L. F., & Valencia, F. D. (2015). A labelled semantics for soft concurrent constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9037, pp. 133–149). Springer Verlag. https://doi.org/10.1007/978-3-319-19282-6_9
Mendeley helps you to discover research relevant for your work.