2266 search results - page 352 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
127
click to vote
DEXAW
2005
IEEE
15 years 9 months ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
135
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
133
click to vote
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
115
click to vote
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
103
click to vote
ITC
2002
IEEE
15 years 9 months ago
2002
IEEE
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...