The development of hand-crafted action and dialog generation models for a social robot is a time consuming process that yields a solution only for the relatively narrow range of interactions envisioned by the programmers. In this paper, we propose a data-driven solution for interactive behavior generation that leverages online games as a means of collecting large-scale data corpora for human-robot interaction research. We present a system in which action and dialog models for a collaborative human-robot task are learned based on a reproduction of the task in a two-player online game called Mars Escape.

Today millions of web-users express their opinions about many topics through blogs, wikis, fora, chats and social networks. For sectors such as e-commerce and e-tourism, it is very useful to automatically analyze the huge amount of social information available on the Web, but the extremely unstructured nature of these contents makes it a difficult task. SenticNet is a publicly available resource for opinion mining built exploiting AI and Semantic Web techniques. It uses dimensionality reduction to infer the polarity of common sense concepts and hence provide a public resource for mining opinions from natural language text at a semantic, rather than just syntactic, level.

This position paper presents an approach to computational narrative based in cognitive linguistics and sociolinguistics accounts of conceptual blending, metaphor, and narrative, multimedia semantics, human-centered interface design, and digital media art practice. In particular, as a case study, we describe the Living Liberia Fabric, an AI-based interactive narrative system developed in affiliation with the Truth and Reconciliation Commission (TRC) of Liberia to memorialize a fourteen-year civil war. The Living Liberia Fabric project is led by Fox Harrell and executed in the Imagination, Computation, and Expression (ICE) Laboratory at Georgia Tech. The system exemplifies a cultural computing approach (grounding computing practices in a wider range of specific cultural traditions and values than those that are privileged in computer science).

When we are confronted with unexpected situations, we deal of background knowledge and special-purpose reasoners to with them by falling back on our general knowledge or making support general inference. Recent advances in text mining, analogies to other things we know. When software applications crowdsourcing, and professional knowledge engineering efforts fail, on the other hand, they often do so in brittle have finally led to commonsense knowledge bases of and unfriendly ways. At the same time, new application colleagues grappling with representation and reasoning, to domains are giving fresh insights into desiderata for common Doug Lenat, Push Singh, and Lenhart Schubert conducting sense reasoners and guidance for knowledge collection large scale engineering projects to construct collections efforts.

Narratives are ubiquitous in human experience. We use them - What comprises the set of possible narrative arcs? Is there to educate, communicate, convince, explain, and entertain. How many possible story lines are there? Is As far as we know, every society in the world has narratives, there a recipe (à la Joseph Campbell or Vladimir Propp) which suggests they are rooted in our psychology and serve for generating narratives? an important cognitive function: that narratives do something - What are the appropriate representations of narrative?

In order to cooperate effectively with human players, characters need to infer the tasks players are pursuing and select contextually appropriate responses. This process of parsing a serial input stream of observations to infer a hierarchical task structure is much like the process of compiling source code. We draw an analogy between compiling source code and compiling behavior, and propose modeling the cognitive system of a character as a compiler, which tokenizes observations and infers a hierarchical task structure. An evaluation comparing automatically compiled behavior to human annotation demonstrates the potential for this approach to enable AI characters to understand the behavior and infer the tasks of human partners.

Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan a different potential action for each future observation can be prohibitively expensive when planning many steps ahead. An efficient solution for planning far into the future in fully observable domains is to use temporally-extended sequences of actions, or "macro-actions." In this paper, we present a POMDP algorithm for planning under uncertainty with macro-actions (PUMA) that automatically constructs and evaluates open-loop macro-actions within forward-search planning, where the planner branches on observations only at the end of each macro-action. Additionally, we show how to incrementally refine the plan over time, resulting in an anytime algorithm that provably converges to an epsilon-optimal policy. In experiments on several large POMDP problems which require a long horizon lookahead, PUMA outperforms existing state-of-the art solvers.

Diffusion processes taking place in social networks are used to model a number of phenomena, such as the spread of human or computer viruses, and the adoption of products in viral marketing campaigns. It is generally difficult to obtain accurate information about how such spreads actually occur, so a variety of stochastic diffusion models are used to simulate spreading processes in networks instead. We show that a canonical genetic algorithm with a spatially distributed population, when paired with specific forms of Holland's synthetic hyperplane-defined objective functions, can simulate a large and rich class of diffusion models for social networks. These include standard diffusion models, such as the Independent Cascade and Competing Processes models. In addition, our Genetic Algorithm Diffusion Model (GADM) can also model complex phenomena such as information diffusion. We demonstrate an application of the GADM to modeling information flow in a large, dynamic social network derived from e-mail headers.

Constructing models of mobile agents can be difficult without domain-specific knowledge. Parametric models flexible enough to capture all mobility patterns that an expert believes are possible are often large, requiring a great deal of training data. In contrast, nonparametric models are extremely flexible and can generalize well with relatively little training data. We propose modeling the mobility patterns of moving agents as a mixture of Gaussian processes (GP) with a Dirichlet process (DP) prior over mixture weights. The GP provides a flexible representation for each individual mobility pattern, while the DP assigns observed trajectories to particular mobility patterns. Both the GPs and the DP adjust the model's complexity based on available data, implicitly avoiding issues of over-fitting or under-fitting. We apply our model to a helicopter-based tracking task, where the mobility patterns of the tracked agents — cars — are learned from real data collected from taxis in the greater Boston area.

Much has been achieved in the field of AI, yet much remains Gibbs sampling code in C/C . Chechetka et al. investigate relational learning for collective classification of entities to be done if we are to reach the goals we all imagine. in images. Choi et al. present a lifted inference One of the key challenges with moving ahead is closing approach for relational continuous models. Logical AI has Gogate and Domingos shows how to exploit logical structure mainly focused on complex representations, and statistical in lifted probabilistic inference. Hadiji et al. discuss AI on uncertainty.