This paper provides a historical summary of the motivations which have led several research communities to contemplate qualitative techniques. Qualitative reasoning satisfies various problem solving needs in high level decision tasks, embodied in a set of tools which allow deep knowledge to be put in compatible form with software requirements while still remaining realistic. An overview of these mathematical formalisms is presented; qualitative simulation is introduced as one of the most significant outcomes. Finally, some current research issues concerning temporal aspects of qualitative reasoning are discussed.

Although expert systems and knowledge engineering are attracting great attention there is still confusion about what they are. Most expert systems deal with problems which are familiar to other disciplines and their distinctive character is not always recognised. This tutorial describes the origins of expert systems in Artificial Intelligence, and the technical concept of “knowledge”. The central feature is the ideal of explicitly representing knowledge as facts, rules and other symbolic structures, rather than the traditional representation as abstract numbers or algorithms. These developments yield new solutions to old problems, and ways of solving problems whcih have previously been thought to be the preserve of the human intellect.

Recently there has been an increase in the number of computer aided design systems developed explicitly representing knowledge about the functionality of engineering designs. Reviewing these systems provides an understanding of the methods workers use to encapsulate knowledge of functionality within their systems. A number of issues are addressed to reveal the nature of their approaches. The developers' perception of functionality is discussed to identify variations in understanding of function and to establish the existence of any consensus. Methods of representing this knowledge are examined, thereby identifying representation types or combinations used and the advantages to be gained from any single representation. Illustrations of the manipulation of function shows how this type of knowledge can be used to support reasoning during early stage design. A survey of relationships with other design characteristics as a testimony to the manipulation of functionality is used to impact other aspects of a design. Through knowledge of relationships some models of the design process are posited by workers. A study of these bears evidence of the role of function in design and the stages at which its use is significant.

Decision-making is an integral part of any consideration of the discipline of control Systems. This implies feedback of knowledge in some format, whether it is mediated via human or machineoriented methods. The application of AI methodologies to control Systems engineering is described in this review under two broad categories of design and implementation. The design of control strategies is itself divided into phases of modelling and simulation, identification, and algorithm selection and tuning. The aspects of implementation which are covered include real-time considerations such as knowledge-based control and fuzzy logic, multi-sensor data fusion, fault detection and Human–Computer Interaction (HCI).

Based on a survey of recent literature, this report aims to highlight the issues associated with the verification and validation of knowledge based systems. The confusion arising from the lack of clear terminology is considered, along with some of the characteristics of knowledge based systems that cause particular difficulties for verification and validation. The various approaches that can be adopted to address these difficulties are discussed, followed by a survey of recent research initiatives.

The author concludes that many of the difficulties associated with the verification and validation of knowledge based systems are a feature of the complexity of the system being built and the manner of its development rather than of the specific technology chosen to implement it.

Ontologies are constantly evolving as new requirements daily occur and the modeling choices of the past should be updated or adapted. Exploring this evolution will enhance the understanding, augmenting the exploitation potential of the available ontologies. However, recent research focuses mostly on detecting changes between ontology versions, overloading end-users with hundreds or even thousands of changes between ontology versions, making it impossible to explore this evolution. To this direction, in this paper, we present EvoRDF, a novel framework for exploring ontology evolution using provenance queries. Our approach uses a high-level language of changes and effectively answers queries about when a specific resource was introduced and how—by which change operations. Even more, why queries can identify the sequence of changes that led to the creation of a specific resource in the latest ontology version or track the evolution of a specific resource from a past ontology version. The evaluation performed shows the feasibility of our solution and the great advantages gained.

