On the properties of combination set operations

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

*この研究の対応する著者

研究成果: Article査読

11 被引用数 (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.

本文言語English
ページ(範囲)195-199
ページ数5
ジャーナルInformation Processing Letters
66
4
出版ステータスPublished - 1998 5 29
外部発表はい

ASJC Scopus subject areas

  • 計算理論と計算数学

フィンガープリント

「On the properties of combination set operations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル