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

Soft Concurrent Constraint Programming (Articolo in rivista)

Type

Label

Anno

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

Alternative label

[1] Bistarelli S., [1] Montanari U., [3] Rossi F. (2006)
Soft Concurrent Constraint Programming
in ACM transactions on computational logic; ACM Press, New York (Stati Uniti d'America)
(literal)

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

Pagina inizio

Pagina fine

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

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

Rivista

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

Note

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

[1] CNR-IIT, Pisa, Italy; [2] Università di Pisa, Pisa, Italy; [3] Università di Padova, Padova, Italy (literal)

Titolo

Abstract

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, as yet there seems to be no concurrent programming framework where soft constraints can be handled. In this article we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believe that this new programming paradigm, called soft cc (scc), can be also very useful in many Web-related scenarios. In fact, the language level allows Web agents to express their interaction and negotiation protocols, and also to post their requests in terms of preferences, and the underlying soft constraint solver can find an agreement among the agents even if their requests are incompatible. (literal)

Editore