Please use this identifier to cite or link to this item:
|Title:||Many-to-many interchangeable sets of values in CSPs|
|Authors:||Likitvivatanavong, C. |
|Keywords:||Constraint satisfaction problems|
|Source:||Likitvivatanavong, C., Yap, R.H.C. (2013). Many-to-many interchangeable sets of values in CSPs. Proceedings of the ACM Symposium on Applied Computing : 86-91. ScholarBank@NUS Repository. https://doi.org/10.1145/2480362.2480382|
|Abstract:||Onto-substitutability has been shown to be intrinsic to how a domain value is considered redundant. A value is onto-substitutable if any solution involving that value remains a solution when that value is replaced by some other value. We redefine onto-substitutability to accommodate binary relationships and study its implication. Joint interchangeability, an extension of onto-substitutability to its interchangeabil-ity counterpart, emerges as one of the results. We propose a new way of removing interchangeable values by constructing a new value as an intermediate step, as well as introduce virtual interchangeability, a local reasoning that leads to joint interchangeability and allows values to be merged together. Copyright 2013 ACM.|
|Source Title:||Proceedings of the ACM Symposium on Applied Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 28, 2018
checked on Mar 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.