Ensuring that autonomous systems work ethically is both complex and difficult. However, the idea of having an additional ‘governor’ that assesses options the system has, and prunes them to select the most ethical choices is well understood. Recent work has produced such a governor consisting of a ‘consequence engine’ that assesses the likely future outcomes of actions then applies a Safety/Ethical logic to select actions. Although this is appealing, it is impossible to be certain that the most ethical options are actually taken. In this paper we extend and apply a well-known agent verification approach to our consequence engine, allowing us to verify the correctness of its ethical decision-making.

Many experts believe that in the coming decades, artificial intelligence will change, and perhaps significantly reduce, the demand for human labor in the economy, but there remains much uncertainty about the accuracy of this claim and what to do about it. This paper identifies several ways in which the artificial intelligence community can help society to anticipate and shape such outcomes in a socially beneficial direction. First, different technical aspirations for the field of AI may be associated with different social outcomes, increasing the stakes of decisions made in the AI community. Second, the extent of researchers' efforts to apply AI to different social and economic domains will influence the distribution of cognition between humans and machines in those domains. Third, the AI community can play a key role in initiating a more nuanced and inclusive public discussion of the social and economic possibilities afforded by AI technologies. To pave the way for such dialogue, we suggest a line of research aimed at better understanding the nature, pace, and drivers of progress in AI in order to more effectively anticipate and shape AI's role in society.

The cultural and political implications of modern AI research are not some far off concern, they are things that affect the world in the here and now. From advanced control systems with advanced visualizations and image processing techniques that drive the machines of the modern military to the slow creep of a mechanized workforce, ethical questions surround us. Part of dealing with these ethical questions is not just speculating on what could be but teaching our students how to engage with these ethical questions. We explore the use of science fiction as an appropriate tool to enable AI researchers to help engage students and the public on the current state and potential impacts of AI.

We analyze the results of assistance to individuals with autism in reasoning about mental world. This assistance is provided by a natural language multiagent simulator of mental states, NL_MAMS (Galitsky 2013b). It assists in the tasks which are the hardest for autistic reasoning: operating with mental states and actions. Autistic patients are trained to perform a number of reasoning exercises. We conduct both short term and long term evaluations including the behavior in real world and confirm that the system has a positive effect on their rehabilitation.

This paper focuses on a preliminary experimental protocol that aims at assessing a robot operator’s behavior when the robot is equipped with what appears as moral decision capabilities. The protocol is derived from the trolley dilemma, a well-known decision making paradigm. Indeed the participants, acting as operators of simulated aerial robots via a computer screen, are faced to impersonal moral dilemmas, i.e. decide to crash a damaged robot on one of two inhabited areas, and to non-moral choices, i.e. decide to crash a damaged robot on one of two uninhabited areas. In each situation, the robot has a default crash behavior which is displayed to the participant who will have to decide whether to follow it or not. The participants are equipped with fNIRS and eye-tracking and answer a post-experimental questionnaire. As some of the behavioral and physiological results do not match the hypotheses we had set, we give the features of the further experiments that we are planning.

An important aspect of health science is communicating research findings to the public. The media is a critical instrument in disseminating research. Yet the process by which a scientific article becomes “newsworthy” is not well understood. In this study, we use large-scale text analysis to characterize the content features of articles that are predictive of newsworthiness. We experiment with two novel corpora: (i) 28,910 articles from a di- verse range of biomedical and health journals, of which 1,343 were covered by the news agency Reuters, and (ii) 10,760 articles from the JAMA journals, of which 846 were given press releases by the journal editors. We show that media coverage can be predicted reasonably well: logistic regression achieves mean AUCs of 0.783 and 0.882 on the Reuters and JAMA datasets, respec- tively. We present and discuss interesting findings con- cerning the most predictive content features.

Systems biology, the study of the intricate, ramified, com-plex and interacting mechanisms underlying life, often proves too complex for unaided human understanding, even by groups of people working together. This difficulty is ex-acerbated by the high volume of publications in molecular biology. The Big C (‘C’ for Cyc) is a system designed to (semi-)automatically acquire, integrate, and use complex mechanism models, specifically related to cancer biology, via automated reading and a hyper-detailed refinement pro-cess resting on Cyc’s logical representations and powerful inference mechanisms. We aim to assist cancer research and treatment by achieving elements of biologist-level reason-ing, but with the scale and attention to detail that only com-puter implementations can provide.

Among the languages used for representing goals, actions and their consequences on the world for decision making and planning, GDL (Game Description Language) has the ability to represent complex actions in potentially uncertain and competitive environments. The aim of this paper is to exploit stochastic constraint networks in order to provide compact representations of strategic games, and to identify optimal policies in those games with generic forward checking method. From this perspective, we develop a compiler allowing to translate games, described in GDL, into instances of the Stochastic Constraint Optimization Problem (SCSP). Our compiler is proved correct for the class GDL of games with complete information and oblivious environment. The interest of our approach is illustrated by solving several GDL games with a SCSP solver.

The paper explores the potential of weighted best-first search schemes as anytime optimization algorithms for solving graphical models tasks such as MPE (Most Probable Explanation) or MAP (Maximum a Posteriori) and WCSP (Weighted Constraint Satisfaction Problem). While such schemes were widely investigated for path-finding tasks, their application for graphical models was largely ignored, possibly due to their memory requirements. Compared to the depth-first branch and bound, which has long been the algorithm of choice for optimization in graphical models, a valuable virtue of weighted best-first search is that they are w-optimal, i.e. when terminated, they return a solution cost C and a weight w, such that C < = wC*, where C* is the optimal cost. We report on a significant empirical evaluation, demonstrating the usefulness of weighted best-first search as approximation anytime schemes (that have suboptimality bounds) and compare against one of the best depth-first branch and bound solver to date. We also investigate the impact of different heuristic functions on the behaviour of the algorithms.

In this paper we consider a scenario where one or more robotic bodyguards are protecting an important individual (VIP) moving in a public space against harassment or harm from unarmed civilians. In this scenario, the main objective of the robots is to position themselves such that at any given moment they provide maximum physical cover for the VIP. The robots need to follow the VIP in its movement and take into account the movements of the civilians as well. The environment can also contain obstacles which present challenges to movement but also provide natural cover. We designed two algorithms for the movement of the bodyguard robots: Threat Vector Resolution (TVR) for a single robot and Quadrant Load Balancing (QLB) for teams of bodyguard robots. We evaluated the proposed approaches against rigid formations in a simulation study.