This paper describes an investigation that compared Context-based Reasoning (CxBR) and Contextual Graphs (CxG), two well-known context-driven approaches used to represent human intelligence and decision-making. The specific objective of this investigation was to compare and contrast both approaches to increase the readers’ understanding of each approach. We also identify which, if any, excels in a particular area, and to look for potential synergism between them. This comparison is presented according to 10 different criteria, with some indication of which one excels at each particular facet of performance. We focus the comparison on how each would represent human tactical behavior, either in a simulation or in the real world. Conceptually, these two context-driven approaches are not at the same representational level. This could provide an opportunity in the future to combine them synergistically.

Usability and usefulness have made the spreadsheet one of the most successful computing applications of all times: millions rely on it every day for anything from typing grocery lists to developing multimillion-dollar budgets. One thing spreadsheets are not very good at is manipulating the symbolic data and helping users make decisions based on them. By tapping into recent research in Logic Programming, Databases and Cognitive Psychology, we propose a deductive extension to the spreadsheet paradigm that precisely addresses this issue. The accompanying tool, which we call NEXCEL, is intended as an automated assistant for the daily reasoning and decision-making needs of computer users, in the same way as a spreadsheet application such as Microsoft Excel assists them every day with simple and complex calculations. Users without formal training in Logic or even Computer Science can interactively define logical rules in the same simple way as they define formulas in Excel. NEXCEL immediately evaluates these rules, thereby returning lists of values that satisfy them, again just like with numerical formulas. The deductive component is seamlessly integrated into the traditional spreadsheet so that a user not only still has access to the usual functionalities but is also able to use them as part of the logical inference and, dually, to embed deductive steps in a numerical calculation.

The KEML (Knowledge Engineering Methods and Languages) workshop which took place on 22–24 January at the Open University in Milton Keynes (UK) was the seventh in a series of workshops on methods and languages for knowledge engineering. Although t he KEML acronym suggests a broad knowledge engineering connotation, in practice the main emphasis of these workshops is on the construction, formalisation, verification and use of knowledge models. The term “knowledge model” originate s from the work of Allen Newell (1982), who proposed a level of description — the knowledge level — which abstracts from implementation-related considerations to focus on the actions, goals and knowledge embodied by a problem solving agent.

The extraction and processing of temporal expressions (TEs) in textual documents have been extensively studied in several domains; however, for the legal domain it remains an open challenge. This is possibly due to the scarcity of corpora in the domain and the particularities found in legal documents that are highlighted in this paper. Considering the pivotal role played by temporal information when it comes to analyzing legal cases, this paper presents TempCourt, a corpus of 30 legal documents from the European Court of Human Rights, the European Court of Justice, and the United States Supreme Court with manually annotated TEs. The corpus contains two different temporal annotation sets that adhere to the TimeML standard, the first one capturing all TEs and the second dedicated to TEs that are relevant for the case under judgment (thus excluding dates of previous court decisions). The proposed gold standards are subsequently used to compare ten state-of-the-art cross-domain temporal taggers, and to identify not only the limitations of cross-domain temporal taggers but also limitations of the TimeML standard when applied to legal documents. Finally, the paper identifies the need for dedicated resources and the adaptation of existing tools, and specific annotation guidelines that can be adapted to different types of legal documents.

In this paper I tackle the question of what basic form an analytical method for articulating and ultimately assessing visual representations should take. I start from the assumption that scientific images, being less prone to interpretive complication than artworks, are ideal objects from which to engage this question. I then assess a recent application of Nelson Goodman's aesthetics to the project of parsing scientific images, Laura Perini's ‘The truth in pictures’. I argue that, although her project is an important one, her Goodmanian conventionalism produces a method of analysis that is incapable of adequately parsing a certain class of pictures and her focus on truth is unnecessary. This speaks against the promise of Goodman's analytical strategy for elucidating visual content and reasoning in the sciences and elsewhere. As an alternative, I develop John Willats’ analytical method and compare it to Perini's through engaging three of her examples—a chemical diagram, a graph and an electron micrograph. Ultimately, a space remains open for a mixed system where Willats’ account provides pictorial analysis and the Goodman–Perini approach parses visual languages.

