Multiagent planning is computationally hard in the general case due to the exponential blowup in the action space induced by concurrent action of different agents. At the same time, many scenarios require the computation of plans that are strategically meaningful for self-interested agents, in order to ensure that there would be sufficient incentives for those agents to participate in a joint plan. In this paper, we present a multiagent planning and plan improvement method that is based on conducting iterative best-response planning using standard single-agent planning algorithms. In constrained types of planning scenarios that correspond to congestion games, this is guaranteed to converge to a plan that is a Nash equilibrium with regard to agents' preference profiles over the entire plan space. Our empirical evaluation beyond these restricted scenarios shows, however, that the algorithm has much broader applicability as a method for plan improvement in general multiagent planning problems. Extensive empirical experiments in various domains illustrate the scalability of our method in both cases.

In this study, we analyze two corpora of art critiques: one on the subject of photography and the other on the subject of modern art. We use two computational tools, the Gramulator and GPAT to analyze both sets of texts. The Gramulator was used to show the indicative linguistic features that make photography criticism a distinct genre from modern art criticism. Results suggest that lexical features, structural formats, and genre consistency differed significantly between the two corpora. The findings provide information for teachers, students, publishers, and curriculum developers for creating more effective writing and teaching materials. This includes material for English for Specific Purposes (ESP) in the form of textbooks, workbooks and other external learning material.

S. Tenier, A. Napoli, X. Polanco and Y.Toussaint (2006) With the proliferation of news articles from thousands of developed an automatic WebPages semantic annotation different sources now available on the Web, summarization system. The objective is to classify pages concerning teams of such information is becoming increasingly important. of research, in order to be able to determine for example Considering the large number of news source (for who works where, on what and with whom (use of examples, BBC, Reuters, CNN…), every day, thousands of ontology of the domain). It consists, first, of the articles are produced in the entire world concerning a given identification of the syntactic structure characterizing the event.

In this paper we present Myro-C++, developed at the University of Tennessee. Myro-C++ is a C++ port ofthe Python Myro library that was written by the Institute for Personal Robots in Education (IPRE) at Georgia Tech and Bryn Mawr College. Myro-C++ is publicly available, open source software, released under the GPLv3 open source license. At the time of writing, the library has been used six semesters for the CS1 courseat the University of Tennessee, Knoxville. The library contains functions for control of the robot and access to sensor information, and provides the ability to display the live camera image from the robot into a video window. This library is used as a teaching tool in our CS1 course where students learn basic programming fundamentals using multiple artificial intelligence based labs. In addition to the software, the IPRE book, Learning Computing with Robots, has been edited to use C++ examples and explanations, and is freely available. We also present example programs that we use as laboratory assignments in our Introduction to Computer Science course, which are also freely available.

Negation is present in all human languages and it is used to reverse the polarity of parts of a statement. It is a complex phenomenon that interacts with many other aspects of language. Besides the direct meaning, negated statements often carry a latent positive meaning. Negation can be interpreted in terms of its scope and focus. This paper explores the importance of both scope and focus to capture the meaning of negated statements. Some issues on detecting negation from text are outlined, the forms in which negation occurs are depicted and heuristics to detect its scope and focus are proposed.

Closely related genres have complex interrelations. An antecedent genre can constrain a subsequent genre, but changing rhetorical situations can lead to distinctions between an antecedent and its descendent. In this study, we assess two genres of detective fiction to determine their hierarchical relation to one another. We use the Gramulator, a computational tool that identifies indicative lexical features, to explain the relationship between whodunit fiction and hardboiled fiction . We conclude, based on the indicative lexical features of the expositions in texts, that the two are sibling genres.

What determines difficulty of solving a problem? Although this question has been studied before, we found examples which show large differences in problem difficulty which are not explained by concepts identified in previous research. This differences are caused mainly by the structure of a problems' state spaces and cannot be easily captured by static metrics like size of the state space or the length of a solution. To address these unexplained differences, we propose a computational model of human problem solving behaviour. We provide evaluation of the model over large scale dataset (hundreds of hours of problem solving, more than 100 problem instances) for three transport puzzles (Sokoban, Rush hour, and Replacement puzzle).

The call for papers were Yutao Wang and Neil Heffernan for "The attracted 179 submissions, across 13 different'Assistance' Model: Leveraging How Many tracks. Special tracks are a vital part of the Hints and Attempts a Student Needs," a submission FLAIRS conferences, with 12 held at FLAIRSto the Special Track on Intelligent Tutoring 24. Over 90 percent of the papers were reviewed Systems; Simon Delamarre for "The Utility of by four or more reviewers, and all papers were Combinatory Categorical Grammar in Designing reviewed by at least three. These reviews were a Pedagogical Tool for Teaching Languages," coordinated by the program committees of the a submission to the Special Track on Computation general conference and the special tracks. The Linguistics; and Rachel M. Rufenacht, accepted submissions include 94 papers and 37 Philip M. McCarthy, and Travis A. Lamkin for poster papers that appear in these proceedings.

We describe a four-week series of assignments in an undergraduate AI course at a liberal arts college developing a supervised learning solution to the problem of classifying Twitter accounts as either a person account or a non-person account (e.g. organization or spambot). This problem employs real data in an ongoing research project by the first author, yet is accessible to students with limited programming expertise.The students were able to experience a complete cycle of creating a machine learning solution: exploring raw data,creating a training set, engineering features, comparing different classifiers, evaluating the results, and performing erroranalysis. We received positive feedback from the students and intend to refine the assignment and make it available (together with the created training data) for use by the research community.

We futher claim that categorization within this domain is a recursive process of subdivision. We describe a theory of perceptual understanding, implemented Despite its central role in our theory, categorization isn't in Mathematica, that forms rich representations of the only way people demonstrate understanding of exemplar very simple visual concepts. We suggest that this theory can sets. In order to accommodate this, our theory supports a variety represent any category distinction that a human is liable to of other operations, such as outlier detection and concept make within its limited domain.