Concurrent Constraint Programming (CCP) originated in the late ’80s with Vijay A. Saraswat’s work. In the first ’00s, a “soft” perspective of the constraint store based on a parametric algebraic structure (a c-semiring) was proposed, namely soft CCP (SCCP). This paper enhances this SCCP language with local constraint spaces, where agents can see and interact with only a portion of the information stored. Thus, it is possible to represent areas where an agent can perform operations without affecting other local spaces. The resulting language is security-oriented as actions are checked against (e.g., read/write) rights, and it is quite rich because of nonmonotonic operations in the store (e.g., the removal of constraints is allowed), thus making the coordination of several agents more flexible and adaptive to personal and global goals.
Local Spaces in Soft Concurrent Constraint Programming Oriented to Security
Bistarelli S.;Santini F.
2025
Abstract
Concurrent Constraint Programming (CCP) originated in the late ’80s with Vijay A. Saraswat’s work. In the first ’00s, a “soft” perspective of the constraint store based on a parametric algebraic structure (a c-semiring) was proposed, namely soft CCP (SCCP). This paper enhances this SCCP language with local constraint spaces, where agents can see and interact with only a portion of the information stored. Thus, it is possible to represent areas where an agent can perform operations without affecting other local spaces. The resulting language is security-oriented as actions are checked against (e.g., read/write) rights, and it is quite rich because of nonmonotonic operations in the store (e.g., the removal of constraints is allowed), thus making the coordination of several agents more flexible and adaptive to personal and global goals.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
