On the properties of combination set operations

Hiroshi G. Okuno*, Shin Ichi Minato, Hideki Isozaki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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 languageEnglish
Pages (from-to)195-199
Number of pages5
JournalInformation Processing Letters
Issue number4
Publication statusPublished - 1998 May 29
Externally publishedYes


  • Binary decision diagram
  • Combination set operations
  • Constraint satisfaction problem
  • Restriction and exclusion operators
  • Zero-suppressed BDD

ASJC Scopus subject areas

  • Computational Theory and Mathematics


Dive into the research topics of 'On the properties of combination set operations'. Together they form a unique fingerprint.

Cite this