Results 1 - 10
of
86
Verifiable agent interaction in Abductive Logic Programming: the SCIFF framework
- ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2008
"... SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of ..."
Abstract
-
Cited by 76 (53 self)
- Add to MetaCart
SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of SCIFF, its termination, soundness and completeness results, and some sample applications to demonstrate its use in the multi-agent domain.
Temporalised normative positions in defeasible logic
- Procedings of the 10th International Conference on Artificial Intelligence and Law
, 2005
"... ..."
(Show Context)
Specifying norm-governed computational societies
- ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2007
"... 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 behaviour. Members of such societies may f ..."
Abstract
-
Cited by 53 (12 self)
- Add to MetaCart
(Show Context)
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 behaviour. 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 paper we demonstrate how the framework can be applied to specifying and executing a contract-net protocol. The specification is formalised in two action languages, the C+ language and the Event Calculus, and executed using respective software implementations, the Causal Calculator and the Society Visualiser. 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.
Specification and Verification of Agent Interaction Protocols in a Logic-based System
- PROCEEDINGS OF THE 2004 ACM SYMPOSIUM ON APPLIED COMPUTING (SAC)
, 2004
"... In multiagent systems, agent interaction is ruled by means of interaction protocols. Compliance to protocols can be hardwired in agent programs; however, this requires that only “certified ” agents interact. In open societies, composed of autonomous and heterogeneous agents whose internal structure ..."
Abstract
-
Cited by 50 (9 self)
- Add to MetaCart
In multiagent systems, agent interaction is ruled by means of interaction protocols. Compliance to protocols can be hardwired in agent programs; however, this requires that only “certified ” agents interact. In open societies, composed of autonomous and heterogeneous agents whose internal structure is, in general, not accessible, interaction protocols should be specified in terms of the agent observable behaviour, and compliance should be verified by an external entity. In this paper, we propose a Java-Prolog-CHR system for verification of compliance of agents ’ behaviour to protocols specified in a logic-based formalism (Social Integrity Constraints). We also present the application of the formalism and the system to the specification and verification of the FIPA Contract-Net protocol.
Compliance verification of agent interaction: a logic-based tool
- Applied Artificial Intelligence
, 2006
"... In open societies of agents, where agents are autonomous and heterogeneous, it is not realistic to assume that agents will always act so as to comply to interaction protocols. Thus, the need arises for a formalism to specify constraints on agent interaction, and for a tool able to observe and check ..."
Abstract
-
Cited by 47 (24 self)
- Add to MetaCart
In open societies of agents, where agents are autonomous and heterogeneous, it is not realistic to assume that agents will always act so as to comply to interaction protocols. Thus, the need arises for a formalism to specify constraints on agent interaction, and for a tool able to observe and check for agent compliance to interaction protocols. In this paper we present a Java-Prolog software component which can be used to verify compliance of agent interaction to protocols written in a logicbased formalism (Social Integrity Constraints). 1
Using the event calculus for tracking the normative state of contracts
- International Journal of Cooperative Information Systems
, 2005
"... In this work, we have been principally concerned with the representation of contracts so that their normative state may be tracked in an automated fashion over their deployment lifetime. The normative state of a contract, at a particular time, is the aggregation of instances of normative relations t ..."
Abstract
-
Cited by 46 (1 self)
- Add to MetaCart
(Show Context)
In this work, we have been principally concerned with the representation of contracts so that their normative state may be tracked in an automated fashion over their deployment lifetime. The normative state of a contract, at a particular time, is the aggregation of instances of normative relations that hold between contract parties at that time, plus the current values of contract variables. The effects of contract events on the normative state of a contract are specified using an XML formalisation of the Event Calculus, called ecXML. We use an example mail service agreement from the domain of web services to ground the discussion of our work. We give a characterisation of the agreement according to the normative concepts of: obligation, power and permission, and show how the ecXML representation may be used to track the state of the agreement, according to a narrative of contract events. We also give a description of a state tracking architecture, and a contract deployment tool, both of which have been implemented in the course of our work. 1
Specification and verification of agent interaction using social integrity constraints
- In LCMAS’03: Logic and Communication in Multi-Agent Systems. ENTCS
, 2004
"... In this paper we propose a logic-based social approach to the specification and verification of agent interaction. We firstly introduce integrity constraints about social acts (called Social Integrity Constraints) as a formalism to express interaction protocols and to give a social semantics to the ..."
Abstract
-
Cited by 35 (14 self)
- Add to MetaCart
(Show Context)
In this paper we propose a logic-based social approach to the specification and verification of agent interaction. We firstly introduce integrity constraints about social acts (called Social Integrity Constraints) as a formalism to express interaction protocols and to give a social semantics to the behavior of agents, focusing on communicative acts. Then, we discuss several possible kinds of verification of agent interaction, and we show how social integrity constraints can be used to verify some properties in this respect. We focus our attention on static verification of compliance of agent specifications to interaction protocols, and on run-time verification, based on agents ’ observable behavior. We adopt as a running example the NetBill security transaction protocol for the selling and delivery of information goods. 1
A Protocol for Resource Sharing in Norm-Governed Ad Hoc Networks
, 2005
"... Ad hoc networks may be viewed as computational systems whose members may fail to, or choose not to, comply with the rules governing their behaviour. We are investigating to what extent ad hoc networks can usefully be described in terms of permissions, obligations and other more complex normative r ..."
Abstract
-
Cited by 34 (9 self)
- Add to MetaCart
(Show Context)
Ad hoc networks may be viewed as computational systems whose members may fail to, or choose not to, comply with the rules governing their behaviour. We are investigating to what extent ad hoc networks can usefully be described in terms of permissions, obligations and other more complex normative relations, based on our previous work on specifying and modelling open agent societies. We now propose to employ our existing framework for the management of ad hoc networks, exploiting the similarities between open agent societies and ad hoc networks viewed at the application level. We also discuss the prospects of modelling ad hoc networks at the physical level in similar terms. We demonstrate the framework by constructing an executable specification, in the event calculus, of a common type of protocol used to regulate the control of access to shared resources in ad hoc networks.
M.: Artificial Institutions: A Model of Institutional Reality for Open Multi-Agent Systems
- AI and Law
, 2008
"... Software agents ’ ability to interact within different open systems, de-signed by different groups, presupposes an agreement on an unambiguous definition of a set of concepts, used to describe the context of the in-teraction and the communication language the agents can use. Agents’ interactions oug ..."
Abstract
-
Cited by 32 (9 self)
- Add to MetaCart
(Show Context)
Software agents ’ ability to interact within different open systems, de-signed by different groups, presupposes an agreement on an unambiguous definition of a set of concepts, used to describe the context of the in-teraction and the communication language the agents can use. Agents’ interactions ought to allow for reliable expectations on the possible evo-lution of the system; however, in open systems interacting agents may not conform to predefined specifications. A possible solution is to define interaction environments including a normative component, with suitable rules to regulate the behaviour of agents. To tackle this problem we propose an application-independent meta-model of artificial institutions that can be used to define open multiagent systems. In our view an artificial institution is made up by an ontology that models the social context of the interaction, a set of authorizations to act on the institutional context, a set of linguistic conventions for the per-formance of institutional actions and a system of norms that are necessary to constrain the agents ’ actions. 1
An executable specification of an argumentation protocol
- IN PROCEEDINGS OF CONFERENCE ON ARTIFICIAL INTELLIGENCE AND LAW (ICAIL
, 2003
"... Open multi-agent computational systems are composed of heterogeneous and possibly antagonistic software entities. Characteristic features are limited trust and unpredictable behaviour. Members of such systems may fail to, or even choose not to, conform to the norms governing their interactions. It h ..."
Abstract
-
Cited by 32 (15 self)
- Add to MetaCart
(Show Context)
Open multi-agent computational systems are composed of heterogeneous and possibly antagonistic software entities. Characteristic features are limited trust and unpredictable behaviour. Members of such systems 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 such systems. We adopt an external perspective and view open computational systems as instances of normative systems. In this paper we demonstrate how the framework can be applied to specifying and executing an argumentation protocol based on Brewka’s reconstruction of Rescher’s theory of formal disputation. The specification is formalised in the action language C+ and executed using the ‘Causal Calculator’ (Ccalc) implementation.