105 search results - page 10 / 21 » sat 2004 |
ASPDAC
2004
ACM
15 years 2 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
AAAI
2004
14 years 10 months ago
2004
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
AI
2005
Springer
14 years 9 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
FPL
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper proposes an architecture that combines a contextswitching virtual configware/software SAT solver with an embedded processor to promote a tighter coupling betwe...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...