Artificial Intelligence - Special issue on knowledge representation
Remote Agent: to boldly go where no AI system has gone before
Artificial Intelligence - Special issue: artificial intelligence 40 years later
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
Executing reactive, model-based programs through graph-based temporal planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Disjunctive temporal planning with uncertainty
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving temporal problems using SMT: strong controllability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing agent. We investigate the semantics of DTPU constraints, refining the existing notion that they are simply disjunctions of STPU constraints. We then develop the first sound and complete algorithm to determine whether Strong Controllability holds for a DTPU. We analyze the complexity of our algorithm with respect to the number of constraints in different classes, showing that, for several common subclasses of DTPUs, determining Strong Controllability has the same complexity as solving DTPs.