201 search results - page 6 / 41 » Using a SAT solver to generate checking sequences |
154
Voted
ISCAS
2006
IEEE
16 years 11 days ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
119
Voted
SAT
2004
Springer
15 years 11 months ago
2004
Springer
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
167
Voted
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
174
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
161
Voted
CP
2007
Springer
16 years 16 days ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...