610 search results - page 69 / 122 » Using SAT in QBF |
CSL
2007
Springer
14 years 2 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
Routing infrastructure plays a vital role in the Internet, and attacks on routers can be damaging. Compromised routers can drop, modify, mis-forward or reorder valid packets. Exis...
GLVLSI
2005
IEEE
14 years 1 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
AIPS
2006
13 years 9 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...