Knowledge portals provide views onto domain-specific information on the World Wide Web, thus helping their users find relevant, domain-specific information. The construction of intelligent access and the contribution of information to knowledge portals, however, remained an ad hoc task, requiring extensive manual editing and maintenance by the knowledge portal providers. To diminish these efforts, we use ontologies as a conceptual backbone for providing, accessing, and structuring information in a comprehensive approach for building and maintaining knowledge portals. We present one research study and one commercial case study that show how our approach, called seal (semantic portal), is used in practice.

Unsupervised Learning: Foundations of Neural Computation is a collection of 21 papers published in the journal Neural Computation in the 10-year period since its founding in 1989 by Terrence Sejnowski. Neural Computation has become the leading journal of its kind. The editors of the book are Geoffrey Hinton and Terrence Sejnowski, two pioneers in neural networks. The selected papers include some of the most influential titles of late, for example, "What Is the Goal of Sensory Coding" by David Field and "An Information-Maximization Approach to Blind Separation and Blind Deconvolution" by Anthony Bell and Terrence Sejnowski. The edited volume provides a sample of important works on unsupervised learning, which cut across the fields of

The SciFinance software synthesis system, licensed to major investment banks, automates programming for financial risk-management activities -- from algorithms research to production pricing to risk control. SciFinance's high-level, extensible specification language, aspen, lets quantitative analysts generate code from concise model descriptions written in application-specific and mathematical terminology; typically, a page or less produces thousands of lines of c. aspen's abstractions help analysts focus on their primary tasks -- model description, validation, and analysis -- rather than on programming details. Compared with manual programming, automation produces codes that are more sophisticated, accurate, and consistent. Analysts develop models within a day that previously took weeks or were not even attempted. SciFinance extends a system that generates scientific computing codes in a variety of target languages. The implementation integrates an object-oriented knowledge base, refinement and optimization rules, computer algebra, and a planning system. The shared knowledge base is used by the specification checker, synthesis system, and information portal.

This paper investigates the problems arising in the construction of a program to play the game of contract bridge. These problems include both the difficulty of solving the game's perfect information variant, and techniques needed to address the fact that bridge is not, in fact, a perfect information game. GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems. GIB is currently believed to be of approximately expert caliber, and is currently the strongest computer bridge program in the world.

Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.

We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines hill-climbing with systematic search, and we show how other powerful heuristic information can be extracted and used to prune the search space. FF was the most successful automatic planner at the recent AIPS-2000 planning competition. We review the results of the competition, give data for other benchmark domains, and investigate the reasons for the runtime performance of FF compared to HSP.

Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e., set of individuals with common properties. The experience in using DLs in applications has shown that in many cases we would like to extend their capabilities. In particular, their use in the context of Multimedia Information Retrieval (MIR) leads to the convincement that such DLs should allow the treatment of the inherent imprecision in multimedia object content representation and retrieval. In this paper we will present a fuzzy extension of ALC, combining Zadeh's fuzzy logic with a classical DL. In particular, concepts becomes fuzzy and, thus, reasoning about imprecise concepts is supported. We will define its syntax, its semantics, describe its properties and present a constraint propagation calculus for reasoning in it.

Unlike and Exhibition, held 30 July to 3 other contests over the years, there were no August 2000 in Austin, Texas. This year's event artificial walls or constraints in this brought six contest teams and nine exhibition event--the robots had to interact with regular teams from the United States and Canada. Robots were judged on to compete and demonstrate state-ofthe-art the quality of their interactions, coverage, research in robotics and AI (figure 1). An article by the winning team, The competition and exhibition is actually which better describes their approach and made up of multiple events: several contests, a robot, can be found in this issue of AI Magazine. Kortenkamp, Nourbakhsh, and Hinkle (1997); In January 2000, a suggestion was made to Arkin (1998); and Meeden et al. (2000).

The seventh biennial Bar-Ilan International Symposium on the Foundations of Artificial Intelligence, will be held on June 25-27, 2001 in Ramat Gan, Israel. The meeting will honor the research and accomplishments of Yaacov Choueka and will therefore place special emphasis on natural language processing and computational linguistics, in addition to the usual topics of the symposium. Yaacov Choueka Jieh Hsiang Daphne Koller Richard Korf Doug Lenat Moshe Vardi The BISFAI-01 program, schedule and registration information will be available at the BISFAI website: www.cs.biu.ac.il/ bisfai, along with abstracts of invited and accepted papers and pointers to online versions.For further information or requests, contact: bisfai@cs.biu.ac.il. CONTEXT-01 EST Setubal, Campus do IPS / R. Vale www.dfki.de/um2001 Faculty Positions for Intelligent Aerospace Systems Program The College of Engineering at the University of Oklahoma invites applications for 3 to 5 new faculty positions at all levels in the area of Intelligent Systems.

Built on seven hills, with unmatched mountain and water views, the wealth of natural beauty in and around Seattle astonishes first-time visitors. Olympic Mountains are to the west. The Washington State Convention 01 is cosponsored by AAAI. Ballard Locks, and the new Experience Approach for Representing Uncertainty" quantity, provided that the use of The monorail by Joseph Y. Halpern, Cornell such excerpts is personal and does not Space Needle and the Experience Music Agents in Adversarial Environments" program is included in your There will IJCAI will welcome three collocated next year and beyond. AI Journal, please contact membership@aaai.org