For many years, the progress in agent-oriented development has focused on tools and methods for particular development phases. This has not been enough for the industry to accept agent technology as we expected. Our hypothesis is that the Agent-Oriented Software Engineering (AOSE) community has not recognized the kind of development methods that industry actually demands. We propose to analyze this hypothesis starting with a more precise definition of what an AOSE methodology should be. This definition is the first step for a review of the current progress of an illustrative selection of methodologies, looking for missing elements and future lines of improvement. The result is an account of how well the AOSE community is meeting the software lifecycle needs. It can be advanced that AOSE methodologies are far from providing all the answers industry requires and that effort has grounded mainly in requirements, design, and implementation phases.

Until recently, little work has been dedicated to the representation and interchange of informal, semi-structured arguments of the type found in natural language prose and dialogue. To redress this, the research community recently initiated work towards an Argument Interchange Format (AIF). The AIF aims to facilitate the exchange of semi-structured arguments among different argument analysis and argumentation-support tools. In this paper, we present a Description Logic ontology for annotating arguments, based on a new reification of the AIF and founded in Walton's theory of argumentation schemes. We demonstrate how this ontology enables a new kind of automated reasoning over argument structures, which complements classical reasoning about argument acceptability. In particular, Web Ontology Language reasoning enables significantly enhanced querying of arguments through automatic scheme classifications, instance classification, inference of indirect support in chained argument structures, and inference of critical questions. We present the implementation of a pilot Web-based system for authoring and querying argument structures using the proposed ontology.

The Internet of Things (IoT) has recently emerged as an innovative technology capable of empowering various areas such as healthcare, agriculture, smart cities, smart homes and supply chain with real-time and state-of-the-art sensing capabilities. Due to the underlying potential of this technology, it already saw exponential growth in a wide variety of use-cases in multiple application domains. As researchers around the globe continue to investigate its aptitudes, a collective agreement is that to get the best out of this technology and to harness its full potential, IoT needs to sit upon a flexible network architecture with strong support for security, privacy and trust. On the other hand, blockchain (BC) technology has recently come into prominence as a breakthrough technology with the potential to deliver some valuable properties such as resiliency, support for integrity, anonymity, decentralization and autonomous control. Several BC platforms are proposed that may be suitable for different use-cases, including IoT applications. In such, the possibility to integrate the IoT and BC technology is seen as a potential solution to address some crucial issues. However, to achieve this, there must be a clear understanding of the requirements of different IoT applications and the suitability of a BC platform for a particular application satisfying its underlying requirements. This paper aims to achieve this goal by describing an evaluation framework which can be utilized to select a suitable BC platform for a given IoT application.

During the last few years, a number of formal specification languages for knowledge-based systems (KBS) have been developed. Characteristics of such systems are a complex knowledge base and an inference engine which uses this knowledge to solve a given problem. Languages for KBS have to cover both these aspects. They have to provide a means to specify a complex and large amount of knowledge and they have to provide a means to specify the dynamic reasoning behaviour of a KBS. Nevertheless, KBS are just a specific type of software system. Therefore, it seems quite natural to compare formal languages for specifying KBS with formal languages which were developed by the software community for specifying software systems. That is the subject of this paper.

This paper reviews a number of hybrid Case-Based Reasoning (CBR) systems. These systems are hybrid because the CBR components cooperate with one or more “co-reasoners” which employ a different type of reasoning strategy (e.g. qualitative simulation, constraint satisfaction, etc.). In this paper, we propose that CBR is in fact an inherently hybrid process. We review a number of systems and identify three classes of architecture which have been used for hybrid systems. We believe that to successfully exploit a co-reasoner within a CBR system it is necessary to analyse where, when, why and how the information provided by the co-reasoner will be used. We propose the KADS methodology as a suitable way of performing such an analysis and illustrate its use by example. We conclude by considering the control issues associated with the construction of hybrid CBR systems. We review the requirements of such systems and consider how well the two existing cooperation architectures match those requirements.

