Intelligent agents built on the basis of the BDI (belief–desire–intention) architecture are known as BDI agents. Currently, due to the increasing importance given to the affective capacities, they have evolved giving way to the BDI emotional agents. These agents are generally characterized by affective states such as emotions, mood or personality but sometimes also by affective capacities such as empathy or emotional regulation. In the paper, a review of the most relevant proposals to include emotional aspects in the design of BDI agents is presented. Both BDI formalizations and BDI architecture extensions are covered. From the review, common findings and good practices modeling affect, empathy and regulatory capacities in BDI agents, are extracted. In spite of the great advance in the area several, open questions remain and are also discussed in the paper.

In this article, we describe PrediCalc, a logical spreadsheet that allows for many-to-many constraints and propagation in all directions. We explain PrediCalc’s update mechanism and PrediCalc’s unique approach to handling inconsistencies between the spreadsheet values and the spreadsheet formulas. We have developed a paraconsistent entailment relation for the purpose of computing the consequences of PrediCalc’s value assignments under inconsistency.

We close with thoughts on the prospects of logical spreadsheets on the World Wide Web, and describe our initial Websheet prototypes.

This paper examines a perceived desire amongst software agent application and platform developers to have the ability to send domain-specific objects within inter-agent messages. If this feature is to be supported without departing from the notion that agents communicate in terms of knowledge, it is important that the meaning of such objects be well defined. Using an object-oriented metamodelling approach, the relationships between ontologies and agent communication and content languages in FIPA-style agent systems are examined. It is argued that for use with distributed multi-agent systems, ontologies should describe the nature of object identity and reference for each defined concept, and a UML profile supporting these modelling capabilities is presented. Finally it is shown how, given an ontology in UML, an ontology-specific object-oriented content language can be generated, allowing object structures (viewed in the abstract as UML object diagrams) to be used within message content to represent propositions, definite descriptions or (for classes without identity) value expressions.

The concept of a norm is found widely across fields including artificial intelligence, biology, computer security, cultural studies, economics, law, organizational behaviour and psychology. The concept is studied with different terminology and perspectives, including individual, social, legal and philosophical. If a norm is an expected behaviour in a social setting, then this article considers how it can be determined whether an individual is adhering to this expected behaviour. We call this process monitoring, and again it is a concept known with different terminology in different fields. Monitoring of norms is foundational for processes of accountability, enforcement, regulation and sanctioning. Starting with a broad focus and narrowing to the multi-agent systems literature, this survey addresses four key questions: what is monitoring, what is monitored, who does the monitoring and how the monitoring is accomplished.

AI researchers are becoming increasingly aware of the importance of reasoning about knowledge and belief. This paper reviews epistemic logic, a logic designed specifically for this type of reasoning. I introduce epistemic logic, and discuss some of the philosophical problems associated with it. I then compare two different styles of implementing theorem provers for epistemic logic. I also briefly discuss autoepistemic logic, a form of epistemic logic intended to model an agent's introspective reasoning, i.e. an agent's reasoning about its own beliefs. Finally, I discuss some of the proposals in the AI literature that are aimed at avoiding some of the philosophical problems that dog both epistemic and autoepistemic logic. This paper is not a full introduction to the field. Rather, it is intended to give the reader some flavour of the problems that research in this area faces, as well as some of the proposals for solving these problems.

Construction Engineering and Management is a broad area of civil engineering practice which includes: (1) planning and engineering of the temporary facilities for construction sites; (2) management of the construction process; and (3) rehabilitation, repair and maintenance of engineered facilities, where the traditionally distinct design and construction roles of participants have become merged. The broad scope of this field, combined with the empirical nature of many facets of construction engineering and management practice, have led to a significant amount of expert system activity in this domain.

Nowadays the composition and formation of effective teams is highly important for both companies to assure their competitiveness and for a wide range of emerging applications exploiting multiagent collaboration (e.g. crowdsourcing, human-agent collaborations). The aim of this article is to provide an integrative perspective on team composition, team formation, and their relationship with team performance. Thus, we review the contributions in both the computer science literature and the organizational psychology literature dealing with these topics. Our purpose is twofold. First, we aim at identifying the strengths and weaknesses of the contributions made by these two diverse bodies of research. Second, we aim at identifying cross-fertilization opportunities that help both disciplines benefit from one another. Given the volume of existing literature, our review is not intended to be exhaustive. Instead, we have preferred to focus on the most significant contributions in both fields together with recent contributions that break new ground to spur innovative research.

