573 search results - page 3 / 115 » Planning as Satisfiability with Preferences |
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
EWCBR
2008
Springer
13 years 7 months ago
2008
Springer
How to endow case-based reasoning systems with effective case adaptation capabilities is a classic problem. A significant impediment to developing automated adaptation procedures i...
ICRA
1999
IEEE
13 years 10 months ago
1999
IEEE
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
AUSAI
2007
Springer
13 years 9 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
AIPS
2008
13 years 8 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...