Sciweavers

2178 search results - page 36 / 436
» Inferring complex plans
Sort
View
FLAIRS
2010
13 years 11 months ago
Commonsense Inference in Dynamic Spatial Systems: Epistemological Requirements
We demonstrate the role of commonsense inference toward the modeling of qualitative notions of space and spatial change within a dynamic setup. The inference patterns are connecte...
Mehul Bhatt
IJCAI
1993
13 years 10 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
IJCAI
2003
13 years 10 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
14 years 1 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 3 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu