105 search results - page 9 / 21 » sat 2004 |
CP
2004
Springer
15 years 1 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
CSL
2004
Springer
15 years 2 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level descrip...
SAT
2004
Springer
15 years 2 months 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...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...