Extracting Microstructure in Binary Constraint Networks

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.

• Type: Conference
• Year: 2006
• Where: CSCLP
• Authors: Chavalit Likitvivatanavong, Roland H. C. Yap
• Keywords: Artificial Intelligence, Binary Constraint Satisfaction, Constraint Arity, Constraint Network, CSCLP 2006