A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming. Bistarelli, S., Paola, C., & Santini, F. 2012. doi abstract bibtex We present a fine-grained security model to enforce the access control on the constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP which deals with soft constraints, which are constraints that have a preference level associated to them. In the considered nomonotonic version (NMSCCP), the language is equipped with actions that can also remove constraints from the store. The language can be used for coordinating the agents on a common store of information. Clearly, in such scenario, is important to enhance the operations that the agents may perform with security and privacy, in order to limit their behavior, e.g., to hide some information or to prevent an agent to consume too many resources
@conference{
11391_313896,
author = {Bistarelli, S. and Paola, Campli and Santini, F.},
title = {A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming},
year = {2012},
publisher = {ACM Special Interest Group on Applied Computing (SIGAPP),Provincia Autonoma di Trento,Riva del Garda Congressi,COSBI},
booktitle = {Proceedings of the ACM Symposium on Applied Computing, SAC 2012},
abstract = {We present a fine-grained security model to enforce the access control on the constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP which deals with soft constraints, which are constraints that have a preference level associated to them. In the considered nomonotonic version (NMSCCP), the language is equipped with actions that can also remove constraints from the store. The language can be used for coordinating the agents on a common store of information. Clearly, in such scenario, is important to enhance the operations that the agents may perform with security and privacy, in order to limit their behavior, e.g., to hide some information or to prevent an agent to consume too many resources},
doi = {10.1145/2245276.2232023},
pages = {1551--1553}
}
Downloads: 0
{"_id":"Xc3ik5cS7GkGSeiLe","bibbaseid":"bistarelli-paola-santini-asecurecoordinationofagentswithnonmonotonicsoftconcurrentconstraintprogramming-2012","author_short":["Bistarelli, S.","Paola, C.","Santini, F."],"bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Paola"],"firstnames":["Campli"],"suffixes":[]},{"propositions":[],"lastnames":["Santini"],"firstnames":["F."],"suffixes":[]}],"title":"A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming","year":"2012","publisher":"ACM Special Interest Group on Applied Computing (SIGAPP),Provincia Autonoma di Trento,Riva del Garda Congressi,COSBI","booktitle":"Proceedings of the ACM Symposium on Applied Computing, SAC 2012","abstract":"We present a fine-grained security model to enforce the access control on the constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP which deals with soft constraints, which are constraints that have a preference level associated to them. In the considered nomonotonic version (NMSCCP), the language is equipped with actions that can also remove constraints from the store. The language can be used for coordinating the agents on a common store of information. Clearly, in such scenario, is important to enhance the operations that the agents may perform with security and privacy, in order to limit their behavior, e.g., to hide some information or to prevent an agent to consume too many resources","doi":"10.1145/2245276.2232023","pages":"1551–1553","bibtex":"@conference{\n\t11391_313896,\n\tauthor = {Bistarelli, S. and Paola, Campli and Santini, F.},\n\ttitle = {A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming},\n\tyear = {2012},\n\tpublisher = {ACM Special Interest Group on Applied Computing (SIGAPP),Provincia Autonoma di Trento,Riva del Garda Congressi,COSBI},\n\tbooktitle = {Proceedings of the ACM Symposium on Applied Computing, SAC 2012},\n\tabstract = {We present a fine-grained security model to enforce the access control on the constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP which deals with soft constraints, which are constraints that have a preference level associated to them. In the considered nomonotonic version (NMSCCP), the language is equipped with actions that can also remove constraints from the store. The language can be used for coordinating the agents on a common store of information. Clearly, in such scenario, is important to enhance the operations that the agents may perform with security and privacy, in order to limit their behavior, e.g., to hide some information or to prevent an agent to consume too many resources},\n\tdoi = {10.1145/2245276.2232023},\t\n\tpages = {1551--1553}\n}\n","author_short":["Bistarelli, S.","Paola, C.","Santini, F."],"key":"11391_313896","id":"11391_313896","bibbaseid":"bistarelli-paola-santini-asecurecoordinationofagentswithnonmonotonicsoftconcurrentconstraintprogramming-2012","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","dataSources":["GhB5rb8JzW6az3exo"],"keywords":[],"search_terms":["secure","coordination","agents","nonmonotonic","soft","concurrent","constraint","programming","bistarelli","paola","santini"],"title":"A Secure Coordination of Agents with Nonmonotonic Soft Concurrent Constraint Programming","year":2012}