144 search results - page 15 / 29 » The complexity of Boolean formula minimization |
179
click to vote
ISMVL
2006
IEEE
16 years 1 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
168
Voted
ENTCS
2006
15 years 7 months ago
2006
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
150
Voted
DM
2006
15 years 7 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
167
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
185
Voted
DFT
2003
IEEE
16 years 23 days ago
2003
IEEE
In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally...