380 search results - page 21 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
SAT
2004
Springer
14 years 27 days ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
DSD
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers,...
RANDOM
2001
Springer
13 years 12 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper addresses two problems related to disjointsupport decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results...
CP
2004
Springer
14 years 28 days ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...