We extend Soft Concurrent Constraint languages with the possibility to manage variables that are local (i.e., private) to some of the agents. Being constraints soft, it is possible to represent preferences as a partially ordered set. With respect to the related literature using an idempotent operator for constraint composition, a soft language requires a revision of the hiding operator, which is used to locally keep the computation effect on a variable, and conceal it from the global store. We provide the language with labelled and unlabelled reduction semantics as well as bisimulation equivalences, further proving their correspondence.
Soft Concurrent Constraint Programming with Local Variables
Bussi, LCo-primo
Membro del Collaboration Group
;Gadducci, F
Co-primo
Membro del Collaboration Group
;Santini, FCo-primo
Membro del Collaboration Group
2022-01-01
Abstract
We extend Soft Concurrent Constraint languages with the possibility to manage variables that are local (i.e., private) to some of the agents. Being constraints soft, it is possible to represent preferences as a partially ordered set. With respect to the related literature using an idempotent operator for constraint composition, a soft language requires a revision of the hiding operator, which is used to locally keep the computation effect on a variable, and conceal it from the global store. We provide the language with labelled and unlabelled reduction semantics as well as bisimulation equivalences, further proving their correspondence.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
