Sciweavers

312 search results - page 13 / 63
» On Temporal Planning as CSP
Sort
View
ICTAI
2003
IEEE
14 years 24 days ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
AIPS
2010
13 years 10 months ago
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
CSFW
2005
IEEE
14 years 1 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider
ECAI
2004
Springer
14 years 28 days ago
Compilation of LTL Goal Formulas into PDDL
Abstract. Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extend...
Stephen Cresswell, Alexandra M. Coddington
CP
1995
Springer
13 years 11 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace