This article presents an experiment of expertise capitalization in road traffic-accident analysis. We study the integration of models of expertise from different members of an organization into a coherent corporate expertise model. We present our elicitation protocol and the generic models and tools we exploited for knowledge modeling in this context of multiple experts. We compare the knowledge models obtained for seven experts in accidentology and their representation through conceptual graphs. Finally, we discuss the results of our experiment from a knowledge capitalization viewpoint.

Calendar of AI-related meetings, conferences, meetings, workshops, and symposia.

The National Aeronautics and Space Administration Jet Propulsion Laboratory (Pasadena, Calif.) has developed The chip, which has The National Aeronautics and Chester, N.Y.) to improve its ability to been licensed by automaker Ford Space Administration (NASA) Goddard match reported wage information. Motor (Dearborn, Mich.), is designed Space Flight Center (Greenbelt, The solution will help the agency to augment current vehicle on-board Md.) has developed the The Philippines (Quezon City, The process for outside scientists wanting RoyScot Trust, the asset finance arm Philippines) has adopted an intelligent to use NASA's space telescopes. of the Royal Bank of Scotland (Edinburgh, agent-based software system to The system is designed to capture and Scotland), has implemented an manage mission-critical tax processes maintain key scientific knowledge expert system-based solution to automate across The Philippines. The intelligent while it reduces common errors made the credit-underwriting process. The firm has set up a credit control management of the bureau's entire Johnson Controls (Milwaukee, Wis.), system, The turnkey expert installs and maintains. By integrating component has deployed a speech-recognition- frequent air travelers through U.S. math data with work-cell visualization based application for its frequent flier Immigration inspection in less than software, engineers can simulate customers.

Fourth, causality is still an important issue; some formal models of causality have surprisingly close connections to standard nonmonotonic techniques. Fifth, the nonmonotonic logics being used most widely are the classical ones: default logic, circumscription, and by Isaac Levi; (3) Nonmonotonic Reasoning autoepistemic logic. Maybe the most remarkable trend he Seventh International Workshop was held in Trento, Italy, Tolerance by John McCarthy; (4) that became apparent during the on 30 May to 1 June 1998 in conjunction Learning to Make Nonmonotonic workshop was the new excitement with the Sixth International Inferences by Dan Roth; and (5) From among the participants. The depression Conference on the Principles of Features and Fluents to Thinking that plagued a number of people Knowledge Representation and Reasoning When Flying--Reasoning about in the field seems to be over. The workshop was Actions in an Intelligent UAV by Erik common feeling was that the theory sponsored by the American Association Sandewall.

Here scheduling, where we have fast, heuristic we identify a few properties of a real task and scheduling algorithms that yield dramatic produce mathematical abstractions of these speedups over traditional methods; decision properties. Again, both of those steps are perfectly making, where we have expert systems as standard good as initial exploration. But then we tools in many companies and products; work with the mathematical abstractions and and financial forecasting, where we don't hear never come back to the issues that came up in much about what people are doing, but Wall the original task. In some cases, new subfields Street firms seem to hire AI researchers at a of research have arisen based solely on this level rapid rate. of abstraction, and work becomes farther On the perception side, robots with vision and farther removed from the original motivating are revolutionizing manufacturing.

It is a northern European city of 100,000, almost on the border between the Republic of Ireland and Northern Ireland. The local press (The Derry Journal north Derry coast, with beautiful meetings enjoyed themselves and & Belfast Telegraph) and radio (BBC beaches at Benone and Castlenock expressed their congratulations on Northern Ireland) ran a number of and then through Coleraine to the the program and organization. Also, articles leading up to and during the seaside resorts of Portstewart and for the first time, AICS attracted a conference. All plenary invited speaker Portrush. A few kilometers further large number of delegates and papers talks and the panel session went out along the north Antrim coast, we from abroad, including many from on streaming video and audio, stored arrive at the Giants' Causeway and the United Kingdom, Europe, and Sauce!); Gweedore, home of the Clannad and live with the possibility of phonein for Pattern Recognition (IAPR), the More details on all the data mining and knowledge discovery, the CSSI, was run as "MIND-II: Computational events are available at www.infm.ulst. Project, multimedia, and distributed are particularly welcome! which integrates speech and language object computing (www.infc.ulst.ac. Ever since George Boolean processing as applied to a spoken dialogue uk/informatics/). Knowledge Engineering Laboratory (see Dennett's Joycean Okada focused on a similar theme to (NIKEL), a joint venture with machine), Claude Shannon Von Hahn with his paper " US, 1956) we have been generation system for integrating into artificial intelligence.

Three main sections follow: mainly on Rodney Brooks's subsumption

This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems. AntNet's agents concurrently explore the network and exchange collected information. The communication among the agents is indirect and asynchronous, mediated by the network itself. This form of communication is typical of social insects and is called stigmergy. We compare our algorithm with six state-of-the-art routing algorithms coming from the telecommunications and machine learning fields. The algorithms' performance is evaluated over a set of realistic testbeds. We run many experiments over real and artificial IP datagram networks with increasing number of nodes and under several paradigmatic spatial and temporal traffic distributions. Results are very encouraging. AntNet showed superior performance under all the experimental conditions with respect to its competitors. We analyze the main characteristics of the algorithm and try to explain the reasons for its superiority.

In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example specificity in inheritance reasoning can be handled this way, or they may be given abstractly as an ordering on the default rules. In this article we investigate formalizations of the latter approach in Reiter's default logic. Our goal is to analyze and compare the computational properties of three such formalizations in terms of their computational complexity: the prioritized default logics of Baader and Hollunder, and Brewka, and a prioritized default logic that is based on lexicographic comparison. The analysis locates the propositional variants of these logics on the second and third levels of the polynomial hierarchy, and identifies the boundary between tractable and intractable inference for restricted classes of prioritized default theories.

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL -- able to express interval temporal networks -- together with the non-temporal logic F -- a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.