Consistency of Constraint Reifications by Reformulation
Many combinatorial problems can be formulated via constraints, i.e., relations between variables’ values to be satisfied in order for them to count as a solution for the problem. A lot of these combinatorial relations can be applied to an arbitrary number of arguments, these constraints are called g...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2014
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-229577 |