New biomedical technologies enable the diagnosis of brain tumours by using non-invasive methods. HealthAgents is a European Union-funded research project that aims to build an agent-based distributed decision support system (dDSS) for the diagnosis of brain tumours. This is achieved using the latest biomedical knowledge, information and communication technologies and pattern recognition (PR) techniques. As part of the PR development of HealthAgents, an independent and automatic classification framework (CF) has been developed. This framework has been integrated with the HealthAgents dDSS using the HealthAgents agent platform. The system offers (1) the functionality to search for distributed classifiers to solve specific questions; (2) automatic classification of new cases; (3) instant deployment of new validated classifiers; and (4) the ability to rank a set of classifiers according to their performance and suitability for the case in hand. The CF enables both the deployment of new classifiers using the provided Extensible Markup Language1 classifier specification, and the inclusion of new PR techniques that make the system extensible. These features may enable the rapid integration of PR laboratory results into industrial or research applications, such as the HealthAgents dDSS. Two classification nodes have been deployed and they currently offer classification services by means of dedicated servers connected to the HealthAgents agent platform: one node being located at the Katholieke Universiteit Leuven, Belgium and the other at the Universidad Politécnica de Valencia, Spain. These classification nodes share the current set of brain tumour classifiers that have been trained from in vivo magnetic resonance spectroscopy data. The combination of the CF with a distributed agent system constitutes the basis of the brain tumour dDSS developed in HealthAgents.

Generalized planning studies the representation, computation and evaluation of solutions that are valid for multiple planning instances. These are topics studied since the early days of AI. However, in recent years, we are experiencing the appearance of novel formalisms to compactly represent generalized planning tasks, the solutions to these tasks (called generalized plans) and efficient algorithms to compute generalized plans. The paper reviews recent advances in generalized planning and relates them to existing planning formalisms, such as planning with domain control knowledge and approaches for planning under uncertainty, that also aim at generality.

Trust and reputation allow agents to make informed decisions about potential interactions. Trust in an agent is derived from direct experience with that agent, while reputation is determined by the experiences reported by other witness agents with potentially differing viewpoints. These experiences are typically aggregated in a trust and reputation model, of which there are several types that focus on different aspects. Such aspects include handling subjective perspectives of witnesses, dishonesty, or assessing the reputation of new agents. In this paper, we distil reputation systems into their fundamental aspects, discussing first how trust and reputation information is represented and second how it is disseminated among agents. Based on these discussions, a unifying abstraction is presented for trust and reputation systems, which is demonstrated by instantiating it with a broad range of reputation systems found in the literature. The abstraction is then instantiated to combine the range of capabilities of existing reputation systems in the Machine Learning Reputation System, which is evaluated using a marketplace simulation.

Although they flow from a common source, the uses of multi-agent systems (or ‘agent-based computational systems’––ACE) vary between the social sciences and computer science. The distinction can be broadly summarized as analysis versus synthesis, or explanation versus design. I compare and contrast these uses, and discuss sufficiency and necessity in simulations in general and in multi-agent systems in particular, with a computer science audience in mind.

In the coming years, the Web is expected to evolve from a structure containing information resources that have little or no explicit semantics to a structure having a rich semantic infrastructure. The key defining feature that is intended to distinguish the future Semantic Web from today's Web is that the content of the Web will be usable by machines (i.e. software agents). Meaning needs to be communicated between agents who advertise and/or require the ability to perform tasks on the Web. Agents also need to determine the meaning of passive (i.e. non-agent) information resources on the web to perform these tasks.

Case-based reasoning (CBR) is widely applicable to the diagnosis of problems and the identification of solutions to them. This review of the literature identifies key papers relating to this use of CBR. The stages in diagnosing and troubleshooting a problem are considered and the elements of a CBR system for achieving this are described. Five systems are discussed that have frequently been cited in the literature and illustrate the use of CBR in diagnosis and troubleshooting applications.

Networks encode dependencies between entities (people, computers, proteins) and allow us to study phenomena across social, technological, and biological domains. These networks naturally evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Despite the importance of modeling these dynamics, existing work in relational machine learning has ignored relational time series data. Relational time series learning lies at the intersection of traditional time series analysis and statistical relational learning, and bridges the gap between these two fundamentally important problems. This paper formulates the relational time series learning problem, and a general framework and taxonomy for representation discovery tasks of both nodes and links including predicting their existence, label, and weight (importance), as well as systematically constructing features. We also reinterpret the prediction task leading to the proposal of two important relational time series forecasting tasks consisting of (i) relational time series classification (predicts a future class or label of an entity), and (ii) relational time series regression (predicts a future real-valued attribute or weight). Relational time series models are designed to leverage both relational and temporal dependencies to minimize forecasting error for both relational time series classification and regression. Finally, we discuss challenges and open problems that remain to be addressed.

