920 search results - page 5 / 184 » Generating Satisfiable Problem Instances |
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
ECAI
2008
Springer
13 years 9 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...
IJCSA
2007
13 years 7 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
VLSID
2010
IEEE
13 years 5 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
AAAI
1994
13 years 9 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...