Time is one of the most relevant topics in AI. It plays a major role in several of AI research areas, ranging from logical foundations to applications of knowledge-based systems. Despite the ubiquity of time in AI, researchers tend to specialise and focus on time in particular contexts or applications, overlooking meaningful connections between different areas. In an attempt to promote crossfertilisation and reduce isolation, the Temporal Representation and Reasoning (TIME) workshop series was started in 1994. The third edition of the workshop was held on May 19–20 1996 in Key West, FL, with S. D. Goodwin and H. J. Hamilton as General Chairs, and L. Chittaro and A. Montanari as Program Chairs. A particular emphasis was given to the foundational aspects of temporal representation and reasoning through an investigation of the relationships between different approaches to temporal issues in AI, computer science and logic.

This work provides a general overview of the statistical machine translation (SMT) scientific field, which is a subfield of machine translation (MT). Specifically, this paper focuses on one of the most popular SMT approaches, that is, the phrase-based system.

The phrase-based translation units are typically extracted using statistical criteria, and they are weighted using different models. These models are log-linearly combined in the decoding, which is in charge of choosing the most probable translation. Significant quality improvements have been produced from original phrase-based SMT systems. Among others, the main challenges are reordering, domain adaptation and evaluation.

Multi-agent systems have been widely used in the literature, including for the monitoring of distributed systems. However, one of the unresolved issues in this technology remains in the reassignment of the responsibilities of monitoring agents when some of them become unable to meet their obligations. This paper proposes a new approach for solving this problem based on (a) the gathering of evidence on whether the agent can or cannot fulfil the tasks it has been assigned and (b) the reassignment of the task to alternative agents using their trust level as a selection parameter. A weather station case study is proposed as an instantiation of the proposed model.

Statistical machine translation (SMT) is gaining interest given that it can easily be adapted to any pair of languages. One of the main challenges in SMT is domain adaptation because the performance in translation drops when testing conditions deviate from training conditions. Many research works are arising to face this challenge. Research is focused on trying to exploit all kinds of material, if available. This paper provides an overview of research, which copes with the domain adaptation challenge in SMT.

Recently, valuable knowledge that can be retrieved from a huge volume of datasets (called Big Data) set in motion the development of frameworks to process data based on parallel and distributed computing, including Apache Hadoop, Facebook Corona, and Microsoft Dryad. Apache Hadoop is an open source implementation of Google MapReduce that attracted strong attention from the research community both in academia and industry. Hadoop MapReduce scheduling algorithms play a critical role in the management of large commodity clusters, controlling QoS requirements by supervising users, jobs, and tasks execution. Hadoop MapReduce comprises three schedulers: FIFO, Fair, and Capacity. However, the research community has developed new optimizations to consider advances and dynamic changes in hardware and operating environments. Numerous efforts have been made in the literature to address issues of network congestion, straggling, data locality, heterogeneity, resource under-utilization, and skew mitigation in Hadoop scheduling. Recently, the volume of research published in journals and conferences about Hadoop scheduling has consistently increased, which makes it difficult for researchers to grasp the overall view of research and areas that require further investigation. A scientific literature review has been conducted in this study to assess preceding research contributions to the Apache Hadoop scheduling mechanism. We classify and quantify the main issues addressed in the literature based on their jargon and areas addressed. Moreover, we explain and discuss the various challenges and open issue aspects in Hadoop scheduling optimizations.

Advancements in software agents and Semantic Web service technologies are generally enhancing the landscape of electronic commerce. Semantic Web service technologies promise the standardisation and discoverability of software capabilities for network-enabled organisations. Moreover, with the addition of the intelligence and autonomy of software agents, transactions may be equally automated for consumer-to-consumer, business-to-consumer, and business-to-business collaborations. The 2003 Workshop on Electronic Commerce, Agents, and Semantic Web Services was held in conjunction with the International Conference on Electronic Commerce (ICEC2003). The purpose of this workshop was to bring together researchers and practitioners in the areas of electronic commerce, agents, and Semantic Web services to discuss the state-of-art in each individual area in addition to the synergies among the areas. This paper contains a summary of the workshop presentations and a discussion of next steps for Semantic Web services created in the working sessions concluding the workshop.

In theories and models of computational intelligence, cognition and action have historically been investigated on separate grounds. We conjecture that the main mechanism of case-based reasoning (CBR) applies to cognitive tasks at various levels and of various granularity, and hence can represent a bridge—or a continuum—between the higher and lower levels of cognition. CBR is an artificial intelligence (AI) method that draws upon the idea of solving a new problem reusing similar past experiences. In this paper, we re-formulate the notion of CBR to highlight the commonalities between higher-level cognitive tasks such as diagnosis, and lower-level control such as voluntary movements of an arm. In this view, CBR is envisaged as a generic process independent from the content and the detailed format of cases. Diagnostic cases and internal representations underlying motor control constitute two instantiations of the case representation. In order to claim such a generic mechanism, the account of CBR needs to be revised so that its position in non-symbolic AI becomes clearer. The paper reviews the CBR literature that targets lower levels of cognition to show how CBR may be considered as a step toward bridging the gap between symbolic and non-symbolic AI.