Distributed constraint optimization problems (DCOPs) are important in many areas of computer science and optimization. In a DCOP, each variable is controlled by one of many autonomous agents, who together have the joint goal of maximizing a global objective function. A wide variety of techniques have been explored to solve such problems, and here we focus on one of the main families, namely iterative approximate best-response algorithms used as local search algorithms for DCOPs. We define these algorithms as those in which, at each iteration, agents communicate only the states of the variables under their control to their neighbours on the constraint graph, and that reason about their next state based on the messages received from their neighbours. These algorithms include the distributed stochastic algorithm and stochastic coordination algorithms, the maximum-gain messaging algorithms, the families of fictitious play and adaptive play algorithms, and algorithms that use regret-based heuristics. This family of algorithms is commonly employed in real-world systems, as they can be used in domains where communication is difficult or costly, where it is appropriate to trade timeliness off against optimality, or where hardware limitations render complete or more computationally intensive algorithms unusable. However, until now, no overarching framework has existed for analyzing this broad family of algorithms, resulting in similar and overlapping work being published independently in several different literatures. The main contribution of this paper, then, is the development of a unified analytical framework for studying such algorithms. This framework is built on our insight that when formulated as non-cooperative games, DCOPs form a subset of the class of potential games. This result allows us to prove convergence properties of iterative approximate best-response algorithms developed in the computer science literature using game-theoretic methods (which also shows that such algorithms can also be applied to the more general problem of finding Nash equilibria in potential games), and, conversely, also allows us to show that many game-theoretic algorithms can be used to solve DCOPs. By so doing, our framework can assist system designers by making the pros and cons of, and the synergies between, the various iterative approximate best-response DCOP algorithm components clear.

Automated planning has been a continuous field of study since the 1960s, since the notion of accomplishing a task using an ordered set of actions resonates with almost every known activity domain. However, as we move from toy domains closer to the complex real world, these actions become increasingly difficult to codify. The reasons range from intense laborious effort, to intricacies so barely identifiable, that programming them is a challenge that presents itself much later in the process. In such domains, planners now leverage recent advancements in machine learning to learn action models, that is, blueprints of all the actions whose execution effectuates transitions in the system. This learning provides an opportunity for the evolution of the model toward a version more consistent and adapted to its environment, augmenting the probability of success of the plans. It is also a conscious effort to decrease laborious manual coding and increase quality. This paper presents a survey of the machine learning techniques applied for learning planning action models. It first describes the characteristics of learning systems. It then details the learning techniques that have been used in the literature during the past decades, and finally presents some open issues.

Blockchain is an emerging technology framework for creating and storing transaction in distributed ledgers with a high degree of security and reliability. In this paper, we present a blockchain-based platform to create and store contracts in between students and their higher education sponsors facilitated by intermediary brokers denoted as fundraisers. The sponsorship might be in any form, such as scholarship, donation, or loan. The fund will be arranged and managed by a group of competitive fundraisers who will hold the distributed ledgers and act as the miners in the blockchain network.

The vision of future electronic marketplaces (e-markets) is that of markets being populated by autonomous intelligent entities—software, trading, e-agents—representing their users or owners and conducting business on their behalf. For this vision to materialize, one fundamental issue that needs to be addressed is that of trust. First, users need to be able to trust that the agents will do what they say they do. Second, they need to be confident that their privacy is protected and that the security risks involved in entrusting agents to perform transactions on their behalf are minimized. Finally, users need to be assured that any legal issues relating to agents trading electronically are fully covered as they are in traditional trading practices. In this paper we consider the barriers for the adoption of agent technology in electronic commerce (e-commerce) which pertain to trust, security and legal issues. We discuss the perceived risks of the use of agents in e-commerce and the fundamental issue of trust in this context. Issues regarding security, and how some of these can be addressed through the use of cryptography, are described. The impact of the use of agent technology on the users' privacy and how it can be both protected as well as hindered by it is also examined. Finally, we discuss the legal issues that arise in agent-mediated e-commerce and discuss the idea of attributing to software agents the status of legal persons or e-persons and the various implications.

Resource allocation in multiagent systems is a central research issue in the AgentLink community. The aim of the Technical Forum Group on Multiagent Resource Allocation (TFG-MARA) is to provide a venue for the exchange of ideas in this area and to foster collaboration between different research groups. In this article we report on the first meeting of TFG-MARA, which was held as part of the Second AgentLink III Technical Forum in Ljubljana.

We understand a socio-technical system (STS) as a cyber-physical system in which two or more autonomous parties interact via or about technical elements, including the parties’ resources and actions. As information technology begins to pervade every corner of human life, STSs are becoming ever more common, and the challenge of governing STSs is becoming increasingly important. We advocate a normative basis for governance, wherein norms represent the standards of correct behaviour that each party in an STS expects from others. A major benefit of focussing on norms is that they provide a socially realistic view of interaction among autonomous parties that abstracts low-level implementation details. Overlaid on norms is the notion of a sanction as a negative or positive reaction to potentially any violation of or compliance with an expectation. Although norms have been well studied as regards governance for STSs, sanctions have not. Our understanding and usage of norms is inadequate for the purposes of governance unless we incorporate a comprehensive representation of sanctions.

We address the aforementioned gap by proposing (i) a sanction typology that reflects the relevant features of sanctions, and (ii) a conceptual sanctioning process model providing a functional structure for sanctioning in STS. We demonstrate our contributions via a motivating scenario from the domain of renewable energy trading.

