The complexity of data-driven norm synthesis and revision

Publication date

2021-12-05

Authors

Dell’Anna, DavideORCID 0000-0002-1162-8341ISNI 0000000492852875
Alechina, NatashaORCID 0000-0003-3306-9891ISNI 0000000124421545
Logan, BrianORCID 0000-0003-0648-7107ISNI 0000000124462996
Löffler, MaartenISNI 000000039666142X
Dalpiaz, FabianoISNI 0000000419575525
Dastani, MehdiISNI 0000000043464658

Editors

Advisors

Supervisors

Document Type

/dk/atira/pure/researchoutput/researchoutputtypes/workingpaper/preprint
Open Access logo

License

cc_by

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.

Keywords

Citation

Dell'Anna, D, Alechina, N, Logan, B, Löffler, M, Dalpiaz, F & Dastani, M 2021 'The complexity of data-driven norm synthesis and revision' arXiv. https://doi.org/10.48550/arxiv.2112.02626