On the properties of combination set operations

Hiroshi G. Okuno, Shin Ichi Minato, Hideki Isozaki

Research output: Contribution to journalArticle

10 Citations (Scopus)

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

Fingerprint

Binary decision diagrams
Constraint satisfaction problems
Explosions
Ordered Binary Decision Diagrams
Constraint Satisfaction Problem
Efficient Implementation
Explosion
Simplification
Restriction
Zero
Theorem

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

Cite this

On the properties of combination set operations. / Okuno, Hiroshi G.; Minato, Shin Ichi; Isozaki, Hideki.

In: Information Processing Letters, Vol. 66, No. 4, 29.05.1998, p. 195-199.

Research output: Contribution to journalArticle

Okuno, HG, Minato, SI & Isozaki, H 1998, 'On the properties of combination set operations', Information Processing Letters, vol. 66, no. 4, pp. 195-199.
Okuno, Hiroshi G. ; Minato, Shin Ichi ; Isozaki, Hideki. / On the properties of combination set operations. In: Information Processing Letters. 1998 ; Vol. 66, No. 4. pp. 195-199.
@article{733398e0085341ee9939dd9aa037e5c3,
title = "On the properties of combination set operations",
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.",
keywords = "Binary decision diagram, Combination set operations, Constraint satisfaction problem, Restriction and exclusion operators, Zero-suppressed BDD",
author = "Okuno, {Hiroshi G.} and Minato, {Shin Ichi} and Hideki Isozaki",
year = "1998",
month = "5",
day = "29",
language = "English",
volume = "66",
pages = "195--199",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - On the properties of combination set operations

AU - Okuno, Hiroshi G.

AU - Minato, Shin Ichi

AU - Isozaki, Hideki

PY - 1998/5/29

Y1 - 1998/5/29

N2 - 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.

AB - 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.

KW - Binary decision diagram

KW - Combination set operations

KW - Constraint satisfaction problem

KW - Restriction and exclusion operators

KW - Zero-suppressed BDD

UR - http://www.scopus.com/inward/record.url?scp=0042764696&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042764696&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0042764696

VL - 66

SP - 195

EP - 199

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -