Introduction to algorithms
Artificial Intelligence - Special issue on knowledge representation
Issues in temporal reasoning for autonomous control systems
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Remote Agent: to boldly go where no AI system has gone before
Artificial Intelligence - Special issue: artificial intelligence 40 years later
Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Integrating AI components for a military planning application
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Contingent durations in temporal CSPs: from consistency to controllabilities
TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
| Hi-index | 0.00 |
Simple Temporal Networks have proved useful in applications that involve metric time. However, many applications involve events whose timing is not controlled by the execution agent. A number of properties relating to overall controllability in such cases have been introduced in [Vidal and Ghallab, 1996] and [Vidal and Fargier, 1997], including Weak and Strong Controllability. We derive some new results concerning these properties. In particular, we prove the negation of Weak Controllability is NP-hard, confirming a conjecture in [Vidal and Fargier, 1997]. We also introduce a more general controllability property of which Weak and Strong Controllability are special cases. A propagation algorithm is provided for determining whether the property holds, and we identify tractable cases where the algorithm runs in polynomial time.