Pruning by equally constrained variables

Authors:
Igor Razgon;Amnon Meisels
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Year:
2004

Citing 8
Cited 1

Characterising tractable constraints

Artificial Intelligence
Constraint tightness and looseness versus local and global consistency

Journal of the ACM (JACM)
On the computation of local interchangeability in discrete constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking Revisited

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Look-ahead value ordering for constraint satisfaction problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Eliminating interchangeable values in constraint satisfaction problems

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1

A CSP Search Algorithm with Responsibility Sets and Kernels

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.