This paper is a review of research into cognitive expertise. The review is organized in terms of a simple model of the knowledge and cognitive processes that might be expected to be enhanced in experts relative to non-experts. This focus on cognitive competence underlying expert performance permits the identification of skills and knowledge that we might wish to capture and model in expert systems. The competence perspective also indicates areas of weakness in human experts. In these areas, we might wish to support or replace the expert with, for example, a normative system rather than attempting to model his or her knowledge.

This paper describes ILP-PLAN, a framework for solving AI planning problems represented as integer linear programs. ILP-PLAN extends the planning as satisfiability framework to handle plans with resources, action costs, and complex objective functions. We show that challenging planning problems can be effectively solved using both traditional branch-and-bound integer programming solvers and efficient new integer local search algorithms. ILP-PLAN can find better quality solutions for a set of hard benchmark logistics planning problems than had been found by any earlier system.

We present an action model learning system known as ARMS (Action-Relation Modelling System) for automatically discovering action models from a set of successfully observed plans. Current artificial intelligence (AI) planners show impressive performance in many real world and artificial domains, but they all require the definition of an action model. ARMS is aimed at automatically learning action models from observed example plans, where each example plan is a sequence of action traces. These action models can then be used by the human editors to refine. The expectation is that this system will lessen the burden of the human editors in designing action models from scratch. In this paper, we describe the ARMS in detail. To learn action models, ARMS gathers knowledge on the statistical distribution of frequent sets of actions in the example plans. It then builds a weighted propositional satisfiability (weighted SAT) problem and solves it using a weighted MAXSAT solver. Furthermore, we show empirical evidence that ARMS can indeed learn a good approximation of the finally action models effectively.

Nowadays, Multi-Agent Systems (MAS) are broadening their applications to open environments, where heterogeneous agents could enter into the system, form agents’ organizations and interact. The high dynamism of open MAS gives rise to potential conflicts between agents and thus, to a need for a mechanism to reach agreements. Argumentation is a natural way of harmonizing conflicts of opinion that has been applied to many disciplines, such as Case-Based Reasoning (CBR) and MAS. Some approaches that apply CBR to manage argumentation in MAS have been proposed in the literature. These improve agents’ argumentation skills by allowing them to reason and learn from experiences. In this paper, we have reviewed these approaches and identified the current contributions of the CBR methodology in this area. As a result of this work, we have proposed several open issues that must be taken into consideration to develop a CBR framework that provides the agents of an open MAS with arguing and learning capabilities.

Network providers either attempt to handle massive distributed denial-of-service attacks themselves or redirect traffic to third-party scrubbing centers. If providers adopt the first option, it is sensible to counter such attacks in their infancy via provider collaborations deploying distributed security mechanisms across multiple domains in an attack path. This motivated our work presented in this paper. Specifically, we investigate the establishment of trusted federations among adjacent and disjoint network domains, that is, autonomous systems (ASes) that collectively mitigate malicious traffic. Our approach is based on Distributed Ledger Technologies for signaling, coordination, and orchestration of a collaborative mitigation schema via appropriate blockchain-based smart contracts. Reputation scores are used to rank ASes based on their mitigation track record. The allocation of defense resources across multiple collaborators is modeled as a combinatorial optimization problem considering reputation scores and network flow weights. Malicious flows are mitigated using programmable network data paths within the eXpress Data Path (XDP) framework; this enables operators with enhanced packet processing throughput and advanced filtering flexibility. Our schema was implemented in a proof-of-concept prototype and tested under realistic network conditions.

The development of complex systems ensembles that operate in uncertain environments is a major challenge. The reason for this is that system designers are not able to fully specify the system during specification and development and before it is being deployed. Natural swarm systems enjoy similar characteristics, yet, being self-adaptive and being able to self-organize, these systems show beneficial emergent behaviour. Similar concepts can be extremely helpful for artificial systems, especially when it comes to multi-robot scenarios, which require such solution in order to be applicable to highly uncertain real world application. In this article, we present a comprehensive overview over state-of-the-art solutions in emergent systems, self-organization, self-adaptation, and robotics. We discuss these approaches in the light of a framework for multi-robot systems and identify similarities, differences missing links and open gaps that have to be addressed in order to make this framework possible.

