312 search results - page 14 / 63 » On Temporal Planning as CSP |
LOGCOM
2002
13 years 7 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
AIEDAM
1999
13 years 7 months ago
1999
A temporal logic for representing and reasoning on a robotic domain is presented. Actions are represented by describing what is true while the action itself is occurring, and plan...
ECAI
2000
Springer
13 years 12 months ago
2000
Springer
Domain-specific control information is often essential in solving difficult planning problems efficiently. Temporal logics are a declarative and expressive representation for su...