The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence 139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between local...
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...
The algorithm (Jussien and Lhomme,
(2002) 21–45),
which has been designed to solve (CSP), can
be seen, either (i) as an extension of the classical algorithm with the introduction of a free choice of the variable to
which to backtrack in case of inconsistency, or (ii) as a algorithm in the space of the partial consistent variable
assignments. or (iii) as a hybridisation between
and . Experiments reported in
Pralet and Verfailllie (2004) show that some heuristics for the choice...
Download Results (CSV)