Sketch maps are an important spatial representation used in many geospatial-reasoning tasks. This article describes techniques we have developed that enable software to perform humanlike reasoning about sketch maps. We illustrate the utility of these techniques in the context of nuSketch Battlespace, a research system that has been successfully used in a variety of experiments. After an overview of the nuSketch approach and nuSketch Battlespace, we outline the representations of glyphs and sketches and the nuSketch spatial reasoning architecture. We describe the use of qualitative topology and Voronoi diagrams to construct spatial representations, and explain how these facilities are combined with analogical reasoning to provide a simple form of enemy intent hypothesis generation.

AI agents combining natural language interaction, task planning, and business ontologies can help companies provide better-quality and more costeffective customer service. Our customer-service agents use natural language to interact with customers, enabling customers to state their intentions directly instead of searching for the places on the Web site that may address their concern. We use planning methods to search systematically for the solution to the customer's problem, ensuring that a resolution satisfactory for both the customer and the company is found, if one exists. Our agents converse with customers, guaranteeing that needed information is acquired from customers and that relevant information is provided to them in order for both parties to make the right decision. The net effect is a more frictionless interaction process that improves the customer experience and makes businesses more competitive on the service front.

This eclectic keepsake provides a sampling was initially inspired by science fiction, "[iRobot Chairman Helen] Greiner believes'One of what can be found (with links to the full the movie may influence a new generation She said the R2D2 robot's humanlike She went on to the articles were initially available inventions were predicted by those sort of MIT where she earned undergraduate and online and without charge, few things that writers. In terms of the capabilities that graduate degrees in mechanical engineering, good last forever; and (4) the AI in the News we get in modern computers, they could electrical engineering and computer collection--updated, hyperlinked, and see some of that. What I find so interesting science. 'It takes all three (disciplines) and archived--can be found by going to is that we start with these ideas which they must all come together in robotics,' www.aaai.org/aitopics/html/current.html. June 10, "In the war on terror, University about robots programmed to think on Breazeal of the Massachusetts Institute of professor Robin Murphy finds herself a New Jersey.

We are pleased to publish this special selection of papers from the 2003 Innovative Applications of Artificial Intelligence Conference (IAAI-03). IAAI seeks out applications of artificial intelligence that either demonstrate new technology or use previously known technology in innovative ways. IAAI particularly seeks out examples of deployments of AI technology that tackle the problems of demonstrating value and planning for long-term deployment. The five articles we have selected for this special issue are extended versions of papers that appeared in the conference. Two of the articles are deployed applications that have already demonstrated practical value. The remaining three articles are particularly innovative emerging applications. We will briefly outline each of them.

We have developed a sales-support system for door-to-door sales of cosmetics based on a system called Skin-Expert, a skin-image grading service that includes analysis and diagnosis. Skin-Expert analyzes a customer's current skin quality from a picture of the skin. Several parameters are extracted by image processing, and the skin grading is done by rules generated by data mining from a baseline of grades given by human skin-care experts. Communication with the Skin-Expert is through a cellular telephone with a camera, using e-mail software and a Web browser. Salespeople photograph the customer's skin using the camera in a standard cellular telephone and then send an e-mail message that includes the picture as an attachment to our analysis system. Other parameters associated with the customer (for example, age and gender) are included in the body of the message. The picture is analyzed by our skin-grading system, and the results are made available as a page in HTML format on a customer-accessible Web site. An e-mail is sent when the results are available, usually within minutes. Salespeople check the results by using a Web browser on their cellular telephones. The output not only provides a grading result but also gives recommendations for the care and cosmetics that are most suitable for the customer. Our system integrates cellular communication, Web technology, computer analysis, data mining, and an expert system. Though salespeople use only a cellular telephone with very little computing power as the front end, they can take advantage of intelligent services such as computer grading and data mining. The salespeople do not need to think about what is running in the background, and there is no requirement that end users have any special hardware.

Trends in Intelligent Information Knowledge Based Computer Systems. The 18th International FLAIRS Conference seeks high quality, original, Larry Holder, University of Texas at Arlington unpublished submissions in all areas of AI, including, but not limited to, holder@cse.uta.edu The FLAIRS conference offers a set of special tracks, and authors are encouraged to submit papers to a relevant track.

This article is a sequel to an article titled "A New Direction in AI -- Toward a Computational Theory of Perceptions," which appeared in the Spring 2001 issue of AI Magazine (volume 22, No. 1, 73-84). The concept of precisiated natural language (PNL) was briefly introduced in that article, and PNL was employed as a basis for computation with perceptions. In what follows, the conceptual structure of PNL is described in greater detail, and PNL's role in knowledge representation, deduction, and concept definition is outlined and illustrated by examples. What should be understood is that PNL is in its initial stages of development and that the exposition that follows is an outline of the basic ideas that underlie PNL rather than a definitive theory. A natural language is basically a system for describing perceptions. Perceptions, such as perceptions of distance, height, weight, color, temperature, similarity, likelihood, relevance, and most other attributes of physical and mental objects are intrinsically imprecise, reflecting the bounded ability of sensory organs, and ultimately the brain, to resolve detail and store information. In this perspective, the imprecision of natural languages is a direct consequence of the imprecision of perceptions (Zadeh 1999, 2000). How can a natural language be precisiated -- precisiated in the sense of making it possible to treat propositions drawn from a natural language as objects of computation? This is what PNL attempts to do. In PNL, precisiation is accomplished through translation into what is termed a precisiation language. In the case of PNL, the precisiation language is the generalized-constraint language (GCL), a language whose elements are so-called generalized constraints and their combinations. What distinguishes GCL from languages such as Prolog, LISP, SQL, and, more generally, languages associated with various logical systems, for example, predicate logic, modal logic, and so on, is its much higher expressive power. The conceptual structure of PNL mirrors two fundamental facets of human cognition: (a) partiality and (b) granularity (Zadeh 1997). Partiality relates to the fact that most human concepts are not bivalent, that is, are a matter of degree. Thus, we have partial understanding, partial truth, partial possibility, partial certainty, partial similarity, and partial relevance, to cite a few examples. Similarly, granularity and granulation relate to clumping of values of attributes, forming granules with words as labels, for example, young, middle-aged, and old as labels of granules of age. Existing approaches to natural language processing are based on bivalent logic -- a logic in which shading of truth is not allowed. PNL abandons bivalence. By so doing, PNL frees itself from limitations imposed by bivalence and categoricity, and opens the door to new approaches for dealing with long-standing problems in AI and related fields (Novak 1991). At this juncture, PNL is in its initial stages of development. As it matures, PNL is likely to find a variety of applications, especially in the realms of world knowledge representation, concept definition, deduction, decision, search, and question answering.

Committee is listed in the sidebar.

We propose a model for errors in sung queries, a variant of the hidden Markov model (HMM). This is a solution to the problem of identifying the degree of similarity between a (typically error-laden) sung query and a potential target in a database of musical works, an important problem in the field of music information retrieval. Similarity metrics are a critical component of `query-by-humming' (QBH) applications which search audio and multimedia databases for strong matches to oral queries. Our model comprehensively expresses the types of {m error} or variation between target and query: cumulative and non-cumulative local errors, transposition, tempo and tempo changes, insertions, deletions and modulation. The model is not only expressive, but automatically trainable, or able to learn and generalize from query examples. We present results of simulations, designed to assess the discriminatory potential of the model, and tests with real sung queries, to demonstrate relevance to real-world applications.

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a universal sequence predictor in case of unknown mu. Despite some nearby results and proofs in the literature, the stronger result of convergence for all (Martin-Loef) random sequences remained open. Such a convergence result would be particularly interesting and natural, since randomness can be defined in terms of M itself. We show that there are universal semimeasures M which do not converge for all random sequences, i.e. we give a partial negative answer to the open problem. We also provide a positive answer for some non-universal semimeasures. We define the incomputable measure D as a mixture over all computable measures and the enumerable semimeasure W as a mixture over all enumerable nearly-measures. We show that W converges to D and D to mu on all random sequences. The Hellinger distance measuring closeness of two distributions plays a central role.