The new technologies for Knowledge Discovery from Databases (KDD) and data mining promise to bring new insights into a voluminous growing amount of biological data. KDD technology is complementary to laboratory experimentation and helps speed up biological research. This article contains an introduction to KDD, a review of data mining tools, and their biological applications. We discuss the domain concepts related to biological data and databases, as well as current KDD and data mining developments in biology.

The realization that knowledge management (KM) is primarily a management science and not a computer science implies a different role for technology in KM. This role is concerned with supporting and extending human interaction and learning, and has therefore the need for intelligence-enhanced, integrated and personalized solutions including agent-based approaches. A people-centered view of KM requires support systems that enable the flexible integration of organizational and individual requirements and objectives. This paper introduces the OperA model for organizations that supports individual initiative and collaboration while prescribing a formal structure for organizational processes. The paper introduces the main aspects of the model and describes a case study where OperA is applied to the development of a knowledge-sharing support system.

How free are our software agents to take the best possible care of our interests? How free can we make them? In what sense and to what extent do currently proposed mechanisms and agent behaviors consider self-interest? What current research addresses these issues? What needs to be done? We address these issues in the context of electronic markets, such as consumer goods markets and (future, more fine-grained) markets for electric power or communication bandwidth.

Interest in the nature, development and use of ontologies is becoming increasingly widespread. Since the early nineties, numerous workshops have been held. Representatives from historically separate disciplines concerned with philosophical issues, knowledge acquisition and representation, planning, process management, database schema integration, natural language processing and enterprise modelling, came together to identify a common core of issues of interest. There was highly varied and inconsistent usage of a wide variety of terms, most notably, “ontology”, rendering cross-discipline communication difficult. However, progress was made toward understanding the commonality among the disciplines. Subsequent workshops addressed various aspects of the field, including theoretical issues, methodologies for building ontologies, as well as specific applications in government and industry.

Safety-critical software must be thoroughly verified before being exploited in commercial applications. In particular, any TCAS (Traffic Alert and Collision Avoidance System) implementation must be verified against safety properties extracted from the anti-collision theory that regulates the controlled airspace. This verification step is currently realized with manual code reviews and testing. In our work, we explore the capabilities of Constraint Programming for automated software verification and testing. We built a dedicated constraint solving procedure that combines constraint propagation with Linear Programming to solve conditional disjunctive constraint systems over bounded integers extracted from computer programs and safety properties. An experience we made on verifying a publicly available TCAS component implementation against a set of safety-critical properties showed that this approach is viable and efficient.

Research on the relation between Belief Revision and Argumentation has always been fruitful in both directions: some argumentation formalisms can be used to define belief change operators, and belief change techniques have also been used for modeling the dynamics of beliefs in argumentation formalisms. In this paper, we give a historical perspective on how belief revision has evolved in the last three decades, and how it has been combined with argumentation. First, we will recall the foundational works concerning the links between both areas. On the basis of such insights, we will present a conceptual view on this topic and some further developments. We offer a glimpse into the future of research in this area based on the understanding of argumentation and belief revision as complementary, mutually useful disciplines.

This article presents and motivates an extended ontology knowledge model which represents explicitly semantic information about concepts. This knowledge model results from enriching the standard conceptual model with semantic information which precisely characterises the concept's properties and expected ambiguities, including which properties are prototypical of a concept and which are exceptional, the behaviour of properties over time and the degree of applicability of properties to subconcepts. This enriched conceptual model permits a precise characterisation of what is represented by class membership mechanisms and helps knowledge engineers to determine, in a straightforward manner, the meta-properties holding for a concept. Meta-properties are recognised to be the main tool for a formal ontological analysis that allows us to build ontologies with a clean and untangled taxonomic structure.

This enriched semantics can prove useful to describe what is known by agents in a multi-agent system, and might facilitate the use of reasoning mechanisms on the knowledge that instantiates an ontology. These mechanisms can be used to solve ambiguities that can arise when agents with heterogeneous ontologies have to interoperate in order to perform a task.

This paper will summarize and analyze the work of the different research groups who have recently made significant contributions in using Reinforcement Learning techniques to learn dialogue strategies for Spoken Dialogue Systems (SDSs). This use of stochastic planning and learning has become an important research area in the past 10 years, since it promises automatic data-driven optimization of the behavior of SDSs that were previously hand-coded by expert developers. We survey the most important developments in the field, compare and contrast the different approaches, and describe current open problems.

There are many approaches for solving planning problems. Many of these approaches are based on ‘brute force’ search methods and they usually do not care about structures of plans previously computed in particular planning domains. By analyzing these structures, we can obtain useful knowledge that can help us find solutions to more complex planning problems. The method described in this paper is designed for gathering macro-operators by analyzing training plans. This sort of analysis is based on the investigation of action dependencies in training plans. Knowledge gained by our method can be passed directly to planning algorithms to improve their efficiency.