@techreport{dellanna2021complexity,
      title={The Complexity of Data-Driven Norm Synthesis and Revision}, 
      author={Davide Dell'Anna and Natasha Alechina and Brian Logan and Maarten Löffler and Fabiano Dalpiaz and Mehdi Dastani},
      year={2021},
      eprint={2112.02626},
      archivePrefix={arXiv},
      primaryClass={cs.CC},
      url_Paper       = {https://arxiv.org/abs/2112.02626},
      keywords  = {Data Driven Supervision Of Autonomous Systems, Norms, Multi-Agent Systems, Revision, Synthesis, Complexity, NP Complete},
  abstract = {Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should follow in order to achieve the objective of the MAS. However, designing norms to achieve a particular system objective can be difficult, particularly when there is no direct link between the language in which the system objective is stated and the language in which the norms can be expressed. In this paper, we consider the problem of synthesising a norm from traces of agent behaviour, where each trace is labelled with whether the behaviour satisfies the system objective. We show that the norm synthesis problem is NP-complete.}
}

{"_id":"N27Xs3jqvMyew3MPr","bibbaseid":"dellanna-alechina-logan-lffler-dalpiaz-dastani-thecomplexityofdatadrivennormsynthesisandrevision-2021","author_short":["Dell'Anna, D.","Alechina, N.","Logan, B.","Löffler, M.","Dalpiaz, F.","Dastani, M."],"bibdata":{"bibtype":"techreport","type":"techreport","title":"The Complexity of Data-Driven Norm Synthesis and Revision","author":[{"firstnames":["Davide"],"propositions":[],"lastnames":["Dell'Anna"],"suffixes":[]},{"firstnames":["Natasha"],"propositions":[],"lastnames":["Alechina"],"suffixes":[]},{"firstnames":["Brian"],"propositions":[],"lastnames":["Logan"],"suffixes":[]},{"firstnames":["Maarten"],"propositions":[],"lastnames":["Löffler"],"suffixes":[]},{"firstnames":["Fabiano"],"propositions":[],"lastnames":["Dalpiaz"],"suffixes":[]},{"firstnames":["Mehdi"],"propositions":[],"lastnames":["Dastani"],"suffixes":[]}],"year":"2021","eprint":"2112.02626","archiveprefix":"arXiv","primaryclass":"cs.CC","url_paper":"https://arxiv.org/abs/2112.02626","keywords":"Data Driven Supervision Of Autonomous Systems, Norms, Multi-Agent Systems, Revision, Synthesis, Complexity, NP Complete","abstract":"Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should follow in order to achieve the objective of the MAS. However, designing norms to achieve a particular system objective can be difficult, particularly when there is no direct link between the language in which the system objective is stated and the language in which the norms can be expressed. In this paper, we consider the problem of synthesising a norm from traces of agent behaviour, where each trace is labelled with whether the behaviour satisfies the system objective. We show that the norm synthesis problem is NP-complete.","bibtex":"@techreport{dellanna2021complexity,\n title={The Complexity of Data-Driven Norm Synthesis and Revision}, \n author={Davide Dell'Anna and Natasha Alechina and Brian Logan and Maarten Löffler and Fabiano Dalpiaz and Mehdi Dastani},\n year={2021},\n eprint={2112.02626},\n archivePrefix={arXiv},\n primaryClass={cs.CC},\n url_Paper = {https://arxiv.org/abs/2112.02626},\n keywords = {Data Driven Supervision Of Autonomous Systems, Norms, Multi-Agent Systems, Revision, Synthesis, Complexity, NP Complete},\n abstract = {Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should follow in order to achieve the objective of the MAS. However, designing norms to achieve a particular system objective can be difficult, particularly when there is no direct link between the language in which the system objective is stated and the language in which the norms can be expressed. In this paper, we consider the problem of synthesising a norm from traces of agent behaviour, where each trace is labelled with whether the behaviour satisfies the system objective. We show that the norm synthesis problem is NP-complete.}\n}\n\n","author_short":["Dell'Anna, D.","Alechina, N.","Logan, B.","Löffler, M.","Dalpiaz, F.","Dastani, M."],"key":"dellanna2021complexity","id":"dellanna2021complexity","bibbaseid":"dellanna-alechina-logan-lffler-dalpiaz-dastani-thecomplexityofdatadrivennormsynthesisandrevision-2021","role":"author","urls":{" paper":"https://arxiv.org/abs/2112.02626"},"keyword":["Data Driven Supervision Of Autonomous Systems","Norms","Multi-Agent Systems","Revision","Synthesis","Complexity","NP Complete"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"techreport","biburl":"http://davidedellanna.com/publications/dellanna.bib","dataSources":["6mqXRucaPuwqWyQEd","Rymgh7KJx3EhNfvG8","2pnuieZznE6L96taK"],"keywords":["data driven supervision of autonomous systems","norms","multi-agent systems","revision","synthesis","complexity","np complete"],"search_terms":["complexity","data","driven","norm","synthesis","revision","dell'anna","alechina","logan","löffler","dalpiaz","dastani"],"title":"The Complexity of Data-Driven Norm Synthesis and Revision","year":2021}