Artificial Intelligence - Special issue on knowledge representation
Backtracking algorithms for disjunctions of temporal constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Scheduling alternative activities
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Augmenting disjunctive temporal problems with finite-domain constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Handling alternative activities in resource-constrained project scheduling problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Resource temporal networks: definition and complexity
IJCAI'03 Proceedings of the 18th international joint conference on 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
Optimizing alternatives in precedence networks
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
MAK₠: a system for modelling, optimising, and analyzing production in small and medium enterprises
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alternative and parallel processes in production scheduling, however the problem of deciding which nodes can be consistently included in such networks is NP-complete. A tractable subclass, called Nested TNAs, can still cover a wide range of real-life processes, while the problem of deciding node validity is solvable in polynomial time. In this paper, we show that adding simple temporal constraints (instead of precedence relations) to Nested TNAs makes the problem NP-hard again. We also present several complete and incomplete techniques for temporal reasoning in Nested TNAs.