Sciweavers

972 search results - page 149 / 195
» Reasoning with Conditional Time-Intervals
Sort
View
AAAI
2006
13 years 9 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
AIML
2006
13 years 9 months ago
From topology to metric: modal logic and quantification in metric spaces
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
AIPS
2006
13 years 9 months ago
Safe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Alexandre Albore, Piergiorgio Bertoli
FLAIRS
2006
13 years 9 months ago
Predicting Learners' Emotional Response in Intelligent Distance Learning Systems
Different research studies have proved that emotions meet a pivotal role in cognitive processes and in particular the studies made by Damasio who argues that human-beings without ...
Soumaya Chaffar, Claude Frasson
DAGSTUHL
2001
13 years 9 months ago
Understanding Algorithms by Means of Visualized Path Testing
Visualization of an algorithm offers only a rough picture of operations. Explanations are crucial for deeper understanding, because they help the viewer to associate the visualiza...
Ari Korhonen, Erkki Sutinen, Jorma Tarhio