160 search results - page 3 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
WSCG
2003
14 years 11 months ago
2003
Boolean operations and feature-based modeling are closely linked domains. For example, several, sometimes many Boolean operations are involved during a feature instantiation or mo...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
IDEAS
2002
IEEE
15 years 2 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...