TCSPs Are visualized using Directed Constraint Graphs [10,20] 160, inf [10,2 20,30 [40,50] Simple Temporal Networks(STNs) (Dechter, Meiri, Pearl 91) At most one interval per constraint T=(a1≤X-X≤b) [30,40] [10,2 Too,m [10,20] Can't represent Disjoint activities 0,30 Sufficient to represent most allen relations 4050 simple metric constraintsTCSPs Are Visualized Using Directed Constraint Graphs 1 3 2 4 0 [10,20] [30,40] [60,inf] [10,20] [20,30] [40,50] [60,70] Simple Temporal Networks (STNs) (Dechter, Meiri, Pearl 91) At most one interval per constraint • Tij = (aijd Xi - Xj d bij) 1 3 2 4 0 [10,20] [30,40] [60,inf] [10,20] [20,30] [40,50] [60,70] Sufficient to represent: • most Allen relations • simple metric constraints Sufficient to represent: • most Allen relations • simple metric constraints Can’t represent: • Disjoint activities Can’t represent: • Disjoint activities