Folksonomy gives liberty to its users to freely assign chosen keywords as tags, and this is the main reason behind its popularity. Apart from freedom, this system also reflects the collective intelligence of the crowd. However, this freedom and liberty can degrade quality of the folksonomy. It is required that quality of the folksonomy must remain consistently excellent and does not degrade with the passage of time. This is a survey paper, in which we present a brief survey of the research efforts intended to maintain a quality-protected folksonomy. We have organized our paper by looking at the problem from four aspects namely selection of quality tags, tag management features provided by folksonomy applications, folksonomy cleaning and interoperability of tags across platforms. We conclude our review with some of the interesting research topics, which need to be explored further. Our conclusion will be relevant and beneficial for engineers and designers who aim to design and maintain a quality-protected folksonomy.

Magnetic resonance spectroscopy (MRS) is a non-invasive method, which can provide diagnostic information on children with brain tumours. The technique has not been widely used in clinical practice, partly because of the difficulty of developing robust classifiers from small patient numbers and the challenge of providing decision support systems (DSSs) acceptable to clinicians. This paper describes a participatory design approach in the development of an interactive clinical user interface, as part of a distributed DSS for the diagnosis and prognosis of brain tumours. In particular, we consider the clinical need and context of developing interactive elements for an interface that facilitates the classification of childhood brain tumours, for diagnostic purposes, as part of the HealthAgents European Union project. Previous MRS-based DSS tools have required little input from the clinician user and a raw spectrum is essentially processed to provide a diagnosis sometimes with an estimate of error. In childhood brain tumour diagnosis where there are small numbers of cases and a large number of potential diagnoses, this approach becomes intractable. The involvement of clinicians directly in the designing of the DSS for brain tumour diagnosis from MRS led to an alternative approach with the creation of a flexible DSS that, allows the clinician to input prior information to create the most relevant differential diagnosis for the DSS. This approach mirrors that which is currently taken by clinicians and removes many sources of potential error. The validity of this strategy was confirmed for a small cohort of children with cerebellar tumours by combining two diagnostic types, pilocytic astrocytomas (11 cases) and ependymomas (four cases) into a class of glial tumours which then had similar numbers to the other diagnostic type, medulloblastomas (18 cases). Principal component analysis followed by linear discriminant analysis on magnetic resonance spectral data gave a classification accuracy of 91% for a three-class classifier and 94% for a two-class classifier using a leave-one-out analysis. This DSS provides a flexible method for the clinician to use MRS for brain tumour diagnosis in children.

Reward shaping has been shown to significantly improve an agent’s performance in reinforcement learning. Plan-based reward shaping is a successful approach in which a STRIPS plan is used in order to guide the agent to the optimal behaviour. However, if the provided knowledge is wrong, it has been shown the agent will take longer to learn the optimal policy. Previously, in some cases, it was better to ignore all prior knowledge despite it only being partially incorrect.

This paper introduces a novel use of knowledge revision to overcome incorrect domain knowledge when provided to an agent receiving plan-based reward shaping. Empirical results show that an agent using this method can outperform the previous agent receiving plan-based reward shaping without knowledge revision.

An overview of research in the areas of aerospace applications of artificial intelligence, expert Systems, neural networks and robotics is presented. Challenges associated with aerospace projects require increasingly complex aerospace Systems which in turn demand automation and fault tolerance. We have addressed these issues and provided a survey of the research on intelligent Systems that has been carried out in an attempt to meet these challenges. The application areas we have overviewed include fault monitoring and diagnosis, generation and management of power in space, efficient and effective command and control, operations and maintenance of space stations, planning and scheduling, automation, and cockpit management.

