Please use this identifier to cite or link to this item:
|Title:||Extracting microstructure in binary constraint networks|
|Authors:||Likitvivatanavong, C. |
|Citation:||Likitvivatanavong, C.,Yap, R.H.C. (2007). Extracting microstructure in binary constraint networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4651 LNAI : 124-138. ScholarBank@NUS Repository.|
|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. © Springer-Verlag Berlin Heidelberg 2007.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.