This paper presents a general approach to automatically compile e-learning models to planning, allowing us to easily generate plans, in the form of learning designs, by using existing domain-independent planners. The idea is to compile, first, a course defined in a standard e-learning language into a planning domain, and, second, a file containing students learning information into a planning problem. We provide a common compilation and extend it to three particular approaches that cover a full spectrum of planning paradigms, which increases the possibilities of using current planners: (i) hierarchical, (ii) including PDDL (Planning Domain Definition Language) actions with conditional effects and (iii) including PDDL durative actions. The learning designs are automatically generated from the plans and can be uploaded, and subsequently executed, by learning management platforms. We also provide an extensive analysis of the e-learning metadata specification required for planning, and the pros and cons on the knowledge engineering procedures used in each of the three compilations. Finally, we include some qualitative and quantitative experimentation of the compilations in several domain-independent planners to measure its scalability and applicability.

Forming coalitions is a generic means for cooperation: people, robots, web services, resources, firms; they can all improve their performance by joining forces. The use of coalitions has been successful in domains such as task allocations, sensor networks, and electronic marketplaces. Forming efficient coalitions requires the identification of matching synergies between different entities (finding complementary partners, or similar partners, or partners who add diversity). In addition, the different parties must negotiate a fair repartition of the worth created by the coalition. The first part of this paper is a tutorial on cooperative game theory (also called coalitional games). We then survey the different scenarios and the key issues addressed by the multiagent systems community.

Compilation to Boolean satisfiability has become a powerful paradigm for solving artificial intelligence problems. However, domains that require metric reasoning cannot be compiled efficiently to satisfiability even if they would otherwise benefit from compilation. We address this problem by combining techniques from the artificial intelligence and operations research communities. In particular, we introduce the LCNF (Linear Conjunctive Normal Form) representation that combines propositional logic with metric constraints. We present LPSAT (Linear Programming plus SATisfiability), an engine that solves LCNF problems by interleaving calls to an incremental Simplex algorithm with systematic satisfaction methods. We explore several techniques for enhancing LPSAT's efficiency and expressive power by adjusting the interaction between the satisfiability and linear programming components of LPSAT. Next, we describe a compiler that converts metric resource planning problems into LCNF for processing by LPSAT. Finally, the experimental section of the paper explores several optimisations to LPSAT, including learning from constraint failure and randomised cutoffs.

Nowadays travellers can benefit from the computing capabilities, collection of on board sensors and ubiquitous Internet access provided by mobile devices. These are the three pillars of any tourist support system since they provide the power, means and data to establish the local user context, to access remote services and to provide value-added user-centred context-aware applications. However, making sense of the user context data is not straightforward, as it requires dedicated knowledge acquisition and knowledge representation solutions. Besides, the range and diversity of available data sources is huge, requiring appropriate knowledge processing techniques to provide addequated tourism services. This article presents an updated review, and a comparison of recent context-aware tourism applications (CATA), including supporting technologies; and considering four possible dimensions: knowledge acquisition, knowledge representation, knowledge processing and knowledge-based services. We propose and apply a CATA analysis framework, contemplating these four dimensions to the applications found in the literature. This survey constitutes, not only, a state of the art review on tourism mobile applications, but, also, anticipates the latest development trends in tourism-related applications.

In the past decade, expert systems have been applied to a wide variety of application tasks. A central problem of expert system development and maintenance is the demand placed on knowledge engineers and domain experts. A commonly proposed solution is knowledge-acquisition tools. This paper reviews a class of knowledge-acquisition tools that presuppose the problem-solving method, as well as the structure of the knowledge base. These explicit problem-solving models are exploited by the tools during knowledge-acquisition, knowledge generalization, error checking and code generation.

The main components of case-based reasoning are case retrieval and case reuse. While case retrieval mostly uses attribute comparisons, many other possibilities exist. The case similarity concepts described in the literature that are based on more elaborate structural properties are classified here into five groups: restricted geometric relationships; graphs; semantic nets; model-based similarities; hierarchically structured similarities. Some general topics conclude this survey on structure-based case retrieval methods and systems.

This paper outlines the educational advantages provided by adaptive systems and stresses the importance of the user model in the task of adaptation. The paper also establishes a general taxonomy of user models thereby enabling classification of any model according to various features related to its structure and management. This taxonomy allows an exhaustive description of all user models, facilitating analysis and design of the corresponding adaptive systems. Subsequently, the taxonomy is used to describe the user modeling process in a concrete adaptive hypermedia system and to analyze the model of a student appropriate for use in a general educational environment.