• A Labelled Semantics for Soft...

Treffer: A Labelled Semantics for Soft Concurrent Constraint Programming

Title:
A Labelled Semantics for Soft Concurrent Constraint Programming
Authors:
Gadducci, Fabio, Santini, Francesco, Pino, Luis, Valencia, Frank
Contributors:
Dipartimento di Informatica [Pisa], University of Pisa [Italy] = Università di Pisa [Italia] = Université de Pise [Italie] (UniPi), Istituto di Informatica e Telematica (IIT-CNR), National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR), Università degli Studi di Cagliari = University of Cagliari = Université de Cagliari (UniCa), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Concurrency, Mobility and Transactions (COMETE), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), MIUR PRIN 2010LHT4KM CINA, PRIN 2010XSEMLC “Security Horizons”, Aut. Reg. of Sardinia P.I.A. 2010 “Social Glue”, Tom Holvoet, Mirko Viroli, TC 6, WG 6.1, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012)
Source:
17th International Conference on Coordination Languages and Models (COORDINATION). :133-149
Publisher Information:
CCSD; Springer, 2015.
Publication Year:
2015
Collection:
collection:X
collection:CNRS
collection:INRIA
collection:LIX
collection:LIX-COMETE
collection:INRIA-SACLAY
collection:X-DEP-INFO
collection:INRIA_TEST
collection:TESTALAIN1
collection:IFIP-LNCS
collection:IFIP
collection:INRIA2
collection:IFIP-TC
collection:IFIP-WG
collection:IFIP-TC6
collection:IFIP-WG6-1
collection:IFIP-COORDINATION
collection:UNIV-PARIS-SACLAY
collection:INRIA-SACLAY-2015
collection:X-SACLAY
collection:IFIP-DISCOTEC
collection:IFIP-LNCS-9037
collection:ANR
collection:GS-COMPUTER-SCIENCE
Subject Terms:
Constraint Satisfaction Problem, Soft Constraint, Label Transition System, Denotational Semantic, Compact Element, ACM: F.: Theory of Computation, F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, F.4.3: Formal Languages, [INFO.INFO-FL]Computer Science [cs], Formal Languages and Automata Theory [cs.FL]
Subject Geographic:
Grenoble, France
Original Identifier:
HAL: hal-01149227
Document Type:
Konferenz conferenceObject<br />Conference papers
Language:
English
Relation:
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-19282-6_9
DOI:
10.1007/978-3-319-19282-6_9
Access URL:
https://inria.hal.science/hal-01149227
https://inria.hal.science/hal-01149227v1/document
https://inria.hal.science/hal-01149227v1/file/coordination15.pdf
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.hal.01149227v1
Database:
HAL

Weitere Informationen

Part 3: Constraints
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