Real-time Strategy (RTS) games are complex domains which are a significant challenge to both human and artificial intelligence (AI). For that reason, and although many AI approaches have been proposed for the RTS game AI problem, the AI of all commercial RTS games is scripted and offers a very static behavior subject to exploits. In this paper, we will focus on a case-based reasoning (CBR) approach to this problem, and concentrate on the process of case-acquisition. Specifically, we will describe 7 different techniques to automatically acquire plans by observing human demonstrations and compare their performance when using them in the Darmok 2 system in the context of an RTS game.

Conversational case-based reasoning systems use an interactive dialog to retrieve stored cases. Normally the ordering of questions in this dialog is chosen based only on their discriminativeness. However, because the user may not be able to answer all questions, even highly discriminative questions are not guaranteed to provide information. This paper presents a customization method CCBR systems can apply to adjust entropy-based discriminativeness considerations by predictions of user ability to answer questions. The method uses a naive Bayesian classifier to classify users into user groups based on the questions they answer, applies information from group profiles to predict which future questions they are likely to be able to answer, and selects the next questions to ask based on a combination of information gain and response likelihood. The method was evaluated for a mix of simulated user groups, each associated with particular probabilities for answering questions about each case indexing feature, in four sample domains. For simulated users with varying abilities to answer particular questions, results showed improvement in dialog length over a non-customized entropy-based approach in all test domains.

In NL2OCL project, we aim to translate English specification of constraints to formal constraints such as OCL (Object Constraint Language). In English to OCL translation, our contribution is a semantic analyzer that uses the output of the Stanford parser for shallow and deep semantic parsing. Our analysis of the output of shallow semantic parsing showed that semantic roles were mis-identified for a few English constraints due to semantic ambiguity. Similarly, in deep semantic parsing, it is difficult to resolve scope of quantifier operators due to scope ambiguity that is another sub-type of semantic ambiguity. In this paper, we highlight the identified cases of semantic ambiguities in English constraints. We also present a novel approach to automatically resolve the identified cases of the semantic ambiguities. The presented approach is also evaluated to show that by addressing the identified cases of semantic ambiguities, we can generate more accurate and complete formal (OCL) specifications.

Different studies provide evidence that the computational psycholinguistic algorithm called Latent Semantic Analysis (LSA) allows measuring local and global coherence in texts similarly to human evaluation (Foltz, Kintsch, Landauer 1998; McNamara, Cai & Louwerse 2007; McCarthy, Briner, Rus, & McNamara, 2007; McNamara, Louwerse & Jeuniaux 2009; Louwerse, McCarthy & Graesser 2010). The texts used in all these studies are written in English and correspond to scientific and literary texts. In Spanish, there are some studies using LSA that measure the semantic similarity between texts in automatic summary assessment (Pérez, Alfonseca, Rodríguez, Gliozzo, Strapparava & Magnini 2005; León, Olmos, Escudero, Cañas & Salmerón 2006; Venegas 2007, 2009, 2011); however, automatic measurement of coherence in Spanish has not yet been sufficiently investigated. The present study aimed at identifying a global and local coherence profile in a corpus of speeches in Spanish of three Latin American Heads-of-States (Perón, Castro and Pinochet), using Latent Semantic Analysis. Local coherence is calculated through the measurement of implicit semantic similarity between adjacent sentences and global coherence through the measurement of the similarity among the semantic content of the paragraphs. The corpus under analysis corresponds to a sample of 107 speeches. The semantic space was built using a multi-register corpus and it is available through the “Interface for the measurement of lexical-semantic similarity” in the El Grial interface (www.elgrial.cl). Results showed a systematic difference between the speeches of the Heads-of-State in terms of both local and global coherence. The Bonferroni analysis established an effect that distinguishes Perón’s speeches from Pinochet’s and Castro’s speeches. This results show that Perón’s speeches are more topically related than the other leaders’, probably due to a discourse strategy to persuade voters. The identification of a profile of coherence might be relevant to predict cues of government discourse styles.

