Maintaining knowledge about temporal intervals
Communications of the ACM
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Scheduling is typically a quantitative engineering problem involving tasks and constraints. However, there are many real life situations where the input is qualitative in nature and any quantitative information is neither available nor cared for. We address here such a qualitative scheduling problem with disjunctive temporal constraints between the tasks. The problem we address is incremental in nature, where a new task is added to a committed schedule. We not only find a valid schedule when it exists, but also analyze the causes of inconsistency otherwise. This is new direction of research.