210 search results - page 6 / 42 » Universal Booleanization of Constraint Models |
SAT
2011
Springer
13 years 1 months ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
TCS
2011
13 years 5 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
CL
2000
Springer
14 years 2 months ago
2000
Springer
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these ta...
CAV
2004
Springer
14 years 2 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...