Representation and reasoning with disjunctive temporal constraints
Tóm tắt
We show the expressiveness provided by a labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to manage disjunctive assertions, conjunctive and hypothetical queries, and one-to-many constraints. Additionally, it becomes an adequate support for reasoning on costs associated to constraints.
Từ khóa
#Algebra #Costs #Time factors #Computational efficiency #Processor scheduling #Project managementTài liệu tham khảo
barber, 2000, Reasoning on interval and point-based disjunctive metric constraints in temporal contexts, J of A I Research, 122, 35
10.1145/182.358434
stergiou, 1998, Backtracking algorithms for disjunctions of temporal constraints, Proceed of the 15th AAAI-98
10.1016/0004-3702(92)90043-W
10.1109/69.634754
10.1017/S026988890000792X
vilain, 1986, Constraint propagation algorithm for temporal reasoning, 5th Nat Conf on A I, 377
10.1016/S0004-3702(98)00031-9
10.1016/0004-3702(91)90006-6
alfonso, 2001, A mixed closure-csp method to solve scheduling problems, Proceed of the 14th IEA/AIE 2001, 559
10.1016/0004-3702(95)00109-3
alfonso, 2001, Un modelo de integracion de tecnicas de clausura y CSP de restricc. temp.: aplicacion a problemas de scheduling