Although most people believe that planners that delay step-ordering decisions as long as possible are more e cient than those that manipulate totally ordered sequences of actions, this intuition has received little formal justi cation or empirical validation. In this paper we do both, characterizing the types of domains that o er performance di erentiation and the features that distinguish the ...

The web has become the central platform and marketplace for the organization, propagation of events and sale of tickets of any kind. Such events range from concerts, workshops, sport events, professional events to small local events. Individual’s event choices vary tremendously based on preferences and lifestyle. Online users use the web to inform themselves about new events near their location...

To build e ective planning systems, it is crucial to nd the right level of representation: too impoverished, and important actions and goals are impossible to express; too expressive, and planning becomes intractable. Within the classical framework, Pednault's adl [ 24 ] provided a happy compromise between the impoverished strips representation and the expensive situation calculus. Among langua...

We present a new method for partial order planning in the STRIPS/SNLP style. Our contribution centers on how we drop the closed world assumption while adding a useful class of universally quantified propositions to the representation of states and actions. These quantified expressions allow expression of partially closed worlds, such as "block A has no other block on it", or "F is the only Tex ...

Numerous NLP applications rely on search-engine queries, both to extract information from and to compute statistics over the Web corpus. But search engines often limit the number of available queries. As a result, query-intensive NLP applications such as Information Extraction (IE) distribute their query load over several days, making IE a slow, offline process. This paper introduces a novel ar...

We describe a forward reasoning planner for open worlds that uses domain specific information for pruning its search space, as suggested by (Bacchus & Kabanza 1996; 2000). The planner is written in the situation calculus-based programming language GOLOG, and it uses a situation calculus axiomatization of the application domain. Given a sentence to prove, the planner regresses it to an equivalen...

Problems in meaning and credibility in the WWW Position paper Joshua Grass and Shlomo Zilberstein Computer Science Department University of Massachusetts Amherst, MA 01003 U.S.A. fjgrass,[email protected] Introduction This paper describes issues in information integration that relate to Value-Driven Information Gathering (VDIG)(Grass & Zilberstein 1996; 1997; 1998). Valuedriven information g...

Content Areas: data mining, machine learning, applications, user interfaces Abstract The creation of a complex web site is a thorny problem in user interface design. In IJCAI '97, we challenged the AI community to address this problem by creating adaptive web sites: sites that automatically improve their organization and presentation by mining visitor access data collected in Web server logs. I...

While recent decades have brought substantial change to the form of the operating system interface, the power of operating system commands has remained nearly constant. Conventional commands, whether visual or textual, specify one particular action to perform. To carry out a complex task, such as reducing disk utilization, the user is forced to explicitly specify each of the necessary steps. Tr...

When managing a computing system, it is better to predict problems before they occur, rather than just observing them when they occur. Our research develops self-interested agents designed for the prediction of resource usages, that is, assessing the likelihood of upcoming demands by users on the limited resources and detecting potential problems from the observations of human-computer interact...