The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describes the architecture of Optiplan and provides the integer programming formulation that enabled it to perform reasonably well in the competition. We also touch upon some recent developments that make integer programming encodings significantly more competitive.

We describe the version of the GPT planner used in the probabilistic track of the 4th International Planning Competition (ipc-4). This version, called mGPT, solves Markov Decision Processes specified in the ppddl language by extracting and using different classes of lower bounds along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations where the alternative probabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state and the greedy policy.

Year 2006 is the 150th anniversary of Ivan Franko (1856-1916), the prominent Ukrainian writer, poet, publicist, philosopher, sociologist, economist, translator-polyglot and the public figure. His incomplete collected works were published in 50 volumes (Franko, 1976-86). With this name the notion of national identity in the Western Ukraine is connected. Franko's works have intensive plot and interesting topic.

When dealing with incomplete data in statistical learning, or incomplete observations in probabilistic inference, one needs to distinguish the fact that a certain event is observed from the fact that the observed event has happened. Since the modeling and computational complexities entailed by maintaining this proper distinction are often prohibitive, one asks for conditions under which it can be safely ignored. Such conditions are given by the missing at random (mar) and coarsened at random (car) assumptions. In this paper we provide an in-depth analysis of several questions relating to mar/car assumptions. Main purpose of our study is to provide criteria by which one may evaluate whether a car assumption is reasonable for a particular data collecting or observational process. This question is complicated by the fact that several distinct versions of mar/car assumptions exist. We therefore first provide an overview over these different versions, in which we highlight the distinction between distributional and coarsening variable induced versions. We show that distributional versions are less restrictive and sufficient for most applications. We then address from two different perspectives the question of when the mar/car assumption is warranted. First we provide a ''static'' analysis that characterizes the admissibility of the car assumption in terms of the support structure of the joint probability distribution of complete data and incomplete observations. Here we obtain an equivalence characterization that improves and extends a recent result by Grunwald and Halpern. We then turn to a ''procedural'' analysis that characterizes the admissibility of the car assumption in terms of procedural models for the actual data (or observation) generating process. The main result of this analysis is that the stronger coarsened completely at random (ccar) condition is arguably the most reasonable assumption, as it alone corresponds to data coarsening procedures that satisfy a natural robustness property.

The 2004 International Planning Competition, IPC-4, included a probabilistic planning track for the first time. We describe the new domain specification language we created for the track, our evaluation methodology, the competition domains we developed, and the results of the participating teams.

Most autonomous robots are equipped with restricted, unreliable, and inaccurate sensors and effectors and operate in complex and dynamic environments. A successful approach to deal with the resulting uncertainty is the use of controllers that prescribe the robots' behavior in terms of concurrent reactive plans (CRPs) -- plans that specify how the robots are to react to sensory input in order to accomplish their jobs reliably (e.g., McDermott, 1992a; Beetz, 1999). Reactive plans are successfully used to produce situation specific behavior, to detect problems and recover from them automatically, and to recognize and exploit opportunities (Beetz et al., 2001). These kinds of behaviors are particularly important for autonomous robots that have only uncertain information about the world, act in dynamically changing environments, and are to accomplish complex tasks efficiently. Besides reliability and flexibility, foresight is another important capability of competent autonomous robots (McDermott, 1992a).

The emerging Semantic Web focuses on bringing knowledge representationlike capabilities to Web applications in a Web-friendly way. The ability to put knowledge on the Web, share it, and reuse it through standard Web mechanisms provides new and interesting challenges to artificial intelligence. In this paper, I explore the similarities and differences between the Semantic Web and traditional AI knowledge representation systems, and see if I can validate the analogy "The Semantic Web is to KR as the Web is to hypertext."

What Do We Know about Knowledge? In this article, I will examine the first of these questions. AI has been slow to embrace this principle. Programs demonstrating research ideas in AI are often too large and not well enough documented to allow replication or sharing. What I would like to in diverse conditions. I wish to clarify the knowledge example, it was pretty clearly articulated in Biblical principle and try to increase our understanding times: "A man of knowledge increaseth of what programmers and program strength" (Proverbs 24: 5). Greek philosophers based their lives on acquiring The "knowledge is power" principle is most and transferring knowledge. In the course closely associated with Francis Bacon, from his of teaching, they sought to understand the 1597 tract on heresies: "Nam et ipsa scientia nature of knowledge and how we can establish potestas est." ("In and of itself, knowledge is knowledge of the natural world. B," along with quantification, "All A's are B's," Euclid's geometry firmly established the concept In the intervening several centuries before Plato, Socrates's pupil and Aristotle's mentor, was the first to pose the question in writing of the Middle Ages and the rise of modern science what we mean when we say that a person in the West, He was distinguishing empirical knowledge, church to make new knowledge fit with established lacking complete certainty, from the certain dogma.

Twenty years later that link is firmly established, and the two research communities have largely merged into one. Problem," by Steve Hanks and Drew Mc-or does not hold after a sequence of learning was the "inductive bias" of a The idea is this: Normally, an object learn the target concept--the more in 1986, helped initiate a very constraining the inductive bias, the is unaffected by an action. If a window fruitful integration of a branch of machine less training data needed. Starting in the of PAC learning was being developed, an action. There are clear exceptions, 1950s, with work like Samuels's program which allowed deriving quantitative however, such as the act of closing the that learned strategies for playing bounds on the probability of window. A variety of formal systems checkers, AI researchers had designed successful learning as a function of the have been proposed that would allow and experimented with a number of training examples and the us to infer in the absence of conflicting variety of learning algorithms and complexity of the learner's hypothesis information that the window remains had also developed a number of theoretical space (as measured by its Vapnik-open (or that a polar bear is results, such as convergence Chervonenkis dimension). What white or that a violin has four strings, proofs for perceptrons and "learning Haussler's paper did was help introduce and so on).

For many years, the very idea of artificial intelligence has been provocative and exciting. However, with a continually increasing focus on specialized subareas and somewhat narrow technical problems (both of which are inevitable and in many ways healthy), we may be torpedoing our core research agenda: the creation of a true synthetic intelligence. I reflect briefly on the essential interdependencies of the components of intelligence, the important roles of architecture and integration, and the need to get back to thinking about the very idea of AI. AAAI's role in the field has evolved over the years, but after a quarter-century as an organization, and a half-century as a field, it seems like AAAI is in an ideal situation to bring AI as a whole back to its roots. In 1985, the philosopher John Haugeland wrote a thoughtprovoking treatise on AI that he titled Artificial Intelligence: The Very Idea.