Extracting microstructure in binary constraint networks

Authors:
Chavalit Likitvivatanavong;Roland H. C. Yap
Affiliations:
School of Computing, National University of Singapore, Singapore;School of Computing, National University of Singapore, Singapore
Venue:
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Year:
2006

Citing 12
Cited 0

Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Weak-commitment search for solving constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Dead-end driven learning

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the minimality and global consistency of row-convex constraint networks

Journal of the ACM (JACM)
Binary vs. non-binary constraints

Artificial Intelligence
Domain transmutation in constraint satisfaction problems

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Domain filtering consistencies

Journal of Artificial Intelligence Research
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results

Journal of Artificial Intelligence Research
Extracting constraint satisfaction subproblems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Neighborhood inverse consistency preprocessing

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value fragments. Applications include removing nogoods while maintaining constraint arity, learning nogoods in the constraint network, enforcing on neighborhood inverse consistency and removal of unsolvable sub-problems from the constraint network.