Abstract
The problem of constructing a combination set to represent a collection of all solutions by solving constraint satisfaction problems is considered. Two kinds of combination set operations, restriction and exclusion, are invented. Simplification theorems on these two operations plays an important role to avoid combinatorial explosions. In addition, a zero-suppressed BDD, a variation of ordered binary decision diagrams, is adopted to represent a combination set and efficient implementations of the two operations are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 195-199 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 66 |
| Issue number | 4 |
| Publication status | Published - 1998 May 29 |
| Externally published | Yes |
Keywords
- Binary decision diagram
- Combination set operations
- Constraint satisfaction problem
- Restriction and exclusion operators
- Zero-suppressed BDD
ASJC Scopus subject areas
- Computational Theory and Mathematics