ACM Home Page
Please provide us with feedback. Feedback
Specifying norm-governed computational societies
Full text PdfPdf (1.14 MB)
Source
ACM Transactions on Computational Logic (TOCL) archive
Volume 10 ,  Issue 1  (January 2009) table of contents
Article No. 1  
Year of Publication: 2009
ISSN:1529-3785
Authors
Alexander Artikis  NCSR “Demokritos” Athens, Greece and Imperial College London, UK
Marek Sergot  Imperial College London, UK
Jeremy Pitt  Imperial College London, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 172,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1459010.1459011
What is a DOI?

ABSTRACT

Electronic markets, dispute resolution and negotiation protocols are three types of application domains that can be viewed as open agent societies. Key characteristics of such societies are agent heterogeneity, conflicting individual goals and unpredictable behavior. Members of such societies may fail to, or even choose not to, conform to the norms governing their interactions. It has been argued that systems of this type should have a formal, declarative, verifiable, and meaningful semantics. We present a theoretical and computational framework being developed for the executable specification of open agent societies. We adopt an external perspective and view societies as instances of normative systems. In this article, we demonstrate how the framework can be applied to specifying and executing a contract-net protocol. The specification is formalized in two action languages, the C+ language and the Event Calculus, and executed using respective software implementations, the Causal Calculator and the Society Visualizer. We evaluate our executable specification in the light of the presented case study, discussing the strengths and weaknesses of the employed action languages for the specification of open agent societies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Artikis, A. 2003. Executable specification of open norm-governed computational systems. Ph.D. thesis, University of London. http://www.iit.demokritos.gr/~a.artikis/publications/artikis-phd.pdf (also available from the author).
3
 
4
Artikis, A., Sergot, M., and Pitt, J. 2003. Specifying electronic societies with the Causal Calculator. In Proceedings of Workshop on Agent-Oriented Software Engineering III (AOSE), F. Giunchiglia, J. Odell, and G. Weiss, Eds. Lecture Notes in Computer Science, vol. 2585, Springer-Verlag, Brlin Germany. 1--15.
 
5
 
6
Bing, J. 1998. Managing copyright in a digital environment. In The Impact of Electronic Publishing on the Academic Community, I. Butterworth, Ed. Portland Press, 52--62.
7
 
8
Brewka, G. 2001. Dynamic argument systems: A formal model of argumentation processes based on situation calculus. J. Logic Comput. 11, 2, 257--282.
 
9
 
10
Chittaro, L. and Montanari, A. 1996. Efficient temporal reasoning in the cached event calculus. Comput. Intell. 12, 3, 359--382.
 
11
 
12
Clark, K. 1978. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, 293--322.
 
13
Clarke, E. M., Grumberg, O., and Peled, D. A. 2000. Model Checking. MIT Press, Cambridge, MA.
 
14
 
15
Colombetti, M. 2000. A commitment-based approach to agent speech acts and conversations. In Proceedings of Workshop on Agent Languages and Communication Policies. 21--29.
 
16
Craven, R. 2006. Execution mechanisms for the action language C+. Ph.D. dissertation, University of London, London, UK.
 
17
Craven, R. and Sergot, M. 2005. Distant causation in C+. Studia Logica 79, 1, 73--96.
 
18
Davis, R. and Smith, R. 1983. Negotiation as a metaphor for distributed problem solving. AI 20, 63--109.
19
 
20
 
21
 
22
 
23
Farrell, A., Sergot, M., Sallé, M., and Bartolini, C. 2005. Using the event calculus for tracking the normative state of contracts. Int. J. Coop. Informa. Syst. 4, 2--3, 99--129.
 
24
 
25
 
26
 
27
 
28
 
29
Gelati, J., Governatori, G., Rotolo, A., and Sartor, G. 2002a. Declarative power, representation, and mandate. A formal analysis. In Proceedings of Conference on Legal Knowledge and Information Systems (JURIX).
 
30
Gelati, J., Rotolo, A., and Sartor, G. 2002b. Normative autonomy and normative co-ordination: declarative power, representation, and mandate. In Proceedings of Workshop on the Law of Electronic Agents (LEA). 133--149.
 
31
 
32
 
33
Giunchiglia, E., Lee, J., Lifschitz, V., and Turner, H. 2001. Causal laws and multi-valued fluents. In Proceedings of Workshop on Nonmonotonic Reasoning, Action and Change (NRAC).
 
34
Governatori, G., Gelati, J., Rotolo, A., and Sartor, G. 2002. Actions, institutions, powers: Preliminary notes. In Proceedings of Workshop on Regulated Agent-Based Social Systems: Theories and Applications (RASTA). 69--79.
35
 
36
 
37
Jones, A. 2001. Roles. In Deliverable D2 of ALFEBIITE EU-Project (IST-1999-10298), A. Jones and C. Krogh, Eds. 52--55. http://alfebiite.ee.ic.ac.uk/docs/Deliverables/D2.pdf.
 
38
 