RANTANPLAN is a numeric planning solver that takes advantage of recent advances in satisfiability modulo theories. It extends reduction to SAT approaches with an easy and efficient handling of numeric fluents using background theories. In this paper, we describe the design choices and features of RANTANPLAN, especially, how numeric reasoning is integrated in the system. We also provide experimental results showing that RANTANPLAN is competitive with existing exact numeric planners.

This paper presents a survey of machine induction, studied mainly from the field of artificial intelligence, but also from the fields of pattern recognition and cognitive psychology. The paper consists of two parts: Part I discusses the basic principles and features of the machine induction process; Part II uses these principles and features to review and criticize the major supervised attribute-based induction methods. Attribute-based induction has been chosen because it is the most commonly used inductive approach in the development of expert systems and pattern recognition models.

Expert systems are being built despite the widely acknowledged problem of acquiring knowledge from experts. This study attempts to understand how knowledge acquisition is conducted in practice by investigating three expert system development projects. A CASE research methodology is adopted, and data is collected through unobtrusive observation, from taped protocols of knowledge acquisition sessions, retrospective interviews with the participants involved, and deliverables produced. The variables examined include the problem domain, the domain expert, the knowledge engineer, the knowledge acquisition process, the expert system construction process, potential users, organizational setting, and the expert system itself. The knowledge acquisition processes for three expert systems in the domains of law of negligence, telephone line fault diagnosis, and wastewater treatment have been examined. By juxtaposing the observations drawn with findings from the relevant literature, the study makes prescriptive suggestions on considerations and techniques for future acquisition efforts, and provides data for hypothesis generation in further research.

This paper describes some of our experience gathered during the development of an expert system, the press lineup advisor, in which we used the commercially available expert system development tool, S.1.™ Discussion includes: (1) how we used S. l to develop a system which solves a configuration problem; (2) difficulties we encountered when applying S.1 to this specific reasoning problem; (3) limitations of S.1 from both problem-solving and operational points of view and (4) issues remaining to be solved with respect to generalization of the system.

Knowledge-based System (KBS) technologies have been applied to a variety of knowledge-related tasks with varying degrees of success. Differentiating among classes of knowledge-related tasks, based on the amounts of problem-solving knowledge and case-specific data involved, can provide valuable insight into why this occurs. Based on this comparison, four classes of problems are described. One class, of data-intensive tasks, includes problem types that are difficult or impossible for humans to perform, yet may be solved in a cost-effective manner using currently accessible KBS technology. The characteristic features of problems in this class are given, together with an example of a successfully fielded knowledge-based system that solves a problem from this class.

Maths programming (MP) and constraint programming (CP) are two techniques that are able to solve difficult industrial optimisation problems. The purpose of this paper is to compare them from an algorithmic and a modelling point of view. Algorithmic principles of each approach are described and contrasted. Some ways of combining both techniques are also introduced.

This paper presents our sketch drawing artist humanoid robot research. One of the limitations of the existing artist humanoid robot is the lack of feedback on the error that occurs during the drawing process. The contribution of this research is the development of a humanoid robot artist with drawing error correction capability. Based on our previous work with open-loop control pen-and-ink humanoid robot artist, we have implemented a closed-loop visual servoing approach to address this problem. Our experimental results show that this approach is sufficient to correct drawing errors that occur due to mechanical limitation of a robot.

This paper integrates the responses to a set of questions from a distinguished set of panelists involved in a discussion at the Agreement Technologies workshop in Cyprus in December 2009. The panel was concerned with the relationship between the research areas of semantics, norms, and organizations, and the ways in which each may contribute to the development of the others in support of next generation agreement technologies.

Unmanned Aerial Vehicles (UAV) represent a major advantage in defense, disaster relief and first responder applications. UAV may provide valuable information on the environment if their Command and Control (C2) is shared by different operators. In a C2 networking system, any operator may request and use the UAV to perform a remote sensing operation. These requests have to be scheduled in time and a consistent navigation plan must be defined for the UAV. Moreover, maximizing UAV utilization is a key challenge for user acceptance and operational efficiency. The global planning problem is constrained by the environment, targets to observe, user availability, mission duration and on-board resources. This problem follows previous research works on automatic mission Planning & Scheduling for defense applications. The paper presents a full constraint-based approach to simultaneously satisfy observation requests, and resolve navigation plans.

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 circumstances in which a strategy of cognitive emulation is useful.

This paper describes the interfacing problem that arose in a Product Formulation expert system written in LISP that had to be interfaced to data in a relational database running on a separate mainframe computer. It surveys the different forms of coupling that are possible and emphasizes the advantages of tight navigational coupling over the more popular set-based coupling. It describes how Prolog was used to overcome the interfacing problems and to provide a customized front end to an end user, based on a navigational interface. It reviews the techniques of using Prolog and the likely obstacles, together with a look forward to databases using Frames or Objects.