With the growing demand of freight transport by means of container vessels as well as the important competition among terminals, managers and stakeholders seek to improve the exploitation of the container terminal resources efficiently. In this context, arises the Berth Allocation Problem, which aims to allocate and schedule incoming vessels along the quay. Its appropriate solution plays a relevant role in enhancing the terminal productivity. Thus, for addressing this problem, we propose a cooperative search, where the individuals are organized into groups and each member shares information with its group partners. This grouping strategy allows to diversify as well as intensify the search in some regions by means of information shared among the individuals of each group. The computational experiments for this problem reveal that our approach reports high-quality solutions and identifies promising regions within the search space in short computational times.

This study presents the algorithm for a humanoid robot to accomplish an obstacle run in the FIRA HuroCup competition. It includes the integration of image processing and robot motion. DARwIn-OP (Dynamic Anthropomorphic Robot with Intelligence–Open Platform) was used as the humanoid robot, and it is equipped with a webcam as a vision system to obtain an image of what is in front of the robot. Image processing skills such as erosion, dilation, and eight-connected component labeling are applied to reduce image noise. Moreover, we use navigation grids with filters to avoid the obstacles. Fuzzy logic rules are used to implement the robot’s motion, allowing a humanoid robot to access any routes using obstacle avoidance to perform the tasks in the obstacle-run event.

Robot Interaction has always been a challenge in collaborative robotics. In tasks comprising Inter-Robot Interaction, robot detection is very often needed. We explore humanoid robots detection because, humanoid robots can be useful in many scenarios, and everything from helping elderly people live in their own homes to responding to disasters. Cameras are chosen because they are reach and cheap sensors, and there are lots of mature two-dimensional (2D) and 3D computer vision libraries which facilitate Image analysis. To tackle humanoid robot detection effectively, we collected a data set of various humanoid robots with different sizes in different environments. Afterward, we tested the well-known cascade classifier in combination with several image descriptors like Histograms of Oriented Gradients (HOG), Local Binary Patterns (LBP), etc. on this data set. Among the feature sets, Haar-like has the highest accuracy, LBP the highest recall, and HOG the highest precision. Considering Inter-Robot Interaction, it is evident that false positives are less troublesome than false negatives, thus LBP is more useful than the others.

We study the limit behavior and performance of no-regret dynamics in general game theoretic settings. We design protocols that achieve both good regret and equilibration guarantees in general games. We also establish a strong equivalence between them and coarse correlated equilibria (CCE). We examine structured game settings where stronger properties can be established for no-regret dynamics and CCE. In congestion games with non-atomic agents (each contributing a fraction of the flow), as we decrease the individual flow of agents, CCE become closely concentrated around the unique equilibrium flow of the non-atomic game. Moreover, we compare best/worst case no-regret learning behavior to best/worst case Nash equilibrium (NE) in small games. We prove analytical bounds on these inefficiency ratios for 2×2 games and unboundedness for larger games. Experimentally, we sample normal form games and compute their measures of inefficiency. We show that the ratio distribution has sharp decay, in the sense that most generated games have small ratios. They also exhibit strong anti-correlation between each other, that is games with large improvements from the best NE to the best CCE present small degradation from the worst NE to the worst CCE.

There is an increasing trend in moving desktop applications to web browsers, even when the web server is running on the same desktop machine. In this paper, we go further in this direction and show how to combine a web server, a web application framework (enhanced to support desktop-like Model–View–Controller interaction) and a context-aware architecture to develop web-based mobile context-aware applications. By using this approach we take advantage of the well-established web paradigm to design the graphical user interfaces (GUIs) and the inherent ability of the web to mash up applications with external components (such as Google Maps). On top of that, since the web server runs on the device itself, the application can access local resources (such as disk space or sensing devices, which are indispensable for context-aware systems) avoiding the sandbox model of the web browsers. To illustrate our approach we show how a mobile hypermedia system has been built on top of our platform.

Cognitive emulation is an expert System design strategy which attempts to model System performance on human (expert) thinking. Arguments for and against cognitive emulation are reviewed. A major conclusion is that a significant degree of cognitive emulation is an inherent feature of design, but that an unselective application of the strategy is both unrealistic and undesirable. Pragmatic considerations which limit or facilitate the viability of a cognitive emulation approach are discussed. Particular attention is given to the conflict between cognitive emulation and established knowledge engineering objectives, detailed over 12 typical expert System features. The paper suggests circum-stances in which a strategy of cognitive emulation is useful.

