Skip to Main content Skip to Navigation
Conference papers

A Labelled Semantics for Soft Concurrent Constraint Programming

Abstract : 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
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Luis Fernando Pino Duque Connect in order to contact the contributor
Submitted on : Wednesday, May 6, 2015 - 4:25:53 PM
Last modification on : Wednesday, February 2, 2022 - 3:53:50 PM
Long-term archiving on: : Wednesday, April 19, 2017 - 6:23:21 PM


Files produced by the author(s)



Fabio Gadducci, Francesco Santini, Luis Pino, Frank Valencia. A Labelled Semantics for Soft Concurrent Constraint Programming. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. pp.133-149, ⟨10.1007/978-3-319-19282-6_9⟩. ⟨hal-01149227⟩



Record views


Files downloads