WEBODE is a scalable workbench for ontological engineering that eases the design, development, and management of ontologies and includes middleware services to aid in the integration of ontologies into real-world applications. WEBODE presents a framework to integrate new ontology-based tools and services, where developers only worry about the new logic they want to provide on top of the knowledge stored in their ontologies.

The article introduces the reader to a large interdisciplinary research project whose goal is to use AI to gain new insight into a complex artistic phenomenon. We study fundamental principles of expressive music performance by measuring performance aspects in large numbers of recordings by highly skilled musicians (concert pianists) and analyzing the data with state-of-the-art methods from areas such as machine learning, data mining, and data visualization. The article first introduces the general research questions that guide the project and then summarizes some of the most important results achieved to date, with an emphasis on the most recent and still rather speculative work. A broad view of the discovery process is given, from data acquisition through data visualization to inductive model building and pattern discovery, and it turns out that AI plays an important role in all stages of such an ambitious enterprise. Our current results show that it is possible for machines to make novel and interesting discoveries even in a domain such as music and that even if we might never find the "Horowitz Factor," AI can give us completely new insights into complex artistic behavior.

We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose a novel representation for collective beliefs that uses modular, transitive relations over possible worlds. They allow us to represent conflicting opinions and they have a clear semantics, thus improving upon the quasi-transitive relations often used in social choice. We then describe a way to construct the belief state of an agent informed by a set of sources of varying degrees of reliability. This construction circumvents Arrow's Impossibility Theorem in a satisfactory manner by accounting for the explicitly encoded conflicts. We give a simple set-theory-based operator for combining the information of multiple agents. We show that this operator satisfies the desirable invariants of idempotence, commutativity, and associativity, and, thus, is well-behaved when iterated, and we describe a computationally effective way of computing the resulting belief state. Finally, we extend our framework to incorporate voting.

The performance of anytime algorithms can be improved by simultaneously solving several instances of algorithm-problem pairs. These pairs may include different instances of a problem (such as starting from a different initial state), different algorithms (if several alternatives exist), or several runs of the same algorithm (for non-deterministic algorithms). In this paper we present a methodology for designing an optimal scheduling policy based on the statistical characteristics of the algorithms involved. We formally analyze the case where the processes share resources (a single-processor model), and provide an algorithm for optimal scheduling. We analyze, theoretically and empirically, the behavior of our scheduling algorithm for various distribution types.

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing ``shortest'' plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language Kc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved.

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems. We also show that our algorithm unifies several previous results.

Many problems in robust control and motion planning can be reduced to either find a sound approximation of the solution space determined by a set of nonlinear inequalities, or to the ``guaranteed tuning problem'' as defined by Jaulin and Walter, which amounts to finding a value for some tuning parameter such that a set of inequalities be verified for all the possible values of some perturbation vector. A classical approach to solve these problems, which satisfies the strong soundness requirement, involves some quantifier elimination procedure such as Collins' Cylindrical Algebraic Decomposition symbolic method. Sound numerical methods using interval arithmetic and local consistency enforcement to prune the search space are presented in this paper as much faster alternatives for both soundly solving systems of nonlinear inequalities, and addressing the guaranteed tuning problem whenever the perturbation vector has dimension one. The use of these methods in camera control is investigated, and experiments with the prototype of a declarative modeller to express camera motion using a cinematic language are reported and commented.

Successes and Challenges" by Alon Halevy, University of Washington; "Constraint Satisfaction, Santa Cruz; "Self-Reconfiguring Robots: Challenges and Successes" by Daniela Rus, Dartmouth University; "Automated Verification Graphs, Automata, and Logic" by Moshe Vardi, "Quantum Information: Fundamentals the world have gathered each summer One hundred the conference is always after conference hours. Also among this year's invited As part of the American Association As In addition to the strong technical to advance the science and practice part of a special track on AI and the track of the conference, the Fifteenth of AI, the organization continues web, Henzinger will discuss the future Innovative Applications of AI conference to play a leading role in organizing of search engines on the internet, (IAAI-03) will be collocated with and sponsoring these annual summer describing work under way to IJCAI. Through the years, we have conferences. Other invited talks include "Deploying in a broad range of computer systems, Information Agents on the machinery, and electronic devices Because AI is an umbrella term for a of Southern California; "Web However, where is the newest, most This book looks at some of the results of this synergy among AI, cognitive science, and education. Examples include virtual students whose misconceptions force students to reflect on their own knowledge, intelligent tutoring systems, and speech recognition technology that helps students learn to read.

In an attempt to solve as much of the AAAI Robot Challenge as possible, five research institutions representing academia, industry, and government integrated their research into a single robot named GRACE. This article describes this first-year effort by the GRACE team, including not only the various techniques each participant brought to GRACE but also the difficult integration effort itself.

Interestingly enough, even the poster session was very successful. Her presentation attracted many people in all areas of AI. "How not to Give a Talk," given and approaches but also to their to an international event with a by Eugene Freuder, from 4C, Cork, future scientific career. It gave Ph.D. students (and The format of the conference included from ENIT, Tarbes, France, and Paolo others...) crucial keys into the usual paper presentations in thematic Liberatore, from University La Sapienza, errors and blunders one can make sessions, a poster session, two invited Rome, Italy, were the cochairs of when presenting research work. STAIRS and ECAI program committees, chaired the Organization Committee. Another goal of From 64 submissions, the Program robotics at Carnegie Mellon University, STAIRS was indeed to offer researchers Committee selected 21 papers and 9 appeared to be the best candidate who have recently completed their posters of high technical quality, for such a purpose.