Speeding Up Constrained Path Solvers with a Reachability Propagator
We present a propagator which we call Reachability that implements a generalized reachability constraint on a directed graph g. Given a source node source in g, we can identify three parts in the Reachability constraint: (1) the relation between each node of g and the set of nodes that it reaches, (2) the association of each pair of nodes 〈source,i 〉 with its set of cut nodes, and (3) the association of each pair of nodes 〈source,i 〉 with its set of bridges.
- [Moz04]Consortium, M.: The Mozart Programming System, version 1.3.0 (2004), Available at http://www.mozart-oz.org/
- [QVD05a]Quesada, L., Von Roy, P., Deville, Y.: Reachability: a constrained path propagator implemented as a multi-agent system. In: CLEI 2005 Proceedings (2005)Google Scholar
- [QVD05b]Quesada, L., Von Roy, P., Deville, Y.: The reachability propagator. Research Report INFO-2005-07, Université catholique de Louvain, Louvain-la-Neuve, Belgium (2005), Available at http://www.info.ucl.ac.be/~luque/SPMN/paper.pdf