Two phenomena have probably affected modern data analysts' lives more than anything else. First, the size of real-world data sets is getting increasingly large, especially during the last decade or so. Second, modern computational methods and tools are being developed which add further capability to traditional statistical analysis tools. These two developments have created a new range of problems and challenges for analysts, as well as new opportunities for intelligent systems in data analysis.

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.

Agile software development (ASD) has emerged as a result of consolidated values proposed under the lightweight methods of software engineering. Despite bearing some criticisms, the initial deployment and results observed in the practice environment represents its increasing domination over the traditional software development practices. Any ASD method, in particular, requires knowledge-intensive practices and typically employs multi-disciplinary expert team working extended periods of time for weeks on a nearly continuous basis. A huge amount of tacit knowledge creation and exchange happens in the entire process over the project lifecycle, which attracts the attention of research in the domain of knowledge management (KM). In this paper, first, we have mapped the agile values and agile principles, and in its support, we have argued upon and the need for integrated KM infrastructure and proposed a KM model that can be employed within the organization. We have also developed a conceptual framework for knowledge sharing and learning for the individual practitioners for the sustainability of agile team. We attempt to create an organizational learning framework for knowledge creation and exchange among the involved entities in a collaborative practice environment.

Designing hierarchical reinforcement learning algorithms that exhibit safe behaviour is not only vital for practical applications but also facilitates a better understanding of an agent’s decisions. We tackle this problem in the options framework (Sutton, Precup & Singh, 1999), a particular way to specify temporally abstract actions which allow an agent to use sub-policies with start and end conditions. We consider a behaviour as safe that avoids regions of state space with high uncertainty in the outcomes of actions. We propose an optimization objective that learns safe options by encouraging the agent to visit states with higher behavioural consistency. The proposed objective results in a trade-off between maximizing the standard expected return and minimizing the effect of model uncertainty in the return. We propose a policy gradient algorithm to optimize the constrained objective function. We examine the quantitative and qualitative behaviours of the proposed approach in a tabular grid world, continuous-state puddle world, and three games from the Arcade Learning Environment: Ms. Pacman, Amidar, and Q*Bert. Our approach achieves a reduction in the variance of return, boosts performance in environments with intrinsic variability in the reward structure, and compares favourably both with primitive actions and with risk-neutral options.

In this paper we describe the framework we have developed in KIDS (Kestrel Interactive Development System) for generating efficient constraint satisfaction programs. We have used KIDS to synthesise global search scheduling programs that have proved to be dramatically faster than other programs running the same data. We focus on the underlying ideas that lead to this efficiency. The key to the efficiency is the reduction of the size of the search space by an effective representation of sets of possible solutions (solution spaces) that allows efficient constraint propagation and pruning at the level of solution spaces. Moving to a solution space representation involves a problem reformulation. Having found a solution to the reformulated problem, an extraction phase extracts solutions to the original problem. We show how constraints from the original problem can be automatically reformulated and specialised in order to derive efficient propagation code automatically. Our solution methods exploit the semi-lattice structure of our solution spaces.

Coordinating the actions of agents in multiagent systems presents a challenging problem, especially as the size of the system is increased and predicting the agent interactions becomes difficult. Many approaches to improving coordination within multiagent systems have been developed including organizational structures, shaped rewards, coordination graphs, heuristic methods, and learning automata. However, each of these approaches still have inherent limitations with respect to coordination and scalability. We explore the potential of synergistically combining existing coordination mechanisms such that they offset each others’ limitations. More specifically, we are interested in combining existing coordination mechanisms in order to achieve improved performance, increased scalability, and reduced coordination complexity in large multiagent systems.

In this work, we discuss and demonstrate the individual limitations of two well-known coordination mechanisms. We then provide a methodology for combining the two coordination mechanisms to offset their limitations and improve performance over either method individually. In particular, we combine shaped difference rewards and hierarchical organization in the Defect Combination Problem with up to 10 000 sensing agents. We show that combining hierarchical organization with difference rewards can improve both coordination and scalability by decreasing information overhead, structuring agent-to-agent connectivity and control flow, and improving the individual decision-making capabilities of agents. We show that by combining hierarchies and difference rewards, the information overheads and computational requirements of individual agents can be reduced by as much as 99% while simultaneously increasing the overall system performance. Additionally, we demonstrate the robustness of this approach to handling up to 25% agent failures under various conditions.