39
Jones, A. and Sergot, M. 1996. A formal characterisation of institutionalised power. J. IGPL 4, 3, 429--445.
 
40
 
41
 
42
 
43
 
44
Lee, J., Lifschitz, V., and Turner, H. 2001. A representation of the zoo world in the language of the Causal Calculator. In Proceedings of Symposium on Formalizations of Commonsense Knowledge.
 
45
Lifschitz, V. 2000. Missionaries and cannibals in the Causal Calculator. In Proceedings of Conference on Principles of Knowledge Representation and Reasoning (KR), A. Cohn, F. Giunchiglia, and B. Selman, Eds. Morgan Kaufmann, San Francisco, CA, 85--96.
 
46
 
47
 
48
Makinson, D. 1986. On the formal representation of rights relations. J. Philos. Logic 15, 403--425.
 
49
 
50
 
51
 
52
53
 
54
Moses, Y. and Tennenholtz, M. 1992. On computational aspects of artificial social systems. In Proceedings of Workshop on Distributed Artificial Intelligence (DAI). 267--284.
 
55
Moses, Y. and Tennenholtz, M. 1995. Artificial social systems. Computers AI 14, 6, 533--562.
 
56
 
57
Noda, I., Matsubara, H., Hiraki, K., and Frank, I. 1998. Soccer server: a tool for research on multi-agent systems. App. AI 12, 2--3, 233--250.
 
58
59
 
60
Pörn, I. 1977. Action theory and social science: some formal models. In Synthese Library Number 120. D. Reidel Publishing Company.
 
61
 
62
 
63
 
64
Rodriguez-Aguilar, J. and Sierra, C. 2002. Enabling open agent institutions. In Socially Intelligent Agents: Creating Relationships with Computers and Robots, K. Dautenhahn, A. Bond, L. Canamero, and B. Edmonds, Eds. Kluwer Academic Publishers, 259--266.
 
65
 
66
Sadighi, B. and Sergot, M. 2002. Contractual access control. In Proceedings of Workshop on Security Protocols. Leature Notes in Computer Science, vol. 2845. Springer-Verlag, New York. 96--102.
 
67
 
68
Searle, J. 1969. Speech Acts. Cambridge University Press, Cambridge, UK.
69
 
70
Sergot, M. 2004a. (C+)++: An action language for modelling norms and institutions. Tech. rep. 2004/8, Department of Computing, Imperial College London, London, UK. http://www.doc.ic.ac.uk/research/technicalreports/2004/DTR04-8.pdf.
 
71
Sergot, M. 2004b. Modelling unreliable and untrustworthy agent behavior. In Proceedings of Workshop on Monitoring, Security, and Rescue Techniques in Multiagent Systems (MSRAS), B. Dunin-Keplicz, A. Jankowski, A. Skowron, and M. Szczuka, Eds. Advances in Soft Computing. Springer-Verlag, New York, 161--178.
 
72
Sergot, M. and Craven, R. 2006. The deontic component of action language nC+. In Deontic Logic and Artificial Normative Systems. Proceedings of the 8th International Workshop on Deontic Logic in Computer Science (DEON'06), L. Goble and J.-J. C. Meyer, Eds. Lecture Notes in Artificial Inteligence, vol. 4048. Springer-Verlag, New York, 222--237.
 
73
Shanahan, M. 1999. The event calculus explained. In Artificial Intelligence Today, M. Wooldridge and M. Veloso, Eds. Lecture Notes in Artificial Inteligence, vol. 1600. Springer-Verlag, New York, 409--430.
 
74
Shanahan, M. 2000. An abductive event calculus planner. J. Logic Program. 44, 207--239.
 
75
 
76
Shoham, Y. and Tennenholtz, M. 1992. On the synthesis of useful social laws for artificial agent societies. In Proceedings of Conference on Artificial Intelligence (AAAI), W. Swartout, Ed. The AAAI Press/The MIT Press, Cambridge, MA, 276--281.
 
77
 
78
 
79
 
80
 
81
 
82
Smith, R. and Davis, R. 1978. Distributed problem solving: the contract-net approach. In Proceedings of Conference of Canadian Society for Computational Studies of Intelligence. 217--236.
 
83
Tennenholtz, M. 1995. On computational social laws for dynamic non-homogeneous social structures. J. Exper. Theor. AI 7, 379--390.
 
84
 
85
Werner, E. 1992. The design of multi-agent systems. In Decentralized A.I., Vol. 3. E. Werner and Y. Demazeau, Eds. Elsevier Science Publishers, 3--30.
86
 
87
88
 
89
 
90
 
91
Zambonelli, F., Jennings, N., and Wooldridge, M. 2001b. Organisational rules as an abstraction for the analysis and design of multi-agent systems. Int. J. Softw. Engin. Knowl. Engin. 11, 3, 303--328.
 
92
93


Collaborative Colleagues:
Alexander Artikis: colleagues
Marek Sergot: colleagues
Jeremy Pitt: colleagues