1278 search results - page 121 / 256 » The Complexity of Weighted Boolean |
ICSE
2003
IEEE-ACM
14 years 10 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
ICCD
2005
IEEE
14 years 7 months ago
2005
IEEE
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
FM
2009
Springer
14 years 4 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
ISMVL
2006
IEEE
14 years 4 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 ...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...