Specifying norm-governed computational societies
Open Access
- 23 January 2009
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 10 (1) , 1-42
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.Keywords
Funding Information
- EU ALFEBIITE (IST-1999-10298)
- Engineering and Physical Sciences Research Council (GR S74911 01)
This publication has 49 references indexed in Scilit:
- An executable specification of a formal argumentation protocolArtificial Intelligence, 2007
- Event Calculus Reasoning Through SatisfiabilityJournal of Logic and Computation, 2004
- A computational theory of normative positionsACM Transactions on Computational Logic, 2001
- The Anatomy of the Grid: Enabling Scalable Virtual OrganizationsThe International Journal of High Performance Computing Applications, 2001
- Law-governed interactionACM Transactions on Software Engineering and Methodology, 2000
- An abductive event calculus plannerThe Journal of Logic Programming, 2000
- Agent communication languages: rethinking the principlesComputer, 1998
- The industrial virtual enterpriseCommunications of the ACM, 1997
- EFFICIENT TEMPORAL REASONING IN THE CACHED EVENT CALCULUSComputational Intelligence, 1996
- On computational social laws for dynamic non-homogeneous social structures*Journal of Experimental & Theoretical Artificial Intelligence, 1995