Interchangeability supports abstraction and reformulation for constraint satisfaction
| Author(s) : | Daniel Sabin Eugene C. Freuder, |
| Publisher : | N/A |
| Publication Date : | 1995 |
| ISSN : | N/A |
| Abstract : | Constraint satisfaction problems (CSPs) involve finding values for problem variables subject to constraints on which combinations of values are allowed. They have, |