We introduce a notion of equally constrained variables of a constraint network. We propose a method of pruning that uses the notion. We combine the proposed method of pruning with FC-CBJ and call the resulting algorithm FC-CBJ-EQ. Our experimental results show that FC-CBJ-EQ outperforms FC-CBJ on constraint networks that encode randomly generated instances of graph k-coloring and of the subgraph isomorphism problems. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Razgon, I., & Meisels, A. (2005). Pruning by equally constrained variables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3419 LNAI, pp. 26–40). https://doi.org/10.1007/11402763_3
Mendeley helps you to discover research relevant for your work.