Dynamic CSPs for Interval-Based Temporal Reasoning

Dynamic Path Consistency for Spatial Reasoning

“…Our objective is the ability to deal with topological relations in a dynamic environment (add or remove topological relation) by adapting the technique presented in [8] for the topological relations managed in SpaceOntology. This technique concerns the dynamic constraint satisfaction in the case of temporal networks based on Allen's primitives.…”

“…In this particular case, removing one or more Allen primitives from the universal relation is equivalent to adding a new constraint. The details of the constraint restriction and relaxation methods are presented in [8].…”

“…This technique concerns the dynamic constraint satisfaction in the case of temporal networks based on Allen's primitives. According to [8] a Dynamic Temporal Constraint Satisfaction Problem (DTCSP) is a sequence of static TCSPs (Temporal Constraint Satisfaction Problem [9]): T CSP 0 , T CSP 1 , T CSP 2 , . .…”

“…(1) we use SpaceOntology [5] to represent the spatial knowledge (2) we adapt the dynamic path consistency algorithm (initially proposed for temporal constraints) [8] for the case of spatial relations. In order to evaluate the performance of our dynamic path consistency method, we conducted several tests on instantiations of SpaceOntology in addition to randomly generated spatial constraint problems.The results of these tests demonstrate the efficiency of our method to deal with large size problems in a dynamic environment.…”

Constraint propagation versus local search for incremental temporal constraint problems

“…DAC is the new arc consistency algorithm AC-3 [6,7] we have adapted for temporal constraints in a dynamic environment. A detailed description of DAC can be found in [8].…”