Paolo Torroni

Verifiable agent interaction in abductive logic programming: The SCIFF framework

SCIFF is a framework thought to specify and verify interaction in open agent societies. The SCIFF language is equipped with a semantics based on abductive logic programming; SCIFFs operational component is a new abductive logic programming proof procedure, also named SCIFF, for reasoning with expectations in dynamic environments. In this article we present the declarative and operational semantics of the SCIFF language, and the termination, soundness, and completeness results of the SCIFF proof procedure, and we demonstrate SCIFFs possible application in the multiagent domain.

An Abductive Logic Programming Architecture for Negotiating Agents

In this paper, we present a framework for agent negotiation based on abductive logic programming. The framework is based on an existing architecture for logic-based agents, and extends it by accommodating dialogues for negotiation. As an application of negotiating agents, we propose a resource-exchanging problem. The innovative contribution of this work is in the definition of an operational model, including an agent cycle and dialogue cycle, and in the results that apply in the general case of abductive agents and in the specific case of a class of agent systems.

COMPLIANCE VERIFICATION OF AGENT INTERACTION: A LOGIC-BASED SOFTWARE TOOL

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 with 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 with interaction protocols. In this paper we present a JAVA-PROLOG software component built on logic programming technology, which can be used to verify compliance of agent interaction to protocols, and that has been integrated with the PROSOCS platform.

COMPUTATIONAL LOGICS AND AGENTS: A ROAD MAP OF CURRENT TECHNOLOGIES AND FUTURE TRENDS

The concept of an agent is increasingly used in contemporary software applications, particularly those involving the Internet, autonomous systems, or cooperation. However, with dependability and safety in mind, it is vital that the mechanisms for representing and implementing agents are clear and consistent. Hence there has been a strong research effort directed at using formal logic as the basis for agent descriptions and agent implementation. Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied. We present a road map of research into the use of computational logic in agent‐based systems and survey much of the recent work in these areas. Even though, with such a rapidly changing field, it is impossible to cover every development, we aim to give the reader sufficient background to understand the current research problems and potential future developments in this maturing area.

The Added Value of Argumentation

We discuss the value of argumentation in reaching agreements, based on its capability for dealing with conflicts and uncertainty. Logic-based models of argumentation have recently emerged as a key topic within Artificial Intelligence. Key reasons for the success of these models is that they are akin to human models of reasoning and debate, and their generalisation to frameworks for modelling dialogues. They therefore have the potential for bridging between human and machine reasoning in the presence of uncertainty and conflict. We provide an overview of a number of examples that bear witness to this potential, and that illustrate the added value of argumentation. These examples amount to methods and techniques for argumentation to aid machine reasoning (e.g. in the form of machine learning and belief functions) on the one hand and methods and techniques for argumentation to aid human reasoning (e.g. for various forms of decision making and deliberation and for the Web) on the other. We also identify a number of open challenges if this potential is to be realised, and in particular the need for benchmark libraries.

Representing and monitoring social commitments using the event calculus

Multiagent social commitments provide a principled basis for agent interactions, and serve as a natural tool to resolve design ambiguities. Indeed, they have been the subject of considerable research for more than a decade. However, the take-up of the social commitments paradigm is yet to come. To explain this negative result, we pinpoint a number of shortcomings, which this article aims to address. We extend current commitment modelling languages, thus leveraging expressive possibilities that were precluded by previous formalizations. We propose a novel axiomatization of commitment operations in a first order Event Calculus framework, that accommodates reasoning with data and metric time. Finally, we illustrate how publicly available

Languages, Methodologies and Development Tools for Multi-Agent Systems

{\mathcal{REC}}

Social commitments in time: satisfied or compensated

implementations can be exploited for commitment monitoring purposes.