This project focuses on artificial social interactions where things get nasty and mean. The purpose is training in social 'facework' -- managing the situation so that participants maintain their social dignity or 'face'. This can be especially delicate in cross-cultural contexts, where assumptions about social protocols and the emotional associations of utterances and gestures may differ. The purpose of this project is two-fold. First, it is intended as a training system, so that users might learn the do's and don'ts of social interactions in different cultures and different situations. The knowledge base draws from existing theories of diplomacy, facework, and (im)politeness theory. The other goal is to provide a platform for observation and experimentation of social interaction in an artificial, virtual setting in order to improve these theories.

The Support Vector Machine has gained significant popularity over recent years as a kernel-based supervised learning technique. However, choosing the appropriate kernel function and its associated parameters is not a trivial task. The kernel is often chosen from several widely-used and general-purpose functions, and the parameters are then empirically tuned for the best results on a specific data set. This paper explores the use of Particle Swarm Optimization and Genetic Programming as evolutionary approaches to evolve effective kernel functions for a given dataset. Rather than using expert knowledge, we evolve kernel functions without human-guided knowledge or intuition. Our results show consistently better SVM performance with evolved kernels over a variety of traditional kernels on several datasets.

For many classification problems, genetic algorithms prove to be effective without extensive domain engineering. However, the chess King-Rook-King endgame problem appears to be an exception. We explore whether modifications to a baseline parallel genetic algorithm can improve the accuracy on this particular problem. After describing the problem domain and our implementation of a parallel genetic algorithm, we present an empirical evaluation of several approaches intended to improve overall performance. Our results confirm the challenging nature of this domain. We describe several directions that may yet deliver significant improvements.

Chairs and committees of the FLAIRS-25 conference.

ICINCO 2012 will be held July 28-31, 2012 in Rome, Italy This page includes forthcoming AAAI sponsored conferences, conferences presented Sixth International RuleML Symposium by AAAI Affiliates, and conferences held in cooperation with AAAI. RuleML-2012 will be Magazine also maintains a calendar listing that includes nonaffiliated conferences held August 27-31, 2012 in Montpellier, at www.aaai.org/Magazine/calendar.php. Knowledge Engineering and Knowledge ICWSM-12 will be held June 4-7 at Flairs-2012 will be held May 23-25, Management. AAAI-12 will be Representation and Reasoning. Twenty-Fourth Innovative Applications Twenty-Second International Conference of Artificial Intelligence Conference. on Automated Planning and IAAI-12 will be held July Scheduling.

In response to a 1997 problem of M. Vidyasagar, we state a criterion for PAC learnability of a concept class $\mathscr C$ under the family of all non-atomic (diffuse) measures on the domain $\Omega$. The uniform Glivenko--Cantelli property with respect to non-atomic measures is no longer a necessary condition, and consistent learnability cannot in general be expected. Our criterion is stated in terms of a combinatorial parameter $\VC({\mathscr C}\,{\mathrm{mod}}\,\omega_1)$ which we call the VC dimension of $\mathscr C$ modulo countable sets. The new parameter is obtained by "thickening up" single points in the definition of VC dimension to uncountable "clusters". Equivalently, $\VC(\mathscr C\modd\omega_1)\leq d$ if and only if every countable subclass of $\mathscr C$ has VC dimension $\leq d$ outside a countable subset of $\Omega$. The new parameter can be also expressed as the classical VC dimension of $\mathscr C$ calculated on a suitable subset of a compactification of $\Omega$. We do not make any measurability assumptions on $\mathscr C$, assuming instead the validity of Martin's Axiom (MA). Similar results are obtained for function learning in terms of fat-shattering dimension modulo countable sets, but, just like in the classical distribution-free case, the finiteness of this parameter is sufficient but not necessary for PAC learnability under non-atomic measures.