920 search results - page 2 / 184 » Generating Satisfiable Problem Instances |
IJCAI
1997
13 years 6 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
AI
2007
Springer
13 years 5 months ago
2007
Springer
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
CP
2000
Springer
13 years 8 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...