http://www.cnr.it/ontology/cnr/individuo/prodotto/ID29989

Timed Soft Concurrent Constraint Programs (Articolo in rivista)

Type

Label

Anno

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

Alternative label

[1] Bistarelli S., [1]Santini F., [2] Gabbrielli M., [3] Meo M.C. (2008)
Timed Soft Concurrent Constraint Programs
in Lecture notes in computer science; Springer, Berlin (Germania)
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

[1] CNR-IIT, Pisa, Italy; [2] Dipartimento di Scienze dell'Informazione, Università di Bologna, Italy; [3] Dipartimento di Scienze, Università \"G. D'Annunzio\" di Chieti-Pescara (literal)

Titolo

Abstract

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action pre¯xing is then con- sidered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) thresh- old which is used to determine their success or suspension. In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties. Agents negotiating Quality of Service can bene¯t from this new language, by coordinating among themselves and mediating their preferences. (literal)

Editore