28 search results - page 4 / 6 » Translating Pseudo-Boolean Constraints into SAT |
ICCAD
2002
IEEE
14 years 3 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
ASPDAC
2005
ACM
14 years 7 days ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
SAT
2004
Springer
14 years 23 hour ago
2004
Springer
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...