This report is the result of a panel discussion at the Second UK Workshop on Foundations of Multi-Agent Systems (FOMAS'97). All members of the panel are authors, listed alphabetically.

Radio-Frequency Identification (RFID) system technology is a key element for the realization of the Industry 4.0 vision, as it is vital for tasks such as entity tracking, identification and asset management. However, the plethora of RFID systems’ elements in combination with the wide range of factors that need to be taken under consideration along with the interrelations amongst them, make the problem of identification and design of the right RFID system, based on users’ needs particularly complex. The research outlined in this paper seeks to optimize this process by developing an integrating schema that will encapsulate this information in a form that is both human and machine processible. Human readability will allow a shared understanding of the RFID technology domain; machine readability, automated reasoning engines to perform logical deduction techniques returning implicit information. For this purpose, the novel RFID System Configuration Ontology (RFID SCO) is developed. Hence, non-RFID experts are enabled to identify the most suitable RFID system according to their needs and RFID experts to retrieve all the relevant information required for the efficient design of the corresponding RFID system. The RFID SCO is validated and tested successfully against real-world scenarios provided by domain experts.

In order to enable robots to interact with humans in a natural way, they need to be able to autonomously learn new tasks. The most natural way for humans to tell another agent, which can be a human or robot, to perform a task is via natural language. Thus, natural human–robot interactions also require robots to understand natural language, i.e. extract the meaning of words and phrases. To do this, words and phrases need to be linked to their corresponding percepts through grounding. Afterward, agents can learn the optimal micro-action patterns to reach the goal states of the desired tasks. Most previous studies investigated only learning of actions or grounding of words, but not both. Additionally, they often used only a small set of tasks as well as very short and unnaturally simplified utterances. In this paper, we introduce a framework that uses reinforcement learning to learn actions for several tasks and cross-situational learning to ground actions, object shapes and colors, and prepositions. The proposed framework is evaluated through a simulated interaction experiment between a human tutor and a robot. The results show that the employed framework can be used for both action learning and grounding.

The Simple Temporal Network (STN) is a widely used framework for reasoning about quantitative temporal constraints over variables with continuous or discrete domains. The inference tasks of determining consistency and deriving the minimal network are traditionally achieved by graph algorithms (e.g. Floyd-Warshall, Johnson) or by iteration of narrowing operators (e.g. ΔSTP). None of these methods exploits effectively the tree-decomposition structure of the constraint graph of an STN. Methods based on variable elimination (e.g. adaptive consistency) can exploit this structure, but have not been applied to STNs as far as they could, in part because it is unclear how to efficiently pass the ‘messages’ over continuous domains. We show that for an STN, these messages can be represented compactly as sub-STNs. We then present an efficient message-passing scheme for computing the minimal constraints of an STN. Analysis of this algorithm, Prop-STP, brings formal explanation of the performance of the existing STN solvers ΔSTP and SR-PC. Empirical results validate the efficiency of Prop-STP, demonstrating performance comparable to ΔSTP, in cases where the constraint graph is known to have small tree width, such as those that arise during Hierarchical Task Network planning.

There is an implicit assumption in machine learning techniques that each new task has no relation to the tasks previously learned. Therefore, tasks are often addressed independently. However, in some domains, particularly reinforcement learning (RL), this assumption is often incorrect because tasks in the same or similar domain tend to be related. In other words, even though tasks are quite different in their specifics, they may have general similarities, such as shared skills, making them related. In this paper, a novel domain adaptation-based method using adversarial networks is proposed to do transfer learning in RL problems. Our proposed method incorporates skills previously learned from source task to speed up learning on a new target task by providing generalization not only within a task but also across different, but related tasks. The experimental results indicate the effectiveness of our method in dealing with RL problems.