Sciweavers

AAAI
1996
13 years 5 months ago
On the Size of Reactive Plans
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...
Peter Jonsson, Christer Bäckström
AAAI
1996
13 years 5 months ago
A Hybrid Learning Approach for Better Recognition of Visual Objects
Real world images often contain similar objects but with different rotations, noise, or other visual alterations. Vision systems should be able to recognize objects regardless of ...
Ibrahim F. Imam, Srinivas Gutta
AAAI
1996
13 years 5 months ago
Design and Implementation of a Replay Framework Based on a Partial Order Planner
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
Laurie H. Ihrig, Subbarao Kambhampati
AAAI
1996
13 years 5 months ago
Discovering Robust Knowledge from Dynamic Closed World Data
Many applications of knowledge discovery require the knowledge to be consistent with data. Examples include discovering rules for query optimization, database integration, decisio...
Chun-Nan Hsu, Craig A. Knoblock
AAAI
1996
13 years 5 months ago
Hierarchical A*: Searching Abstraction Hierarchies Efficiently
Robert C. Holte, M. B. Perez, Robert M. Zimmer, Al...
AAAI
1996
13 years 5 months ago
Reasoning about Continuous Processes
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
Christoph S. Herrmann, Michael Thielscher
AAAI
1996
13 years 5 months ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein
AAAI
1996
13 years 5 months ago
A Counterexample to Theorems of Cox and Fine
Cox's well-known theorem justifying the use of probability is shown not to hold in nite domains. The counterexample also suggests that Cox's assumptions are insu cient t...
Joseph Y. Halpern
AAAI
1996
13 years 5 months ago
Comparing Agent Modeling For Language and Action
Wepresent our approach to agent modelingfor communication, and compareit to an approach to agent modelingfor other types of action. The comparisonshould be instructive since both ...
Nancy Green, Jill Lehman
AAAI
1996
13 years 5 months ago
Sequential Inductive Learning
This article advocates a new model for inductive learning. Called sequential induction, it helps bridge classical fixed-sample learning techniques (which are efficient but difficu...
Jonathan Gratch